/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/sum01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:47:55,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:47:55,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:47:55,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:47:55,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:47:55,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:47:55,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:47:55,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:47:55,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:47:55,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:47:55,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:47:55,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:47:55,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:47:55,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:47:55,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:47:55,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:47:55,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:47:55,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:47:55,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:47:55,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:47:55,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:47:55,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:47:55,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:47:55,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:47:55,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:47:55,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:47:55,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:47:55,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:47:55,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:47:55,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:47:55,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:47:55,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:47:55,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:47:55,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:47:55,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:47:55,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:47:55,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:47:55,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:47:55,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:47:55,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:47:55,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:47:55,871 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:47:55,885 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:47:55,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:47:55,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:47:55,888 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:47:55,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:47:55,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:47:55,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:47:55,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:47:55,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:47:55,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:47:55,890 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:47:55,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:47:55,890 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:47:55,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:47:55,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:47:55,891 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:47:55,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:47:55,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:47:55,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:55,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:47:55,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:47:55,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:47:55,892 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:47:56,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:47:56,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:47:56,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:47:56,176 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:47:56,176 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:47:56,177 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2020-07-18 00:47:56,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf33768a5/4a934606e3154a3e8609531deccc9475/FLAG0a8d9d07a [2020-07-18 00:47:56,690 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:47:56,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2020-07-18 00:47:56,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf33768a5/4a934606e3154a3e8609531deccc9475/FLAG0a8d9d07a [2020-07-18 00:47:57,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf33768a5/4a934606e3154a3e8609531deccc9475 [2020-07-18 00:47:57,084 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:47:57,087 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:47:57,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:57,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:47:57,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:47:57,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:57" (1/1) ... [2020-07-18 00:47:57,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d3e0f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:57, skipping insertion in model container [2020-07-18 00:47:57,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:47:57" (1/1) ... [2020-07-18 00:47:57,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:47:57,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:47:57,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:57,274 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:47:57,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:47:57,304 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:47:57,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:57 WrapperNode [2020-07-18 00:47:57,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:47:57,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:47:57,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:47:57,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:47:57,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:57" (1/1) ... [2020-07-18 00:47:57,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:57" (1/1) ... [2020-07-18 00:47:57,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:57" (1/1) ... [2020-07-18 00:47:57,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:57" (1/1) ... [2020-07-18 00:47:57,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:57" (1/1) ... [2020-07-18 00:47:57,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:57" (1/1) ... [2020-07-18 00:47:57,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:57" (1/1) ... [2020-07-18 00:47:57,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:47:57,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:47:57,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:47:57,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:47:57,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:47:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:47:57,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:47:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:47:57,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:47:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:47:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:47:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-18 00:47:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:47:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:47:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:47:57,740 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:47:57,741 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:47:57,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:57 BoogieIcfgContainer [2020-07-18 00:47:57,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:47:57,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:47:57,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:47:57,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:47:57,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:47:57" (1/3) ... [2020-07-18 00:47:57,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da131af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:57, skipping insertion in model container [2020-07-18 00:47:57,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:47:57" (2/3) ... [2020-07-18 00:47:57,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da131af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:47:57, skipping insertion in model container [2020-07-18 00:47:57,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:47:57" (3/3) ... [2020-07-18 00:47:57,764 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2020-07-18 00:47:57,773 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:47:57,790 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:47:57,803 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:47:57,825 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:47:57,826 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:47:57,826 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:47:57,826 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:47:57,826 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:47:57,827 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:47:57,827 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:47:57,827 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:47:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-18 00:47:57,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-18 00:47:57,847 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:57,848 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:57,849 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:57,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:57,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1882057920, now seen corresponding path program 1 times [2020-07-18 00:47:57,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:57,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [599784200] [2020-07-18 00:47:57,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:58,005 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-18 00:47:58,006 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29#true} {29#true} #44#return; {29#true} is VALID [2020-07-18 00:47:58,008 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2020-07-18 00:47:58,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-18 00:47:58,009 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #44#return; {29#true} is VALID [2020-07-18 00:47:58,009 INFO L263 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret2 := main(); {29#true} is VALID [2020-07-18 00:47:58,010 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#true} havoc ~i~0; {29#true} is VALID [2020-07-18 00:47:58,010 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {29#true} is VALID [2020-07-18 00:47:58,010 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#true} havoc #t~nondet0; {29#true} is VALID [2020-07-18 00:47:58,011 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#true} ~sn~0 := 0; {29#true} is VALID [2020-07-18 00:47:58,011 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#true} ~i~0 := 1; {29#true} is VALID [2020-07-18 00:47:58,012 INFO L280 TraceCheckUtils]: 9: Hoare triple {29#true} assume !true; {30#false} is VALID [2020-07-18 00:47:58,013 INFO L263 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {30#false} is VALID [2020-07-18 00:47:58,013 INFO L280 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2020-07-18 00:47:58,013 INFO L280 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2020-07-18 00:47:58,014 INFO L280 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-18 00:47:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:58,017 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:58,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [599784200] [2020-07-18 00:47:58,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:58,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 00:47:58,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428890967] [2020-07-18 00:47:58,028 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-18 00:47:58,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:58,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 00:47:58,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:58,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 00:47:58,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:58,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 00:47:58,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:47:58,077 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2020-07-18 00:47:58,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:58,159 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-18 00:47:58,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 00:47:58,159 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-18 00:47:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:47:58,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2020-07-18 00:47:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:47:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2020-07-18 00:47:58,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 41 transitions. [2020-07-18 00:47:58,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:58,315 INFO L225 Difference]: With dead ends: 37 [2020-07-18 00:47:58,315 INFO L226 Difference]: Without dead ends: 20 [2020-07-18 00:47:58,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:47:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-18 00:47:58,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-18 00:47:58,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:58,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-18 00:47:58,371 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-18 00:47:58,371 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-18 00:47:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:58,375 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-18 00:47:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-18 00:47:58,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:58,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:58,376 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-18 00:47:58,377 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-18 00:47:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:58,380 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-18 00:47:58,380 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-18 00:47:58,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:58,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:58,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:58,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:58,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:47:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-18 00:47:58,389 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2020-07-18 00:47:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:58,390 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-18 00:47:58,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 00:47:58,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2020-07-18 00:47:58,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-18 00:47:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-18 00:47:58,426 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:58,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:58,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:47:58,427 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:58,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1869128626, now seen corresponding path program 1 times [2020-07-18 00:47:58,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:58,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [197690963] [2020-07-18 00:47:58,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:47:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:47:58,534 INFO L280 TraceCheckUtils]: 0: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-18 00:47:58,535 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {189#true} {189#true} #44#return; {189#true} is VALID [2020-07-18 00:47:58,535 INFO L263 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2020-07-18 00:47:58,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-18 00:47:58,536 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #44#return; {189#true} is VALID [2020-07-18 00:47:58,536 INFO L263 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret2 := main(); {189#true} is VALID [2020-07-18 00:47:58,536 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#true} havoc ~i~0; {189#true} is VALID [2020-07-18 00:47:58,537 INFO L280 TraceCheckUtils]: 5: Hoare triple {189#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {189#true} is VALID [2020-07-18 00:47:58,537 INFO L280 TraceCheckUtils]: 6: Hoare triple {189#true} havoc #t~nondet0; {189#true} is VALID [2020-07-18 00:47:58,538 INFO L280 TraceCheckUtils]: 7: Hoare triple {189#true} ~sn~0 := 0; {193#(= 0 main_~sn~0)} is VALID [2020-07-18 00:47:58,539 INFO L280 TraceCheckUtils]: 8: Hoare triple {193#(= 0 main_~sn~0)} ~i~0 := 1; {193#(= 0 main_~sn~0)} is VALID [2020-07-18 00:47:58,539 INFO L280 TraceCheckUtils]: 9: Hoare triple {193#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {193#(= 0 main_~sn~0)} is VALID [2020-07-18 00:47:58,541 INFO L263 TraceCheckUtils]: 10: Hoare triple {193#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {194#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:47:58,542 INFO L280 TraceCheckUtils]: 11: Hoare triple {194#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {195#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:47:58,545 INFO L280 TraceCheckUtils]: 12: Hoare triple {195#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {190#false} is VALID [2020-07-18 00:47:58,545 INFO L280 TraceCheckUtils]: 13: Hoare triple {190#false} assume !false; {190#false} is VALID [2020-07-18 00:47:58,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:47:58,548 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:47:58,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [197690963] [2020-07-18 00:47:58,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:47:58,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:47:58,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497726059] [2020-07-18 00:47:58,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-18 00:47:58,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:47:58,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:47:58,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:58,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:47:58,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:47:58,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:47:58,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:47:58,577 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2020-07-18 00:47:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:58,741 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-18 00:47:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:47:58,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-18 00:47:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:47:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-18 00:47:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:47:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-18 00:47:58,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-18 00:47:58,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:58,804 INFO L225 Difference]: With dead ends: 31 [2020-07-18 00:47:58,805 INFO L226 Difference]: Without dead ends: 26 [2020-07-18 00:47:58,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:47:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-18 00:47:58,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-18 00:47:58,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:47:58,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-18 00:47:58,838 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-18 00:47:58,838 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-18 00:47:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:58,841 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-18 00:47:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-18 00:47:58,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:58,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:58,842 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-18 00:47:58,842 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-18 00:47:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:47:58,845 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-18 00:47:58,845 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-18 00:47:58,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:47:58,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:47:58,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:47:58,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:47:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-18 00:47:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-18 00:47:58,848 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2020-07-18 00:47:58,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:47:58,848 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-18 00:47:58,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:47:58,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2020-07-18 00:47:58,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:47:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-18 00:47:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-18 00:47:58,884 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:47:58,884 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:47:58,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:47:58,885 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:47:58,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:47:58,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1535432394, now seen corresponding path program 1 times [2020-07-18 00:47:58,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:47:58,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [86295653] [2020-07-18 00:47:58,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:01,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {364#true} assume true; {364#true} is VALID [2020-07-18 00:48:01,535 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {364#true} {364#true} #44#return; {364#true} is VALID [2020-07-18 00:48:01,536 INFO L263 TraceCheckUtils]: 0: Hoare triple {364#true} call ULTIMATE.init(); {364#true} is VALID [2020-07-18 00:48:01,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {364#true} assume true; {364#true} is VALID [2020-07-18 00:48:01,536 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {364#true} {364#true} #44#return; {364#true} is VALID [2020-07-18 00:48:01,537 INFO L263 TraceCheckUtils]: 3: Hoare triple {364#true} call #t~ret2 := main(); {364#true} is VALID [2020-07-18 00:48:01,537 INFO L280 TraceCheckUtils]: 4: Hoare triple {364#true} havoc ~i~0; {364#true} is VALID [2020-07-18 00:48:01,538 INFO L280 TraceCheckUtils]: 5: Hoare triple {364#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {364#true} is VALID [2020-07-18 00:48:01,538 INFO L280 TraceCheckUtils]: 6: Hoare triple {364#true} havoc #t~nondet0; {364#true} is VALID [2020-07-18 00:48:01,540 INFO L280 TraceCheckUtils]: 7: Hoare triple {364#true} ~sn~0 := 0; {368#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 00:48:01,541 INFO L280 TraceCheckUtils]: 8: Hoare triple {368#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {369#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 00:48:01,545 INFO L280 TraceCheckUtils]: 9: Hoare triple {369#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} [50] L13-6-->L13-7_primed: Formula: (let ((.cse1 (* (- 1) v_oct_main_~n~0_out_1)) (.cse0 (* (- 1) v_oct_main_~n~0_in_1))) (or (and (<= (* 2 v_oct_main_~i~0_in_1) 18) (<= (+ (* (- 1) v_oct_main_~sn~0_in_1) v_oct_main_~sn~0_out_1) 2) (<= (+ (* (- 1) v_oct_main_~i~0_out_1) v_oct_main_~i~0_in_1) (- 1)) (<= (+ .cse0 v_oct_main_~i~0_in_1) 0) (<= (+ .cse0 v_oct_main_~n~0_out_1) 0) (<= (+ (* (- 1) v_oct_main_~i~0_in_1) v_oct_main_~i~0_out_1) 1) (<= (+ v_oct_main_~n~0_in_1 .cse1) 0) (<= (+ (* (- 1) v_oct_main_~sn~0_out_1) v_oct_main_~sn~0_in_1) (- 2))) (let ((.cse3 (div (+ (* v_oct_main_~sn~0_in_1 (- 1)) v_oct_main_~sn~0_out_1 (- 4)) 2)) (.cse2 (div (+ v_oct_main_~sn~0_in_1 (* v_oct_main_~sn~0_out_1 (- 1)) 4) (- 2)))) (and (<= (+ .cse1 v_oct_main_~n~0_in_1) 0) (<= (+ v_oct_main_~n~0_out_1 .cse0) 0) (<= (+ .cse2 v_oct_main_~i~0_in_1) 8) (<= v_oct_main_~i~0_out_1 (+ v_oct_main_~i~0_in_1 .cse3 2)) (<= 0 .cse3) (<= v_oct_main_~i~0_out_1 (+ v_oct_main_~n~0_in_1 1)) (<= (+ .cse2 v_oct_main_~i~0_in_1 2) v_oct_main_~i~0_out_1))))) InVars {main_~i~0=v_oct_main_~i~0_in_1, main_~n~0=v_oct_main_~n~0_in_1, main_~sn~0=v_oct_main_~sn~0_in_1} OutVars{main_~i~0=v_oct_main_~i~0_out_1, main_~n~0=v_oct_main_~n~0_out_1, main_~sn~0=v_oct_main_~sn~0_out_1, main_#t~post1=|v_oct_main_#t~post1_out_1|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0, main_~n~0] {370#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< (* 2 main_~n~0) (+ main_~sn~0 1))))} is VALID [2020-07-18 00:48:01,546 INFO L280 TraceCheckUtils]: 10: Hoare triple {370#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< (* 2 main_~n~0) (+ main_~sn~0 1))))} [49] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_3 v_main_~n~0_2)) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {371#(and (<= main_~sn~0 (* 2 main_~n~0)) (< (* 2 main_~n~0) (+ main_~sn~0 1)))} is VALID [2020-07-18 00:48:01,548 INFO L263 TraceCheckUtils]: 11: Hoare triple {371#(and (<= main_~sn~0 (* 2 main_~n~0)) (< (* 2 main_~n~0) (+ main_~sn~0 1)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {372#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:01,548 INFO L280 TraceCheckUtils]: 12: Hoare triple {372#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {373#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:01,549 INFO L280 TraceCheckUtils]: 13: Hoare triple {373#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {365#false} is VALID [2020-07-18 00:48:01,549 INFO L280 TraceCheckUtils]: 14: Hoare triple {365#false} assume !false; {365#false} is VALID [2020-07-18 00:48:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:48:01,822 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:01,822 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [86295653] [2020-07-18 00:48:01,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:01,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-18 00:48:01,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860205542] [2020-07-18 00:48:01,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2020-07-18 00:48:01,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:01,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 00:48:01,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:01,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 00:48:01,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:01,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 00:48:01,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-07-18 00:48:01,853 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2020-07-18 00:48:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:02,397 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2020-07-18 00:48:02,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-18 00:48:02,397 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2020-07-18 00:48:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 00:48:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2020-07-18 00:48:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 00:48:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2020-07-18 00:48:02,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 50 transitions. [2020-07-18 00:48:02,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:02,468 INFO L225 Difference]: With dead ends: 50 [2020-07-18 00:48:02,468 INFO L226 Difference]: Without dead ends: 31 [2020-07-18 00:48:02,469 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2020-07-18 00:48:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-18 00:48:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-07-18 00:48:02,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:02,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2020-07-18 00:48:02,513 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2020-07-18 00:48:02,514 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2020-07-18 00:48:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:02,517 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-18 00:48:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-18 00:48:02,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:02,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:02,518 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2020-07-18 00:48:02,518 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2020-07-18 00:48:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:02,521 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-18 00:48:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-18 00:48:02,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:02,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:02,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:02,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 00:48:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-18 00:48:02,524 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2020-07-18 00:48:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:02,524 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-18 00:48:02,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 00:48:02,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-18 00:48:02,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 00:48:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-18 00:48:02,556 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:02,556 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:02,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:48:02,556 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:02,557 INFO L82 PathProgramCache]: Analyzing trace with hash -927596731, now seen corresponding path program 1 times [2020-07-18 00:48:02,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:02,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [389771412] [2020-07-18 00:48:02,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:05,146 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:66) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.constructCopy(TransFormulaBuilder.java:503) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.fastupr.FastUPRFormulaBuilder.buildTransFormula(FastUPRFormulaBuilder.java:121) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.fastupr.FastUPRCore.getResult(FastUPRCore.java:428) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.Accelerator.fastUprAcceleration(Accelerator.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.Accelerator.accelerateLoop(Accelerator.java:75) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:236) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:48:05,152 INFO L168 Benchmark]: Toolchain (without parser) took 8065.28 ms. Allocated memory was 137.4 MB in the beginning and 248.5 MB in the end (delta: 111.1 MB). Free memory was 102.5 MB in the beginning and 97.3 MB in the end (delta: 5.2 MB). Peak memory consumption was 116.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:05,153 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:48:05,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.71 ms. Allocated memory is still 137.4 MB. Free memory was 102.1 MB in the beginning and 92.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:05,154 INFO L168 Benchmark]: Boogie Preprocessor took 31.22 ms. Allocated memory is still 137.4 MB. Free memory was 92.6 MB in the beginning and 91.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:05,155 INFO L168 Benchmark]: RCFGBuilder took 408.04 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 91.1 MB in the beginning and 165.1 MB in the end (delta: -74.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:05,156 INFO L168 Benchmark]: TraceAbstraction took 7402.45 ms. Allocated memory was 201.3 MB in the beginning and 248.5 MB in the end (delta: 47.2 MB). Free memory was 164.4 MB in the beginning and 97.3 MB in the end (delta: 67.0 MB). Peak memory consumption was 114.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:05,160 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 214.71 ms. Allocated memory is still 137.4 MB. Free memory was 102.1 MB in the beginning and 92.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.22 ms. Allocated memory is still 137.4 MB. Free memory was 92.6 MB in the beginning and 91.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 408.04 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 91.1 MB in the beginning and 165.1 MB in the end (delta: -74.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7402.45 ms. Allocated memory was 201.3 MB in the beginning and 248.5 MB in the end (delta: 47.2 MB). Free memory was 164.4 MB in the beginning and 97.3 MB in the end (delta: 67.0 MB). Peak memory consumption was 114.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...