/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_1300.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:13:25,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:13:25,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:13:25,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:13:25,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:13:25,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:13:25,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:13:25,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:13:25,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:13:25,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:13:25,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:13:25,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:13:25,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:13:25,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:13:25,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:13:25,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:13:25,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:13:25,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:13:25,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:13:25,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:13:25,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:13:25,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:13:25,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:13:25,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:13:25,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:13:25,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:13:25,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:13:25,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:13:25,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:13:25,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:13:25,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:13:25,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:13:25,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:13:25,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:13:25,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:13:25,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:13:25,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:13:25,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:13:25,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:13:25,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:13:25,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:13:25,523 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:13:25,533 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:13:25,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:13:25,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:13:25,535 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:13:25,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:13:25,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:13:25,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:13:25,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:13:25,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:13:25,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:13:25,536 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:13:25,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:13:25,537 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:13:25,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:13:25,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:13:25,537 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:13:25,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:13:25,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:13:25,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:13:25,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:13:25,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:13:25,538 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:13:25,539 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:13:25,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:13:25,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:13:25,898 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:13:25,900 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:13:25,900 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:13:25,901 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1300.c [2020-07-18 00:13:25,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8c167d7c/fad5dbb0c8c240dda741cfe3b51b5c2b/FLAGe85f6b109 [2020-07-18 00:13:26,435 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:13:26,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1300.c [2020-07-18 00:13:26,443 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8c167d7c/fad5dbb0c8c240dda741cfe3b51b5c2b/FLAGe85f6b109 [2020-07-18 00:13:26,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8c167d7c/fad5dbb0c8c240dda741cfe3b51b5c2b [2020-07-18 00:13:26,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:13:26,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:13:26,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:13:26,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:13:26,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:13:26,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:13:26" (1/1) ... [2020-07-18 00:13:26,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24cc2e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:26, skipping insertion in model container [2020-07-18 00:13:26,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:13:26" (1/1) ... [2020-07-18 00:13:26,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:13:26,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:13:27,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:13:27,097 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:13:27,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:13:27,244 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:13:27,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:27 WrapperNode [2020-07-18 00:13:27,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:13:27,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:13:27,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:13:27,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:13:27,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:27" (1/1) ... [2020-07-18 00:13:27,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:27" (1/1) ... [2020-07-18 00:13:27,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:27" (1/1) ... [2020-07-18 00:13:27,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:27" (1/1) ... [2020-07-18 00:13:27,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:27" (1/1) ... [2020-07-18 00:13:27,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:27" (1/1) ... [2020-07-18 00:13:27,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:27" (1/1) ... [2020-07-18 00:13:27,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:13:27,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:13:27,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:13:27,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:13:27,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:27" (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:13:27,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:13:27,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:13:27,367 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2020-07-18 00:13:27,367 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-18 00:13:27,367 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_double [2020-07-18 00:13:27,367 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:13:27,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:13:27,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-18 00:13:27,368 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2020-07-18 00:13:27,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:13:27,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-18 00:13:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:13:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:13:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-18 00:13:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_double [2020-07-18 00:13:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:13:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:13:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:13:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-18 00:13:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:13:27,879 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:13:27,879 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-18 00:13:27,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:13:27 BoogieIcfgContainer [2020-07-18 00:13:27,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:13:27,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:13:27,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:13:27,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:13:27,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:13:26" (1/3) ... [2020-07-18 00:13:27,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec2bdc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:13:27, skipping insertion in model container [2020-07-18 00:13:27,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:13:27" (2/3) ... [2020-07-18 00:13:27,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec2bdc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:13:27, skipping insertion in model container [2020-07-18 00:13:27,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:13:27" (3/3) ... [2020-07-18 00:13:27,894 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1300.c [2020-07-18 00:13:27,905 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:13:27,913 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:13:27,929 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:13:27,956 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:13:27,956 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:13:27,956 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:13:27,956 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:13:27,957 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:13:27,957 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:13:27,958 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:13:27,958 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:13:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2020-07-18 00:13:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-18 00:13:27,990 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:27,991 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] [2020-07-18 00:13:27,991 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash -984491116, now seen corresponding path program 1 times [2020-07-18 00:13:28,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:28,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1431154720] [2020-07-18 00:13:28,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:28,243 INFO L280 TraceCheckUtils]: 0: Hoare triple {105#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {82#true} is VALID [2020-07-18 00:13:28,244 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} #valid := #valid[0 := 0]; {82#true} is VALID [2020-07-18 00:13:28,244 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} assume 0 < #StackHeapBarrier; {82#true} is VALID [2020-07-18 00:13:28,245 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-18 00:13:28,246 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {82#true} {82#true} #113#return; {82#true} is VALID [2020-07-18 00:13:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:28,297 INFO L280 TraceCheckUtils]: 0: Hoare triple {106#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-18 00:13:28,297 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} havoc ~hx~0; {82#true} is VALID [2020-07-18 00:13:28,298 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} havoc ~lx~0; {82#true} is VALID [2020-07-18 00:13:28,299 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-18 00:13:28,300 INFO L280 TraceCheckUtils]: 4: Hoare triple {83#false} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {83#false} is VALID [2020-07-18 00:13:28,300 INFO L280 TraceCheckUtils]: 5: Hoare triple {83#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); {83#false} is VALID [2020-07-18 00:13:28,301 INFO L280 TraceCheckUtils]: 6: Hoare triple {83#false} ~hx~0 := 2146435072 - ~hx~0; {83#false} is VALID [2020-07-18 00:13:28,301 INFO L280 TraceCheckUtils]: 7: Hoare triple {83#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); {83#false} is VALID [2020-07-18 00:13:28,301 INFO L280 TraceCheckUtils]: 8: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-18 00:13:28,302 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {83#false} {82#true} #107#return; {83#false} is VALID [2020-07-18 00:13:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:28,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {106#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-18 00:13:28,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {82#true} havoc ~hx~1; {82#true} is VALID [2020-07-18 00:13:28,347 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-18 00:13:28,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {83#false} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {83#false} is VALID [2020-07-18 00:13:28,348 INFO L280 TraceCheckUtils]: 4: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-18 00:13:28,348 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {83#false} {83#false} #111#return; {83#false} is VALID [2020-07-18 00:13:28,351 INFO L263 TraceCheckUtils]: 0: Hoare triple {82#true} call ULTIMATE.init(); {105#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:13:28,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {105#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {82#true} is VALID [2020-07-18 00:13:28,352 INFO L280 TraceCheckUtils]: 2: Hoare triple {82#true} #valid := #valid[0 := 0]; {82#true} is VALID [2020-07-18 00:13:28,353 INFO L280 TraceCheckUtils]: 3: Hoare triple {82#true} assume 0 < #StackHeapBarrier; {82#true} is VALID [2020-07-18 00:13:28,353 INFO L280 TraceCheckUtils]: 4: Hoare triple {82#true} assume true; {82#true} is VALID [2020-07-18 00:13:28,353 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {82#true} {82#true} #113#return; {82#true} is VALID [2020-07-18 00:13:28,354 INFO L263 TraceCheckUtils]: 6: Hoare triple {82#true} call #t~ret11 := main(); {82#true} is VALID [2020-07-18 00:13:28,354 INFO L280 TraceCheckUtils]: 7: Hoare triple {82#true} ~x~0 := #t~nondet6; {82#true} is VALID [2020-07-18 00:13:28,355 INFO L280 TraceCheckUtils]: 8: Hoare triple {82#true} havoc #t~nondet6; {82#true} is VALID [2020-07-18 00:13:28,359 INFO L263 TraceCheckUtils]: 9: Hoare triple {82#true} call #t~ret7 := isinf_double(~x~0); {106#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:13:28,359 INFO L280 TraceCheckUtils]: 10: Hoare triple {106#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-18 00:13:28,360 INFO L280 TraceCheckUtils]: 11: Hoare triple {82#true} havoc ~hx~0; {82#true} is VALID [2020-07-18 00:13:28,360 INFO L280 TraceCheckUtils]: 12: Hoare triple {82#true} havoc ~lx~0; {82#true} is VALID [2020-07-18 00:13:28,363 INFO L280 TraceCheckUtils]: 13: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-18 00:13:28,364 INFO L280 TraceCheckUtils]: 14: Hoare triple {83#false} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {83#false} is VALID [2020-07-18 00:13:28,364 INFO L280 TraceCheckUtils]: 15: Hoare triple {83#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); {83#false} is VALID [2020-07-18 00:13:28,364 INFO L280 TraceCheckUtils]: 16: Hoare triple {83#false} ~hx~0 := 2146435072 - ~hx~0; {83#false} is VALID [2020-07-18 00:13:28,365 INFO L280 TraceCheckUtils]: 17: Hoare triple {83#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); {83#false} is VALID [2020-07-18 00:13:28,365 INFO L280 TraceCheckUtils]: 18: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-18 00:13:28,365 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {83#false} {82#true} #107#return; {83#false} is VALID [2020-07-18 00:13:28,366 INFO L280 TraceCheckUtils]: 20: Hoare triple {83#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; {83#false} is VALID [2020-07-18 00:13:28,366 INFO L280 TraceCheckUtils]: 21: Hoare triple {83#false} #t~short9 := 0 == #t~ret7; {83#false} is VALID [2020-07-18 00:13:28,366 INFO L280 TraceCheckUtils]: 22: Hoare triple {83#false} assume !#t~short9; {83#false} is VALID [2020-07-18 00:13:28,367 INFO L280 TraceCheckUtils]: 23: Hoare triple {83#false} assume #t~short9; {83#false} is VALID [2020-07-18 00:13:28,367 INFO L280 TraceCheckUtils]: 24: Hoare triple {83#false} havoc #t~short9; {83#false} is VALID [2020-07-18 00:13:28,367 INFO L280 TraceCheckUtils]: 25: Hoare triple {83#false} havoc #t~ret7; {83#false} is VALID [2020-07-18 00:13:28,368 INFO L280 TraceCheckUtils]: 26: Hoare triple {83#false} havoc #t~ret8; {83#false} is VALID [2020-07-18 00:13:28,368 INFO L263 TraceCheckUtils]: 27: Hoare triple {83#false} call #t~ret10 := isfinite_double(~x~0); {106#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:13:28,369 INFO L280 TraceCheckUtils]: 28: Hoare triple {106#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {82#true} is VALID [2020-07-18 00:13:28,373 INFO L280 TraceCheckUtils]: 29: Hoare triple {82#true} havoc ~hx~1; {82#true} is VALID [2020-07-18 00:13:28,375 INFO L280 TraceCheckUtils]: 30: Hoare triple {82#true} assume !true; {83#false} is VALID [2020-07-18 00:13:28,375 INFO L280 TraceCheckUtils]: 31: Hoare triple {83#false} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {83#false} is VALID [2020-07-18 00:13:28,376 INFO L280 TraceCheckUtils]: 32: Hoare triple {83#false} assume true; {83#false} is VALID [2020-07-18 00:13:28,376 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {83#false} {83#false} #111#return; {83#false} is VALID [2020-07-18 00:13:28,377 INFO L280 TraceCheckUtils]: 34: Hoare triple {83#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; {83#false} is VALID [2020-07-18 00:13:28,377 INFO L280 TraceCheckUtils]: 35: Hoare triple {83#false} ~res~0 := ~convertINTToDOUBLE(#t~ret10); {83#false} is VALID [2020-07-18 00:13:28,378 INFO L280 TraceCheckUtils]: 36: Hoare triple {83#false} havoc #t~ret10; {83#false} is VALID [2020-07-18 00:13:28,378 INFO L280 TraceCheckUtils]: 37: Hoare triple {83#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {83#false} is VALID [2020-07-18 00:13:28,379 INFO L280 TraceCheckUtils]: 38: Hoare triple {83#false} assume !false; {83#false} is VALID [2020-07-18 00:13:28,391 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:13:28,394 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:13:28,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1431154720] [2020-07-18 00:13:28,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:13:28,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:13:28,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567826377] [2020-07-18 00:13:28,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-07-18 00:13:28,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:13:28,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:13:28,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:13:28,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:13:28,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:13:28,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:13:28,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:13:28,508 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2020-07-18 00:13:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:29,094 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2020-07-18 00:13:29,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:13:29,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-07-18 00:13:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:13:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:13:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2020-07-18 00:13:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:13:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2020-07-18 00:13:29,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 157 transitions. [2020-07-18 00:13:29,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:13:29,393 INFO L225 Difference]: With dead ends: 144 [2020-07-18 00:13:29,393 INFO L226 Difference]: Without dead ends: 70 [2020-07-18 00:13:29,401 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-18 00:13:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-18 00:13:29,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-18 00:13:29,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:13:29,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-18 00:13:29,540 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-18 00:13:29,540 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-18 00:13:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:29,550 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2020-07-18 00:13:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2020-07-18 00:13:29,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:29,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:29,553 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-18 00:13:29,553 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-18 00:13:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:13:29,569 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2020-07-18 00:13:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2020-07-18 00:13:29,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:13:29,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:13:29,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:13:29,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:13:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-18 00:13:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2020-07-18 00:13:29,585 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 39 [2020-07-18 00:13:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:13:29,586 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2020-07-18 00:13:29,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:13:29,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 70 transitions. [2020-07-18 00:13:29,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:13:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2020-07-18 00:13:29,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-18 00:13:29,687 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:13:29,688 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] [2020-07-18 00:13:29,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:13:29,688 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:13:29,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:13:29,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1526802571, now seen corresponding path program 1 times [2020-07-18 00:13:29,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:13:29,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [152795767] [2020-07-18 00:13:29,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:13:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:29,906 INFO L280 TraceCheckUtils]: 0: Hoare triple {727#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {680#true} is VALID [2020-07-18 00:13:29,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {680#true} #valid := #valid[0 := 0]; {680#true} is VALID [2020-07-18 00:13:29,907 INFO L280 TraceCheckUtils]: 2: Hoare triple {680#true} assume 0 < #StackHeapBarrier; {680#true} is VALID [2020-07-18 00:13:29,907 INFO L280 TraceCheckUtils]: 3: Hoare triple {680#true} assume true; {680#true} is VALID [2020-07-18 00:13:29,908 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {680#true} {680#true} #113#return; {680#true} is VALID [2020-07-18 00:13:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:29,948 INFO L280 TraceCheckUtils]: 0: Hoare triple {728#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {680#true} is VALID [2020-07-18 00:13:29,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {680#true} havoc ~hx~0; {680#true} is VALID [2020-07-18 00:13:29,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {680#true} havoc ~lx~0; {680#true} is VALID [2020-07-18 00:13:29,949 INFO L280 TraceCheckUtils]: 3: Hoare triple {680#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L18-2 {680#true} is VALID [2020-07-18 00:13:29,950 INFO L280 TraceCheckUtils]: 4: Hoare triple {680#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L19 {680#true} is VALID [2020-07-18 00:13:29,950 INFO L280 TraceCheckUtils]: 5: Hoare triple {680#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L20 {680#true} is VALID [2020-07-18 00:13:29,950 INFO L280 TraceCheckUtils]: 6: Hoare triple {680#true} ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-18 00:13:29,951 INFO L280 TraceCheckUtils]: 7: Hoare triple {680#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21-1 {680#true} is VALID [2020-07-18 00:13:29,951 INFO L280 TraceCheckUtils]: 8: Hoare triple {680#true} havoc #t~mem0; {680#true} is VALID [2020-07-18 00:13:29,951 INFO L280 TraceCheckUtils]: 9: Hoare triple {680#true} havoc #t~union1; {680#true} is VALID [2020-07-18 00:13:29,952 INFO L280 TraceCheckUtils]: 10: Hoare triple {680#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L22 {680#true} is VALID [2020-07-18 00:13:29,952 INFO L280 TraceCheckUtils]: 11: Hoare triple {680#true} ~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-18 00:13:29,952 INFO L280 TraceCheckUtils]: 12: Hoare triple {680#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L22-2 {680#true} is VALID [2020-07-18 00:13:29,953 INFO L280 TraceCheckUtils]: 13: Hoare triple {680#true} havoc #t~mem2; {680#true} is VALID [2020-07-18 00:13:29,953 INFO L280 TraceCheckUtils]: 14: Hoare triple {680#true} havoc #t~union3; {680#true} is VALID [2020-07-18 00:13:29,953 INFO L280 TraceCheckUtils]: 15: Hoare triple {680#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L19-1 {680#true} is VALID [2020-07-18 00:13:29,954 INFO L280 TraceCheckUtils]: 16: Hoare triple {680#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {680#true} is VALID [2020-07-18 00:13:29,954 INFO L280 TraceCheckUtils]: 17: Hoare triple {680#true} goto; {680#true} is VALID [2020-07-18 00:13:29,954 INFO L280 TraceCheckUtils]: 18: Hoare triple {680#true} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {680#true} is VALID [2020-07-18 00:13:29,955 INFO L280 TraceCheckUtils]: 19: Hoare triple {680#true} ~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); {680#true} is VALID [2020-07-18 00:13:29,955 INFO L280 TraceCheckUtils]: 20: Hoare triple {680#true} ~hx~0 := 2146435072 - ~hx~0; {680#true} is VALID [2020-07-18 00:13:29,955 INFO L280 TraceCheckUtils]: 21: Hoare triple {680#true} #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); {680#true} is VALID [2020-07-18 00:13:29,955 INFO L280 TraceCheckUtils]: 22: Hoare triple {680#true} assume true; {680#true} is VALID [2020-07-18 00:13:29,956 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {680#true} {680#true} #107#return; {680#true} is VALID [2020-07-18 00:13:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:13:29,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {728#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {680#true} is VALID [2020-07-18 00:13:29,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {680#true} havoc ~hx~1; {680#true} is VALID [2020-07-18 00:13:29,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {680#true} SUMMARY for call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L35-2 {680#true} is VALID [2020-07-18 00:13:29,986 INFO L280 TraceCheckUtils]: 3: Hoare triple {680#true} SUMMARY for call write~real(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8); srcloc: L36 {680#true} is VALID [2020-07-18 00:13:29,986 INFO L280 TraceCheckUtils]: 4: Hoare triple {680#true} SUMMARY for call #t~mem4 := read~int(~#gh_u~0.base, 4 + ~#gh_u~0.offset, 4); srcloc: L37 {680#true} is VALID [2020-07-18 00:13:29,987 INFO L280 TraceCheckUtils]: 5: Hoare triple {680#true} ~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-18 00:13:29,987 INFO L280 TraceCheckUtils]: 6: Hoare triple {680#true} SUMMARY for call write~real(#t~union5, ~#gh_u~0.base, ~#gh_u~0.offset, 8); srcloc: L38-1 {680#true} is VALID [2020-07-18 00:13:29,987 INFO L280 TraceCheckUtils]: 7: Hoare triple {680#true} havoc #t~mem4; {680#true} is VALID [2020-07-18 00:13:29,987 INFO L280 TraceCheckUtils]: 8: Hoare triple {680#true} havoc #t~union5; {680#true} is VALID [2020-07-18 00:13:29,988 INFO L280 TraceCheckUtils]: 9: Hoare triple {680#true} SUMMARY for call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); srcloc: L36-1 {680#true} is VALID [2020-07-18 00:13:29,988 INFO L280 TraceCheckUtils]: 10: Hoare triple {680#true} havoc ~#gh_u~0.base, ~#gh_u~0.offset; {680#true} is VALID [2020-07-18 00:13:29,988 INFO L280 TraceCheckUtils]: 11: Hoare triple {680#true} goto; {680#true} is VALID [2020-07-18 00:13:29,989 INFO L280 TraceCheckUtils]: 12: Hoare triple {680#true} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-18 00:13:29,989 INFO L280 TraceCheckUtils]: 13: Hoare triple {680#true} assume true; {680#true} is VALID [2020-07-18 00:13:29,989 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {680#true} {681#false} #111#return; {681#false} is VALID [2020-07-18 00:13:29,991 INFO L263 TraceCheckUtils]: 0: Hoare triple {680#true} call ULTIMATE.init(); {727#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:13:29,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {727#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {680#true} is VALID [2020-07-18 00:13:29,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {680#true} #valid := #valid[0 := 0]; {680#true} is VALID [2020-07-18 00:13:29,992 INFO L280 TraceCheckUtils]: 3: Hoare triple {680#true} assume 0 < #StackHeapBarrier; {680#true} is VALID [2020-07-18 00:13:29,992 INFO L280 TraceCheckUtils]: 4: Hoare triple {680#true} assume true; {680#true} is VALID [2020-07-18 00:13:29,993 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {680#true} {680#true} #113#return; {680#true} is VALID [2020-07-18 00:13:29,993 INFO L263 TraceCheckUtils]: 6: Hoare triple {680#true} call #t~ret11 := main(); {680#true} is VALID [2020-07-18 00:13:29,993 INFO L280 TraceCheckUtils]: 7: Hoare triple {680#true} ~x~0 := #t~nondet6; {680#true} is VALID [2020-07-18 00:13:29,994 INFO L280 TraceCheckUtils]: 8: Hoare triple {680#true} havoc #t~nondet6; {680#true} is VALID [2020-07-18 00:13:29,995 INFO L263 TraceCheckUtils]: 9: Hoare triple {680#true} call #t~ret7 := isinf_double(~x~0); {728#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:13:29,996 INFO L280 TraceCheckUtils]: 10: Hoare triple {728#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {680#true} is VALID [2020-07-18 00:13:29,996 INFO L280 TraceCheckUtils]: 11: Hoare triple {680#true} havoc ~hx~0; {680#true} is VALID [2020-07-18 00:13:29,996 INFO L280 TraceCheckUtils]: 12: Hoare triple {680#true} havoc ~lx~0; {680#true} is VALID [2020-07-18 00:13:29,996 INFO L280 TraceCheckUtils]: 13: Hoare triple {680#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L18-2 {680#true} is VALID [2020-07-18 00:13:29,997 INFO L280 TraceCheckUtils]: 14: Hoare triple {680#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L19 {680#true} is VALID [2020-07-18 00:13:29,997 INFO L280 TraceCheckUtils]: 15: Hoare triple {680#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L20 {680#true} is VALID [2020-07-18 00:13:29,997 INFO L280 TraceCheckUtils]: 16: Hoare triple {680#true} ~hx~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-18 00:13:29,998 INFO L280 TraceCheckUtils]: 17: Hoare triple {680#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L21-1 {680#true} is VALID [2020-07-18 00:13:29,998 INFO L280 TraceCheckUtils]: 18: Hoare triple {680#true} havoc #t~mem0; {680#true} is VALID [2020-07-18 00:13:29,998 INFO L280 TraceCheckUtils]: 19: Hoare triple {680#true} havoc #t~union1; {680#true} is VALID [2020-07-18 00:13:29,998 INFO L280 TraceCheckUtils]: 20: Hoare triple {680#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L22 {680#true} is VALID [2020-07-18 00:13:29,999 INFO L280 TraceCheckUtils]: 21: Hoare triple {680#true} ~lx~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-18 00:13:29,999 INFO L280 TraceCheckUtils]: 22: Hoare triple {680#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L22-2 {680#true} is VALID [2020-07-18 00:13:29,999 INFO L280 TraceCheckUtils]: 23: Hoare triple {680#true} havoc #t~mem2; {680#true} is VALID [2020-07-18 00:13:30,000 INFO L280 TraceCheckUtils]: 24: Hoare triple {680#true} havoc #t~union3; {680#true} is VALID [2020-07-18 00:13:30,000 INFO L280 TraceCheckUtils]: 25: Hoare triple {680#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L19-1 {680#true} is VALID [2020-07-18 00:13:30,000 INFO L280 TraceCheckUtils]: 26: Hoare triple {680#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {680#true} is VALID [2020-07-18 00:13:30,001 INFO L280 TraceCheckUtils]: 27: Hoare triple {680#true} goto; {680#true} is VALID [2020-07-18 00:13:30,001 INFO L280 TraceCheckUtils]: 28: Hoare triple {680#true} ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); {680#true} is VALID [2020-07-18 00:13:30,001 INFO L280 TraceCheckUtils]: 29: Hoare triple {680#true} ~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); {680#true} is VALID [2020-07-18 00:13:30,002 INFO L280 TraceCheckUtils]: 30: Hoare triple {680#true} ~hx~0 := 2146435072 - ~hx~0; {680#true} is VALID [2020-07-18 00:13:30,002 INFO L280 TraceCheckUtils]: 31: Hoare triple {680#true} #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); {680#true} is VALID [2020-07-18 00:13:30,002 INFO L280 TraceCheckUtils]: 32: Hoare triple {680#true} assume true; {680#true} is VALID [2020-07-18 00:13:30,002 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {680#true} {680#true} #107#return; {680#true} is VALID [2020-07-18 00:13:30,003 INFO L280 TraceCheckUtils]: 34: Hoare triple {680#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; {680#true} is VALID [2020-07-18 00:13:30,003 INFO L280 TraceCheckUtils]: 35: Hoare triple {680#true} #t~short9 := 0 == #t~ret7; {680#true} is VALID [2020-07-18 00:13:30,005 INFO L280 TraceCheckUtils]: 36: Hoare triple {680#true} assume !#t~short9; {711#(not |main_#t~short9|)} is VALID [2020-07-18 00:13:30,008 INFO L280 TraceCheckUtils]: 37: Hoare triple {711#(not |main_#t~short9|)} assume #t~short9; {681#false} is VALID [2020-07-18 00:13:30,008 INFO L280 TraceCheckUtils]: 38: Hoare triple {681#false} havoc #t~short9; {681#false} is VALID [2020-07-18 00:13:30,008 INFO L280 TraceCheckUtils]: 39: Hoare triple {681#false} havoc #t~ret7; {681#false} is VALID [2020-07-18 00:13:30,009 INFO L280 TraceCheckUtils]: 40: Hoare triple {681#false} havoc #t~ret8; {681#false} is VALID [2020-07-18 00:13:30,009 INFO L263 TraceCheckUtils]: 41: Hoare triple {681#false} call #t~ret10 := isfinite_double(~x~0); {728#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-18 00:13:30,009 INFO L280 TraceCheckUtils]: 42: Hoare triple {728#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {680#true} is VALID [2020-07-18 00:13:30,010 INFO L280 TraceCheckUtils]: 43: Hoare triple {680#true} havoc ~hx~1; {680#true} is VALID [2020-07-18 00:13:30,010 INFO L280 TraceCheckUtils]: 44: Hoare triple {680#true} SUMMARY for call ~#gh_u~0.base, ~#gh_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L35-2 {680#true} is VALID [2020-07-18 00:13:30,010 INFO L280 TraceCheckUtils]: 45: Hoare triple {680#true} SUMMARY for call write~real(~x, ~#gh_u~0.base, ~#gh_u~0.offset, 8); srcloc: L36 {680#true} is VALID [2020-07-18 00:13:30,011 INFO L280 TraceCheckUtils]: 46: Hoare triple {680#true} SUMMARY for call #t~mem4 := read~int(~#gh_u~0.base, 4 + ~#gh_u~0.offset, 4); srcloc: L37 {680#true} is VALID [2020-07-18 00:13:30,011 INFO L280 TraceCheckUtils]: 47: Hoare triple {680#true} ~hx~1 := (if #t~mem4 % 4294967296 % 4294967296 <= 2147483647 then #t~mem4 % 4294967296 % 4294967296 else #t~mem4 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-18 00:13:30,011 INFO L280 TraceCheckUtils]: 48: Hoare triple {680#true} SUMMARY for call write~real(#t~union5, ~#gh_u~0.base, ~#gh_u~0.offset, 8); srcloc: L38-1 {680#true} is VALID [2020-07-18 00:13:30,012 INFO L280 TraceCheckUtils]: 49: Hoare triple {680#true} havoc #t~mem4; {680#true} is VALID [2020-07-18 00:13:30,012 INFO L280 TraceCheckUtils]: 50: Hoare triple {680#true} havoc #t~union5; {680#true} is VALID [2020-07-18 00:13:30,012 INFO L280 TraceCheckUtils]: 51: Hoare triple {680#true} SUMMARY for call ULTIMATE.dealloc(~#gh_u~0.base, ~#gh_u~0.offset); srcloc: L36-1 {680#true} is VALID [2020-07-18 00:13:30,012 INFO L280 TraceCheckUtils]: 52: Hoare triple {680#true} havoc ~#gh_u~0.base, ~#gh_u~0.offset; {680#true} is VALID [2020-07-18 00:13:30,013 INFO L280 TraceCheckUtils]: 53: Hoare triple {680#true} goto; {680#true} is VALID [2020-07-18 00:13:30,013 INFO L280 TraceCheckUtils]: 54: Hoare triple {680#true} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {680#true} is VALID [2020-07-18 00:13:30,013 INFO L280 TraceCheckUtils]: 55: Hoare triple {680#true} assume true; {680#true} is VALID [2020-07-18 00:13:30,014 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {680#true} {681#false} #111#return; {681#false} is VALID [2020-07-18 00:13:30,014 INFO L280 TraceCheckUtils]: 57: Hoare triple {681#false} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; {681#false} is VALID [2020-07-18 00:13:30,014 INFO L280 TraceCheckUtils]: 58: Hoare triple {681#false} ~res~0 := ~convertINTToDOUBLE(#t~ret10); {681#false} is VALID [2020-07-18 00:13:30,015 INFO L280 TraceCheckUtils]: 59: Hoare triple {681#false} havoc #t~ret10; {681#false} is VALID [2020-07-18 00:13:30,015 INFO L280 TraceCheckUtils]: 60: Hoare triple {681#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {681#false} is VALID [2020-07-18 00:13:30,015 INFO L280 TraceCheckUtils]: 61: Hoare triple {681#false} assume !false; {681#false} is VALID [2020-07-18 00:13:30,020 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:13:30,063 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:13:30,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [152795767] [2020-07-18 00:13:30,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:13:30,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:13:30,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145279030] [2020-07-18 00:13:30,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2020-07-18 00:13:30,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:13:30,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:13:30,101 WARN L140 InductivityCheck]: Transition 680#true ( _ , assume !false; , 681#false ) not inductive [2020-07-18 00:13:30,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:13:30,102 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) 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:13:30,108 INFO L168 Benchmark]: Toolchain (without parser) took 3259.72 ms. Allocated memory was 145.2 MB in the beginning and 248.0 MB in the end (delta: 102.8 MB). Free memory was 102.8 MB in the beginning and 181.1 MB in the end (delta: -78.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:30,109 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 00:13:30,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.14 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 102.6 MB in the beginning and 180.9 MB in the end (delta: -78.3 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:30,111 INFO L168 Benchmark]: Boogie Preprocessor took 47.09 ms. Allocated memory is still 202.9 MB. Free memory was 180.9 MB in the beginning and 178.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:30,111 INFO L168 Benchmark]: RCFGBuilder took 591.84 ms. Allocated memory is still 202.9 MB. Free memory was 178.5 MB in the beginning and 145.0 MB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:30,112 INFO L168 Benchmark]: TraceAbstraction took 2218.85 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 145.0 MB in the beginning and 181.1 MB in the end (delta: -36.1 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:13:30,116 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.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 393.14 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 102.6 MB in the beginning and 180.9 MB in the end (delta: -78.3 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.09 ms. Allocated memory is still 202.9 MB. Free memory was 180.9 MB in the beginning and 178.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 591.84 ms. Allocated memory is still 202.9 MB. Free memory was 178.5 MB in the beginning and 145.0 MB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2218.85 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 145.0 MB in the beginning and 181.1 MB in the end (delta: -36.1 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...