/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/float-newlib/double_req_bl_1072d.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 15:53:38,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 15:53:38,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 15:53:38,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 15:53:38,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 15:53:38,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 15:53:38,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 15:53:38,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 15:53:38,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 15:53:38,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 15:53:38,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 15:53:38,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 15:53:38,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 15:53:38,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 15:53:38,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 15:53:38,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 15:53:38,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 15:53:38,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 15:53:38,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 15:53:38,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 15:53:38,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 15:53:38,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 15:53:38,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 15:53:38,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 15:53:38,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 15:53:38,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 15:53:38,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 15:53:38,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 15:53:38,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 15:53:38,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 15:53:38,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 15:53:38,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 15:53:38,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 15:53:38,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 15:53:38,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 15:53:38,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 15:53:38,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 15:53:38,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 15:53:38,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 15:53:38,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 15:53:38,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 15:53:38,295 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 15:53:38,304 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 15:53:38,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 15:53:38,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 15:53:38,306 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 15:53:38,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 15:53:38,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 15:53:38,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 15:53:38,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 15:53:38,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 15:53:38,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 15:53:38,307 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 15:53:38,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 15:53:38,308 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 15:53:38,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 15:53:38,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 15:53:38,308 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 15:53:38,309 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 15:53:38,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 15:53:38,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 15:53:38,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 15:53:38,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 15:53:38,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 15:53:38,310 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 15:53:38,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 15:53:38,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 15:53:38,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 15:53:38,612 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 15:53:38,613 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 15:53:38,613 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1072d.c [2020-07-08 15:53:38,673 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dee5c13/fce39dd057294204bf468789ad1df27b/FLAG86e54bf80 [2020-07-08 15:53:39,104 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 15:53:39,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1072d.c [2020-07-08 15:53:39,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dee5c13/fce39dd057294204bf468789ad1df27b/FLAG86e54bf80 [2020-07-08 15:53:39,519 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dee5c13/fce39dd057294204bf468789ad1df27b [2020-07-08 15:53:39,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 15:53:39,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 15:53:39,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 15:53:39,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 15:53:39,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 15:53:39,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:53:39" (1/1) ... [2020-07-08 15:53:39,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2941ea2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:39, skipping insertion in model container [2020-07-08 15:53:39,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:53:39" (1/1) ... [2020-07-08 15:53:39,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 15:53:39,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 15:53:39,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:53:39,814 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 15:53:39,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:53:39,965 INFO L208 MainTranslator]: Completed translation [2020-07-08 15:53:39,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:39 WrapperNode [2020-07-08 15:53:39,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 15:53:39,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 15:53:39,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 15:53:39,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 15:53:39,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:39" (1/1) ... [2020-07-08 15:53:39,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:39" (1/1) ... [2020-07-08 15:53:39,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:39" (1/1) ... [2020-07-08 15:53:39,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:39" (1/1) ... [2020-07-08 15:53:40,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:39" (1/1) ... [2020-07-08 15:53:40,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:39" (1/1) ... [2020-07-08 15:53:40,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:39" (1/1) ... [2020-07-08 15:53:40,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 15:53:40,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 15:53:40,039 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 15:53:40,039 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 15:53:40,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:39" (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-08 15:53:40,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 15:53:40,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 15:53:40,100 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-08 15:53:40,100 INFO L138 BoogieDeclarations]: Found implementation of procedure trunc_double [2020-07-08 15:53:40,101 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2020-07-08 15:53:40,101 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 15:53:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 15:53:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-08 15:53:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure trunc_double [2020-07-08 15:53:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 15:53:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-08 15:53:40,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 15:53:40,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 15:53:40,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 15:53:40,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-08 15:53:40,102 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2020-07-08 15:53:40,102 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 15:53:40,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 15:53:40,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 15:53:40,743 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 15:53:40,743 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-08 15:53:40,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:53:40 BoogieIcfgContainer [2020-07-08 15:53:40,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 15:53:40,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 15:53:40,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 15:53:40,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 15:53:40,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 03:53:39" (1/3) ... [2020-07-08 15:53:40,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d93ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:53:40, skipping insertion in model container [2020-07-08 15:53:40,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:39" (2/3) ... [2020-07-08 15:53:40,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d93ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:53:40, skipping insertion in model container [2020-07-08 15:53:40,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:53:40" (3/3) ... [2020-07-08 15:53:40,758 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1072d.c [2020-07-08 15:53:40,769 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 15:53:40,778 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 15:53:40,792 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 15:53:40,815 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 15:53:40,815 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 15:53:40,816 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 15:53:40,816 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 15:53:40,816 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 15:53:40,816 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 15:53:40,817 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 15:53:40,817 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 15:53:40,834 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2020-07-08 15:53:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-08 15:53:40,848 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:53:40,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:53:40,850 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:53:40,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:53:40,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1396348261, now seen corresponding path program 1 times [2020-07-08 15:53:40,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:53:40,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2089595636] [2020-07-08 15:53:40,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:53:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:41,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {148#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {117#true} is VALID [2020-07-08 15:53:41,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {117#true} #valid := #valid[0 := 0]; {117#true} is VALID [2020-07-08 15:53:41,080 INFO L280 TraceCheckUtils]: 2: Hoare triple {117#true} assume 0 < #StackHeapBarrier; {117#true} is VALID [2020-07-08 15:53:41,080 INFO L280 TraceCheckUtils]: 3: Hoare triple {117#true} assume true; {117#true} is VALID [2020-07-08 15:53:41,081 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {117#true} {117#true} #185#return; {117#true} is VALID [2020-07-08 15:53:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:41,116 INFO L280 TraceCheckUtils]: 0: Hoare triple {149#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {117#true} is VALID [2020-07-08 15:53:41,117 INFO L280 TraceCheckUtils]: 1: Hoare triple {117#true} havoc ~signbit~0; {117#true} is VALID [2020-07-08 15:53:41,117 INFO L280 TraceCheckUtils]: 2: Hoare triple {117#true} havoc ~msw~0; {117#true} is VALID [2020-07-08 15:53:41,118 INFO L280 TraceCheckUtils]: 3: Hoare triple {117#true} havoc ~lsw~0; {117#true} is VALID [2020-07-08 15:53:41,118 INFO L280 TraceCheckUtils]: 4: Hoare triple {117#true} havoc ~exponent_less_1023~0; {117#true} is VALID [2020-07-08 15:53:41,119 INFO L280 TraceCheckUtils]: 5: Hoare triple {117#true} assume !true; {118#false} is VALID [2020-07-08 15:53:41,120 INFO L280 TraceCheckUtils]: 6: Hoare triple {118#false} ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); {118#false} is VALID [2020-07-08 15:53:41,120 INFO L280 TraceCheckUtils]: 7: Hoare triple {118#false} ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; {118#false} is VALID [2020-07-08 15:53:41,121 INFO L280 TraceCheckUtils]: 8: Hoare triple {118#false} assume ~exponent_less_1023~0 < 20; {118#false} is VALID [2020-07-08 15:53:41,121 INFO L280 TraceCheckUtils]: 9: Hoare triple {118#false} assume !(~exponent_less_1023~0 < 0); {118#false} is VALID [2020-07-08 15:53:41,122 INFO L280 TraceCheckUtils]: 10: Hoare triple {118#false} assume !true; {118#false} is VALID [2020-07-08 15:53:41,122 INFO L280 TraceCheckUtils]: 11: Hoare triple {118#false} #res := ~x; {118#false} is VALID [2020-07-08 15:53:41,123 INFO L280 TraceCheckUtils]: 12: Hoare triple {118#false} assume true; {118#false} is VALID [2020-07-08 15:53:41,123 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {118#false} {117#true} #181#return; {118#false} is VALID [2020-07-08 15:53:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:41,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {149#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {117#true} is VALID [2020-07-08 15:53:41,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {117#true} havoc ~hx~0; {117#true} is VALID [2020-07-08 15:53:41,139 INFO L280 TraceCheckUtils]: 2: Hoare triple {117#true} havoc ~lx~0; {117#true} is VALID [2020-07-08 15:53:41,140 INFO L280 TraceCheckUtils]: 3: Hoare triple {117#true} assume !true; {118#false} is VALID [2020-07-08 15:53:41,141 INFO L280 TraceCheckUtils]: 4: Hoare triple {118#false} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {118#false} is VALID [2020-07-08 15:53:41,141 INFO L280 TraceCheckUtils]: 5: Hoare triple {118#false} ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); {118#false} is VALID [2020-07-08 15:53:41,141 INFO L280 TraceCheckUtils]: 6: Hoare triple {118#false} ~hx~0 := 2146435072 - ~hx~0; {118#false} is VALID [2020-07-08 15:53:41,142 INFO L280 TraceCheckUtils]: 7: Hoare triple {118#false} #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {118#false} is VALID [2020-07-08 15:53:41,142 INFO L280 TraceCheckUtils]: 8: Hoare triple {118#false} assume true; {118#false} is VALID [2020-07-08 15:53:41,143 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {118#false} {118#false} #183#return; {118#false} is VALID [2020-07-08 15:53:41,145 INFO L263 TraceCheckUtils]: 0: Hoare triple {117#true} call ULTIMATE.init(); {148#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 15:53:41,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {148#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {117#true} is VALID [2020-07-08 15:53:41,146 INFO L280 TraceCheckUtils]: 2: Hoare triple {117#true} #valid := #valid[0 := 0]; {117#true} is VALID [2020-07-08 15:53:41,146 INFO L280 TraceCheckUtils]: 3: Hoare triple {117#true} assume 0 < #StackHeapBarrier; {117#true} is VALID [2020-07-08 15:53:41,147 INFO L280 TraceCheckUtils]: 4: Hoare triple {117#true} assume true; {117#true} is VALID [2020-07-08 15:53:41,147 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {117#true} {117#true} #185#return; {117#true} is VALID [2020-07-08 15:53:41,148 INFO L263 TraceCheckUtils]: 6: Hoare triple {117#true} call #t~ret16 := main(); {117#true} is VALID [2020-07-08 15:53:41,148 INFO L280 TraceCheckUtils]: 7: Hoare triple {117#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0); {117#true} is VALID [2020-07-08 15:53:41,150 INFO L263 TraceCheckUtils]: 8: Hoare triple {117#true} call #t~ret14 := trunc_double(~x~0); {149#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:41,151 INFO L280 TraceCheckUtils]: 9: Hoare triple {149#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {117#true} is VALID [2020-07-08 15:53:41,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {117#true} havoc ~signbit~0; {117#true} is VALID [2020-07-08 15:53:41,152 INFO L280 TraceCheckUtils]: 11: Hoare triple {117#true} havoc ~msw~0; {117#true} is VALID [2020-07-08 15:53:41,152 INFO L280 TraceCheckUtils]: 12: Hoare triple {117#true} havoc ~lsw~0; {117#true} is VALID [2020-07-08 15:53:41,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {117#true} havoc ~exponent_less_1023~0; {117#true} is VALID [2020-07-08 15:53:41,153 INFO L280 TraceCheckUtils]: 14: Hoare triple {117#true} assume !true; {118#false} is VALID [2020-07-08 15:53:41,154 INFO L280 TraceCheckUtils]: 15: Hoare triple {118#false} ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); {118#false} is VALID [2020-07-08 15:53:41,154 INFO L280 TraceCheckUtils]: 16: Hoare triple {118#false} ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; {118#false} is VALID [2020-07-08 15:53:41,155 INFO L280 TraceCheckUtils]: 17: Hoare triple {118#false} assume ~exponent_less_1023~0 < 20; {118#false} is VALID [2020-07-08 15:53:41,155 INFO L280 TraceCheckUtils]: 18: Hoare triple {118#false} assume !(~exponent_less_1023~0 < 0); {118#false} is VALID [2020-07-08 15:53:41,155 INFO L280 TraceCheckUtils]: 19: Hoare triple {118#false} assume !true; {118#false} is VALID [2020-07-08 15:53:41,156 INFO L280 TraceCheckUtils]: 20: Hoare triple {118#false} #res := ~x; {118#false} is VALID [2020-07-08 15:53:41,156 INFO L280 TraceCheckUtils]: 21: Hoare triple {118#false} assume true; {118#false} is VALID [2020-07-08 15:53:41,157 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {118#false} {117#true} #181#return; {118#false} is VALID [2020-07-08 15:53:41,157 INFO L280 TraceCheckUtils]: 23: Hoare triple {118#false} ~res~0 := #t~ret14; {118#false} is VALID [2020-07-08 15:53:41,157 INFO L280 TraceCheckUtils]: 24: Hoare triple {118#false} havoc #t~ret14; {118#false} is VALID [2020-07-08 15:53:41,158 INFO L263 TraceCheckUtils]: 25: Hoare triple {118#false} call #t~ret15 := isinf_double(~res~0); {149#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:41,158 INFO L280 TraceCheckUtils]: 26: Hoare triple {149#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {117#true} is VALID [2020-07-08 15:53:41,159 INFO L280 TraceCheckUtils]: 27: Hoare triple {117#true} havoc ~hx~0; {117#true} is VALID [2020-07-08 15:53:41,159 INFO L280 TraceCheckUtils]: 28: Hoare triple {117#true} havoc ~lx~0; {117#true} is VALID [2020-07-08 15:53:41,160 INFO L280 TraceCheckUtils]: 29: Hoare triple {117#true} assume !true; {118#false} is VALID [2020-07-08 15:53:41,161 INFO L280 TraceCheckUtils]: 30: Hoare triple {118#false} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {118#false} is VALID [2020-07-08 15:53:41,161 INFO L280 TraceCheckUtils]: 31: Hoare triple {118#false} ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); {118#false} is VALID [2020-07-08 15:53:41,161 INFO L280 TraceCheckUtils]: 32: Hoare triple {118#false} ~hx~0 := 2146435072 - ~hx~0; {118#false} is VALID [2020-07-08 15:53:41,162 INFO L280 TraceCheckUtils]: 33: Hoare triple {118#false} #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {118#false} is VALID [2020-07-08 15:53:41,162 INFO L280 TraceCheckUtils]: 34: Hoare triple {118#false} assume true; {118#false} is VALID [2020-07-08 15:53:41,163 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {118#false} {118#false} #183#return; {118#false} is VALID [2020-07-08 15:53:41,163 INFO L280 TraceCheckUtils]: 36: Hoare triple {118#false} assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; {118#false} is VALID [2020-07-08 15:53:41,163 INFO L280 TraceCheckUtils]: 37: Hoare triple {118#false} assume 0 == #t~ret15; {118#false} is VALID [2020-07-08 15:53:41,164 INFO L280 TraceCheckUtils]: 38: Hoare triple {118#false} havoc #t~ret15; {118#false} is VALID [2020-07-08 15:53:41,164 INFO L280 TraceCheckUtils]: 39: Hoare triple {118#false} assume !false; {118#false} is VALID [2020-07-08 15:53:41,174 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-08 15:53:41,175 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:53:41,177 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2089595636] [2020-07-08 15:53:41,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:53:41,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 15:53:41,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925937228] [2020-07-08 15:53:41,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-08 15:53:41,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:53:41,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 15:53:41,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:41,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 15:53:41,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:53:41,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 15:53:41,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 15:53:41,297 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 4 states. [2020-07-08 15:53:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:42,065 INFO L93 Difference]: Finished difference Result 213 states and 242 transitions. [2020-07-08 15:53:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 15:53:42,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-07-08 15:53:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:53:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 15:53:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 242 transitions. [2020-07-08 15:53:42,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 15:53:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 242 transitions. [2020-07-08 15:53:42,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 242 transitions. [2020-07-08 15:53:42,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:42,428 INFO L225 Difference]: With dead ends: 213 [2020-07-08 15:53:42,428 INFO L226 Difference]: Without dead ends: 107 [2020-07-08 15:53:42,433 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 15:53:42,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-07-08 15:53:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-07-08 15:53:42,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:53:42,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 107 states. [2020-07-08 15:53:42,579 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 107 states. [2020-07-08 15:53:42,579 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 107 states. [2020-07-08 15:53:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:42,594 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2020-07-08 15:53:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2020-07-08 15:53:42,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:53:42,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:53:42,597 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 107 states. [2020-07-08 15:53:42,597 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 107 states. [2020-07-08 15:53:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:42,620 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2020-07-08 15:53:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2020-07-08 15:53:42,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:53:42,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:53:42,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:53:42,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:53:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-08 15:53:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2020-07-08 15:53:42,634 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 40 [2020-07-08 15:53:42,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:53:42,635 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2020-07-08 15:53:42,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 15:53:42,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 107 states and 110 transitions. [2020-07-08 15:53:42,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2020-07-08 15:53:42,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-08 15:53:42,776 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:53:42,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:53:42,776 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 15:53:42,776 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:53:42,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:53:42,777 INFO L82 PathProgramCache]: Analyzing trace with hash -247930506, now seen corresponding path program 1 times [2020-07-08 15:53:42,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:53:42,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [319173300] [2020-07-08 15:53:42,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:53:43,012 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 15:53:43,013 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1012) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1159) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:214) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:266) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) 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-08 15:53:43,020 INFO L168 Benchmark]: Toolchain (without parser) took 3486.40 ms. Allocated memory was 143.7 MB in the beginning and 248.5 MB in the end (delta: 104.9 MB). Free memory was 100.3 MB in the beginning and 148.5 MB in the end (delta: -48.2 MB). Peak memory consumption was 56.7 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:43,021 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 143.7 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 15:53:43,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.16 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 179.6 MB in the end (delta: -79.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:43,023 INFO L168 Benchmark]: Boogie Preprocessor took 72.62 ms. Allocated memory is still 200.8 MB. Free memory was 179.6 MB in the beginning and 176.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:43,024 INFO L168 Benchmark]: RCFGBuilder took 710.07 ms. Allocated memory is still 200.8 MB. Free memory was 176.5 MB in the beginning and 127.9 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:43,025 INFO L168 Benchmark]: TraceAbstraction took 2266.75 ms. Allocated memory was 200.8 MB in the beginning and 248.5 MB in the end (delta: 47.7 MB). Free memory was 127.2 MB in the beginning and 148.5 MB in the end (delta: -21.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:43,029 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.26 ms. Allocated memory is still 143.7 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 429.16 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 179.6 MB in the end (delta: -79.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.62 ms. Allocated memory is still 200.8 MB. Free memory was 179.6 MB in the beginning and 176.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 710.07 ms. Allocated memory is still 200.8 MB. Free memory was 176.5 MB in the beginning and 127.9 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2266.75 ms. Allocated memory was 200.8 MB in the beginning and 248.5 MB in the end (delta: 47.7 MB). Free memory was 127.2 MB in the beginning and 148.5 MB in the end (delta: -21.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...