/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1252b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:04:52,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:04:52,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:04:52,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:04:52,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:04:52,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:04:52,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:04:52,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:04:52,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:04:52,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:04:52,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:04:52,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:04:52,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:04:52,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:04:52,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:04:52,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:04:52,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:04:52,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:04:52,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:04:52,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:04:52,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:04:52,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:04:52,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:04:52,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:04:52,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:04:52,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:04:52,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:04:52,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:04:52,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:04:52,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:04:52,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:04:52,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:04:52,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:04:52,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:04:52,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:04:52,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:04:52,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:04:52,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:04:52,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:04:52,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:04:52,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:04:52,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:04:52,693 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:04:52,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:04:52,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:04:52,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:04:52,694 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:04:52,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:04:52,695 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:04:52,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:04:52,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:04:52,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:04:52,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:04:52,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:04:52,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:04:52,696 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:04:52,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:04:52,696 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:04:52,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:04:52,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:04:52,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:04:52,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:04:52,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:04:52,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:04:52,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:04:52,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:04:52,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:04:52,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:04:52,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:04:52,699 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:04:52,699 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:04:52,699 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:04:52,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:04:52,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:04:52,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:04:52,985 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:04:52,986 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:04:52,986 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1252b.c [2020-07-17 22:04:53,056 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e4b026df/16fa234eaa614241bebcc605c0fbec5b/FLAG217140d25 [2020-07-17 22:04:53,552 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:04:53,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1252b.c [2020-07-17 22:04:53,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e4b026df/16fa234eaa614241bebcc605c0fbec5b/FLAG217140d25 [2020-07-17 22:04:53,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e4b026df/16fa234eaa614241bebcc605c0fbec5b [2020-07-17 22:04:53,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:04:53,898 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:04:53,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:04:53,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:04:53,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:04:53,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:04:53" (1/1) ... [2020-07-17 22:04:53,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487e0097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:53, skipping insertion in model container [2020-07-17 22:04:53,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:04:53" (1/1) ... [2020-07-17 22:04:53,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:04:53,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:04:54,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:04:54,123 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:04:54,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:04:54,267 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:04:54,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:54 WrapperNode [2020-07-17 22:04:54,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:04:54,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:04:54,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:04:54,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:04:54,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:54" (1/1) ... [2020-07-17 22:04:54,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:54" (1/1) ... [2020-07-17 22:04:54,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:54" (1/1) ... [2020-07-17 22:04:54,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:54" (1/1) ... [2020-07-17 22:04:54,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:54" (1/1) ... [2020-07-17 22:04:54,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:54" (1/1) ... [2020-07-17 22:04:54,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:54" (1/1) ... [2020-07-17 22:04:54,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:04:54,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:04:54,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:04:54,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:04:54,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:54" (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-17 22:04:54,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:04:54,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:04:54,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2020-07-17 22:04:54,375 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2020-07-17 22:04:54,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2020-07-17 22:04:54,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:04:54,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:04:54,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-17 22:04:54,375 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2020-07-17 22:04:54,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:04:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-17 22:04:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:04:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:04:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2020-07-17 22:04:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2020-07-17 22:04:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:04:54,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:04:54,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:04:54,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:04:54,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-17 22:04:54,884 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:04:54,884 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-17 22:04:54,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:04:54 BoogieIcfgContainer [2020-07-17 22:04:54,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:04:54,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:04:54,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:04:54,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:04:54,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:04:53" (1/3) ... [2020-07-17 22:04:54,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5a56b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:04:54, skipping insertion in model container [2020-07-17 22:04:54,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:04:54" (2/3) ... [2020-07-17 22:04:54,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5a56b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:04:54, skipping insertion in model container [2020-07-17 22:04:54,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:04:54" (3/3) ... [2020-07-17 22:04:54,897 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252b.c [2020-07-17 22:04:54,907 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:04:54,915 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:04:54,927 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:04:54,949 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:04:54,949 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:04:54,949 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:04:54,949 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:04:54,949 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:04:54,950 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:04:54,950 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:04:54,950 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:04:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-17 22:04:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:04:54,972 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:04:54,973 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] [2020-07-17 22:04:54,973 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:04:54,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:04:54,978 INFO L82 PathProgramCache]: Analyzing trace with hash -592398611, now seen corresponding path program 1 times [2020-07-17 22:04:54,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:04:54,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944338808] [2020-07-17 22:04:54,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:04:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:55,185 INFO L280 TraceCheckUtils]: 0: Hoare triple {63#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {47#true} is VALID [2020-07-17 22:04:55,186 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-17 22:04:55,187 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #98#return; {47#true} is VALID [2020-07-17 22:04:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:55,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {47#true} is VALID [2020-07-17 22:04:55,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-17 22:04:55,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {48#false} is VALID [2020-07-17 22:04:55,278 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-17 22:04:55,279 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-17 22:04:55,279 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {47#true} is VALID [2020-07-17 22:04:55,281 INFO L263 TraceCheckUtils]: 1: Hoare triple {47#true} call #t~ret4 := __fpclassify_double(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:04:55,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {47#true} is VALID [2020-07-17 22:04:55,283 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-17 22:04:55,283 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {48#false} is VALID [2020-07-17 22:04:55,284 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-17 22:04:55,284 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-17 22:04:55,284 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {48#false} is VALID [2020-07-17 22:04:55,285 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {48#false} is VALID [2020-07-17 22:04:55,286 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-17 22:04:55,286 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#false} {47#true} #90#return; {48#false} is VALID [2020-07-17 22:04:55,288 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {63#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:04:55,289 INFO L280 TraceCheckUtils]: 1: Hoare triple {63#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {47#true} is VALID [2020-07-17 22:04:55,289 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-17 22:04:55,289 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #98#return; {47#true} is VALID [2020-07-17 22:04:55,290 INFO L263 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret12 := main(); {47#true} is VALID [2020-07-17 22:04:55,290 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~x~0 := 0.0;~y~0 := ~someUnaryDOUBLEoperation(0.0); {47#true} is VALID [2020-07-17 22:04:55,293 INFO L263 TraceCheckUtils]: 6: Hoare triple {47#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:04:55,294 INFO L280 TraceCheckUtils]: 7: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {47#true} is VALID [2020-07-17 22:04:55,295 INFO L263 TraceCheckUtils]: 8: Hoare triple {47#true} call #t~ret4 := __fpclassify_double(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:04:55,296 INFO L280 TraceCheckUtils]: 9: Hoare triple {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {47#true} is VALID [2020-07-17 22:04:55,298 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-17 22:04:55,298 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {48#false} is VALID [2020-07-17 22:04:55,298 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-17 22:04:55,299 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-17 22:04:55,299 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {48#false} is VALID [2020-07-17 22:04:55,300 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#false} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {48#false} is VALID [2020-07-17 22:04:55,300 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-17 22:04:55,302 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {48#false} {47#true} #90#return; {48#false} is VALID [2020-07-17 22:04:55,302 INFO L280 TraceCheckUtils]: 18: Hoare triple {48#false} ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {48#false} is VALID [2020-07-17 22:04:55,302 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#false} assume !#t~short11; {48#false} is VALID [2020-07-17 22:04:55,303 INFO L280 TraceCheckUtils]: 20: Hoare triple {48#false} assume !#t~short11;havoc #t~short11;havoc #t~ret10; {48#false} is VALID [2020-07-17 22:04:55,303 INFO L280 TraceCheckUtils]: 21: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-17 22:04:55,306 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-17 22:04:55,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944338808] [2020-07-17 22:04:55,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:04:55,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:04:55,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82222685] [2020-07-17 22:04:55,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:04:55,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:04:55,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:04:55,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:04:55,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:04:55,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:04:55,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:04:55,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:04:55,377 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-07-17 22:04:55,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:55,824 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2020-07-17 22:04:55,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:04:55,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:04:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:04:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:04:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-17 22:04:55,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:04:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-17 22:04:55,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2020-07-17 22:04:56,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:04:56,027 INFO L225 Difference]: With dead ends: 79 [2020-07-17 22:04:56,027 INFO L226 Difference]: Without dead ends: 40 [2020-07-17 22:04:56,031 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-17 22:04:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-17 22:04:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-17 22:04:56,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:04:56,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-17 22:04:56,094 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-17 22:04:56,094 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-17 22:04:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:56,100 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-17 22:04:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-17 22:04:56,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:04:56,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:04:56,102 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-17 22:04:56,102 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-17 22:04:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:56,107 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-17 22:04:56,107 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-17 22:04:56,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:04:56,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:04:56,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:04:56,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:04:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 22:04:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-17 22:04:56,114 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2020-07-17 22:04:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:04:56,114 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-17 22:04:56,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:04:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-17 22:04:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:04:56,116 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:04:56,116 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] [2020-07-17 22:04:56,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:04:56,116 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:04:56,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:04:56,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1646954013, now seen corresponding path program 1 times [2020-07-17 22:04:56,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:04:56,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198204468] [2020-07-17 22:04:56,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:04:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:56,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {306#true} is VALID [2020-07-17 22:04:56,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-17 22:04:56,222 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {306#true} {306#true} #98#return; {306#true} is VALID [2020-07-17 22:04:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:56,324 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {306#true} is VALID [2020-07-17 22:04:56,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {306#true} is VALID [2020-07-17 22:04:56,325 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-17 22:04:56,326 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-17 22:04:56,326 INFO L280 TraceCheckUtils]: 4: Hoare triple {332#(<= 2 |__fpclassify_double_#res|)} assume true; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-17 22:04:56,327 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {332#(<= 2 |__fpclassify_double_#res|)} {306#true} #94#return; {331#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-17 22:04:56,328 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {306#true} is VALID [2020-07-17 22:04:56,329 INFO L263 TraceCheckUtils]: 1: Hoare triple {306#true} call #t~ret4 := __fpclassify_double(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:04:56,330 INFO L280 TraceCheckUtils]: 2: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {306#true} is VALID [2020-07-17 22:04:56,330 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {306#true} is VALID [2020-07-17 22:04:56,331 INFO L280 TraceCheckUtils]: 4: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-17 22:04:56,332 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-17 22:04:56,332 INFO L280 TraceCheckUtils]: 6: Hoare triple {332#(<= 2 |__fpclassify_double_#res|)} assume true; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-17 22:04:56,334 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {332#(<= 2 |__fpclassify_double_#res|)} {306#true} #94#return; {331#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-17 22:04:56,334 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {331#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-17 22:04:56,335 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {307#false} is VALID [2020-07-17 22:04:56,336 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-17 22:04:56,336 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {307#false} {306#true} #90#return; {307#false} is VALID [2020-07-17 22:04:56,338 INFO L263 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:04:56,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {306#true} is VALID [2020-07-17 22:04:56,338 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-17 22:04:56,339 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #98#return; {306#true} is VALID [2020-07-17 22:04:56,339 INFO L263 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret12 := main(); {306#true} is VALID [2020-07-17 22:04:56,339 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} ~x~0 := 0.0;~y~0 := ~someUnaryDOUBLEoperation(0.0); {306#true} is VALID [2020-07-17 22:04:56,341 INFO L263 TraceCheckUtils]: 6: Hoare triple {306#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:04:56,341 INFO L280 TraceCheckUtils]: 7: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {306#true} is VALID [2020-07-17 22:04:56,343 INFO L263 TraceCheckUtils]: 8: Hoare triple {306#true} call #t~ret4 := __fpclassify_double(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:04:56,343 INFO L280 TraceCheckUtils]: 9: Hoare triple {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {306#true} is VALID [2020-07-17 22:04:56,343 INFO L280 TraceCheckUtils]: 10: Hoare triple {306#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {306#true} is VALID [2020-07-17 22:04:56,344 INFO L280 TraceCheckUtils]: 11: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-17 22:04:56,345 INFO L280 TraceCheckUtils]: 12: Hoare triple {306#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-17 22:04:56,345 INFO L280 TraceCheckUtils]: 13: Hoare triple {332#(<= 2 |__fpclassify_double_#res|)} assume true; {332#(<= 2 |__fpclassify_double_#res|)} is VALID [2020-07-17 22:04:56,347 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {332#(<= 2 |__fpclassify_double_#res|)} {306#true} #94#return; {331#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-17 22:04:56,348 INFO L280 TraceCheckUtils]: 15: Hoare triple {331#(<= 2 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {331#(<= 2 |fmax_double_#t~ret4|)} is VALID [2020-07-17 22:04:56,348 INFO L280 TraceCheckUtils]: 16: Hoare triple {331#(<= 2 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {307#false} is VALID [2020-07-17 22:04:56,349 INFO L280 TraceCheckUtils]: 17: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-17 22:04:56,349 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {307#false} {306#true} #90#return; {307#false} is VALID [2020-07-17 22:04:56,349 INFO L280 TraceCheckUtils]: 19: Hoare triple {307#false} ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {307#false} is VALID [2020-07-17 22:04:56,350 INFO L280 TraceCheckUtils]: 20: Hoare triple {307#false} assume !#t~short11; {307#false} is VALID [2020-07-17 22:04:56,350 INFO L280 TraceCheckUtils]: 21: Hoare triple {307#false} assume !#t~short11;havoc #t~short11;havoc #t~ret10; {307#false} is VALID [2020-07-17 22:04:56,350 INFO L280 TraceCheckUtils]: 22: Hoare triple {307#false} assume !false; {307#false} is VALID [2020-07-17 22:04:56,352 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-17 22:04:56,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198204468] [2020-07-17 22:04:56,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:04:56,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:04:56,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412865021] [2020-07-17 22:04:56,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-17 22:04:56,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:04:56,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:04:56,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:04:56,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:04:56,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:04:56,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:04:56,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:04:56,392 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-17 22:04:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:57,003 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2020-07-17 22:04:57,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:04:57,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-17 22:04:57,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:04:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:04:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-17 22:04:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:04:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-17 22:04:57,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-17 22:04:57,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:04:57,125 INFO L225 Difference]: With dead ends: 59 [2020-07-17 22:04:57,125 INFO L226 Difference]: Without dead ends: 44 [2020-07-17 22:04:57,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:04:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-17 22:04:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-17 22:04:57,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:04:57,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-17 22:04:57,154 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-17 22:04:57,154 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-17 22:04:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:57,158 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:04:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:04:57,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:04:57,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:04:57,159 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-17 22:04:57,160 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-17 22:04:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:57,163 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 22:04:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:04:57,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:04:57,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:04:57,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:04:57,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:04:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 22:04:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-17 22:04:57,168 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2020-07-17 22:04:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:04:57,168 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-17 22:04:57,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:04:57,168 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:04:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:04:57,170 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:04:57,170 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] [2020-07-17 22:04:57,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:04:57,171 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:04:57,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:04:57,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1003466516, now seen corresponding path program 1 times [2020-07-17 22:04:57,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:04:57,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159171425] [2020-07-17 22:04:57,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:04:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:57,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {582#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {562#true} is VALID [2020-07-17 22:04:57,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-17 22:04:57,272 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {562#true} {562#true} #98#return; {562#true} is VALID [2020-07-17 22:04:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:04:57,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {562#true} is VALID [2020-07-17 22:04:57,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {562#true} is VALID [2020-07-17 22:04:57,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-17 22:04:57,376 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {562#true} is VALID [2020-07-17 22:04:57,376 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {562#true} is VALID [2020-07-17 22:04:57,377 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {562#true} is VALID [2020-07-17 22:04:57,377 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-17 22:04:57,378 INFO L280 TraceCheckUtils]: 7: Hoare triple {594#(<= 1 |__fpclassify_double_#res|)} assume true; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-17 22:04:57,379 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {594#(<= 1 |__fpclassify_double_#res|)} {562#true} #94#return; {593#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-17 22:04:57,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {562#true} is VALID [2020-07-17 22:04:57,395 INFO L263 TraceCheckUtils]: 1: Hoare triple {562#true} call #t~ret4 := __fpclassify_double(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:04:57,396 INFO L280 TraceCheckUtils]: 2: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {562#true} is VALID [2020-07-17 22:04:57,396 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {562#true} is VALID [2020-07-17 22:04:57,396 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-17 22:04:57,397 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {562#true} is VALID [2020-07-17 22:04:57,397 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {562#true} is VALID [2020-07-17 22:04:57,397 INFO L280 TraceCheckUtils]: 7: Hoare triple {562#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {562#true} is VALID [2020-07-17 22:04:57,398 INFO L280 TraceCheckUtils]: 8: Hoare triple {562#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-17 22:04:57,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {594#(<= 1 |__fpclassify_double_#res|)} assume true; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-17 22:04:57,401 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {594#(<= 1 |__fpclassify_double_#res|)} {562#true} #94#return; {593#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-17 22:04:57,402 INFO L280 TraceCheckUtils]: 11: Hoare triple {593#(<= 1 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {593#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-17 22:04:57,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {593#(<= 1 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {563#false} is VALID [2020-07-17 22:04:57,405 INFO L280 TraceCheckUtils]: 13: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-17 22:04:57,405 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {563#false} {562#true} #90#return; {563#false} is VALID [2020-07-17 22:04:57,406 INFO L263 TraceCheckUtils]: 0: Hoare triple {562#true} call ULTIMATE.init(); {582#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:04:57,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {582#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {562#true} is VALID [2020-07-17 22:04:57,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-17 22:04:57,407 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {562#true} {562#true} #98#return; {562#true} is VALID [2020-07-17 22:04:57,407 INFO L263 TraceCheckUtils]: 4: Hoare triple {562#true} call #t~ret12 := main(); {562#true} is VALID [2020-07-17 22:04:57,408 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} ~x~0 := 0.0;~y~0 := ~someUnaryDOUBLEoperation(0.0); {562#true} is VALID [2020-07-17 22:04:57,409 INFO L263 TraceCheckUtils]: 6: Hoare triple {562#true} call #t~ret9 := fmax_double(~x~0, ~y~0); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:04:57,410 INFO L280 TraceCheckUtils]: 7: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~y := #in~y; {562#true} is VALID [2020-07-17 22:04:57,411 INFO L263 TraceCheckUtils]: 8: Hoare triple {562#true} call #t~ret4 := __fpclassify_double(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:04:57,411 INFO L280 TraceCheckUtils]: 9: Hoare triple {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {562#true} is VALID [2020-07-17 22:04:57,411 INFO L280 TraceCheckUtils]: 10: Hoare triple {562#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {562#true} is VALID [2020-07-17 22:04:57,412 INFO L280 TraceCheckUtils]: 11: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-17 22:04:57,412 INFO L280 TraceCheckUtils]: 12: Hoare triple {562#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {562#true} is VALID [2020-07-17 22:04:57,412 INFO L280 TraceCheckUtils]: 13: Hoare triple {562#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {562#true} is VALID [2020-07-17 22:04:57,412 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {562#true} is VALID [2020-07-17 22:04:57,413 INFO L280 TraceCheckUtils]: 15: Hoare triple {562#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-17 22:04:57,414 INFO L280 TraceCheckUtils]: 16: Hoare triple {594#(<= 1 |__fpclassify_double_#res|)} assume true; {594#(<= 1 |__fpclassify_double_#res|)} is VALID [2020-07-17 22:04:57,415 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {594#(<= 1 |__fpclassify_double_#res|)} {562#true} #94#return; {593#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-17 22:04:57,416 INFO L280 TraceCheckUtils]: 18: Hoare triple {593#(<= 1 |fmax_double_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {593#(<= 1 |fmax_double_#t~ret4|)} is VALID [2020-07-17 22:04:57,416 INFO L280 TraceCheckUtils]: 19: Hoare triple {593#(<= 1 |fmax_double_#t~ret4|)} assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; {563#false} is VALID [2020-07-17 22:04:57,416 INFO L280 TraceCheckUtils]: 20: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-17 22:04:57,417 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {563#false} {562#true} #90#return; {563#false} is VALID [2020-07-17 22:04:57,417 INFO L280 TraceCheckUtils]: 22: Hoare triple {563#false} ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); {563#false} is VALID [2020-07-17 22:04:57,417 INFO L280 TraceCheckUtils]: 23: Hoare triple {563#false} assume !#t~short11; {563#false} is VALID [2020-07-17 22:04:57,417 INFO L280 TraceCheckUtils]: 24: Hoare triple {563#false} assume !#t~short11;havoc #t~short11;havoc #t~ret10; {563#false} is VALID [2020-07-17 22:04:57,418 INFO L280 TraceCheckUtils]: 25: Hoare triple {563#false} assume !false; {563#false} is VALID [2020-07-17 22:04:57,419 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-17 22:04:57,419 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159171425] [2020-07-17 22:04:57,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:04:57,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:04:57,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364465633] [2020-07-17 22:04:57,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-17 22:04:57,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:04:57,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:04:57,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:04:57,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:04:57,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:04:57,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:04:57,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:04:57,451 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2020-07-17 22:04:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:57,975 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2020-07-17 22:04:57,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:04:57,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-17 22:04:57,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:04:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:04:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-17 22:04:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:04:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-17 22:04:57,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-17 22:04:58,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:04:58,108 INFO L225 Difference]: With dead ends: 63 [2020-07-17 22:04:58,108 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:04:58,108 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:04:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:04:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2020-07-17 22:04:58,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:04:58,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2020-07-17 22:04:58,135 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2020-07-17 22:04:58,135 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2020-07-17 22:04:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:58,139 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-17 22:04:58,139 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-17 22:04:58,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:04:58,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:04:58,140 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2020-07-17 22:04:58,141 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2020-07-17 22:04:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:04:58,144 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-17 22:04:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-17 22:04:58,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:04:58,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:04:58,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:04:58,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:04:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 22:04:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-17 22:04:58,149 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2020-07-17 22:04:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:04:58,149 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-17 22:04:58,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:04:58,150 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-17 22:04:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:04:58,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:04:58,151 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] [2020-07-17 22:04:58,151 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:04:58,151 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:04:58,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:04:58,152 INFO L82 PathProgramCache]: Analyzing trace with hash -793484843, now seen corresponding path program 1 times [2020-07-17 22:04:58,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:04:58,152 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726871469] [2020-07-17 22:04:58,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:04:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:04:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:04:58,317 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:04:58,318 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.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1139) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1004) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:407) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:390) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:349) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) 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.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) 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-17 22:04:58,327 INFO L168 Benchmark]: Toolchain (without parser) took 4428.21 ms. Allocated memory was 145.8 MB in the beginning and 282.1 MB in the end (delta: 136.3 MB). Free memory was 101.9 MB in the beginning and 231.5 MB in the end (delta: -129.6 MB). Peak memory consumption was 6.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:04:58,328 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:04:58,329 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.68 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 180.0 MB in the end (delta: -78.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:04:58,335 INFO L168 Benchmark]: Boogie Preprocessor took 45.55 ms. Allocated memory is still 202.9 MB. Free memory was 180.0 MB in the beginning and 178.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:04:58,337 INFO L168 Benchmark]: RCFGBuilder took 574.36 ms. Allocated memory is still 202.9 MB. Free memory was 178.0 MB in the beginning and 146.7 MB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:04:58,343 INFO L168 Benchmark]: TraceAbstraction took 3433.06 ms. Allocated memory was 202.9 MB in the beginning and 282.1 MB in the end (delta: 79.2 MB). Free memory was 146.1 MB in the beginning and 231.5 MB in the end (delta: -85.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:04:58,351 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 368.68 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.5 MB in the beginning and 180.0 MB in the end (delta: -78.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.55 ms. Allocated memory is still 202.9 MB. Free memory was 180.0 MB in the beginning and 178.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 574.36 ms. Allocated memory is still 202.9 MB. Free memory was 178.0 MB in the beginning and 146.7 MB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3433.06 ms. Allocated memory was 202.9 MB in the beginning and 282.1 MB in the end (delta: 79.2 MB). Free memory was 146.1 MB in the beginning and 231.5 MB in the end (delta: -85.4 MB). There was no memory consumed. 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.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...