/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/float_req_bl_1252b.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:42:28,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:42:28,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:42:28,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:42:28,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:42:28,559 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:42:28,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:42:28,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:42:28,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:42:28,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:42:28,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:42:28,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:42:28,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:42:28,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:42:28,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:42:28,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:42:28,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:42:28,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:42:28,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:42:28,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:42:28,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:42:28,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:42:28,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:42:28,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:42:28,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:42:28,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:42:28,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:42:28,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:42:28,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:42:28,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:42:28,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:42:28,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:42:28,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:42:28,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:42:28,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:42:28,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:42:28,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:42:28,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:42:28,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:42:28,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:42:28,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:42:28,593 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-10 14:42:28,608 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:42:28,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:42:28,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:42:28,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:42:28,610 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:42:28,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:42:28,611 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:42:28,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:42:28,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:42:28,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:42:28,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:42:28,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:42:28,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:42:28,612 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:42:28,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:42:28,613 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:42:28,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:42:28,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:42:28,613 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:42:28,613 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:42:28,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:42:28,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:42:28,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:42:28,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:42:28,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:42:28,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:42:28,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:42:28,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:42:28,615 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:42:28,615 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:42:28,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:42:28,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:42:28,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:42:28,939 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:42:28,940 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:42:28,941 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1252b.c [2020-07-10 14:42:29,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231bba646/99f9d2bda1f6418db4771d4d2b8c16db/FLAG310ae2379 [2020-07-10 14:42:29,525 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:42:29,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1252b.c [2020-07-10 14:42:29,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231bba646/99f9d2bda1f6418db4771d4d2b8c16db/FLAG310ae2379 [2020-07-10 14:42:29,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231bba646/99f9d2bda1f6418db4771d4d2b8c16db [2020-07-10 14:42:29,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:42:29,887 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:42:29,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:29,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:42:29,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:42:29,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:29" (1/1) ... [2020-07-10 14:42:29,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4386dceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:29, skipping insertion in model container [2020-07-10 14:42:29,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:29" (1/1) ... [2020-07-10 14:42:29,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:42:29,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:42:30,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:30,163 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:42:30,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:30,315 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:42:30,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:30 WrapperNode [2020-07-10 14:42:30,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:30,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:42:30,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:42:30,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:42:30,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:30" (1/1) ... [2020-07-10 14:42:30,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:30" (1/1) ... [2020-07-10 14:42:30,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:30" (1/1) ... [2020-07-10 14:42:30,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:30" (1/1) ... [2020-07-10 14:42:30,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:30" (1/1) ... [2020-07-10 14:42:30,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:30" (1/1) ... [2020-07-10 14:42:30,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:30" (1/1) ... [2020-07-10 14:42:30,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:42:30,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:42:30,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:42:30,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:42:30,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:30" (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-10 14:42:30,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:42:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:42:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2020-07-10 14:42:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2020-07-10 14:42:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2020-07-10 14:42:30,443 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:42:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:42:30,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2020-07-10 14:42:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2020-07-10 14:42:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 14:42:30,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-10 14:42:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 14:42:30,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 14:42:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2020-07-10 14:42:30,447 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2020-07-10 14:42:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:42:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:42:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:42:30,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-10 14:42:30,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 14:42:30,998 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:42:30,999 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 14:42:31,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:31 BoogieIcfgContainer [2020-07-10 14:42:31,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:42:31,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:42:31,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:42:31,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:42:31,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:42:29" (1/3) ... [2020-07-10 14:42:31,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541ad80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:31, skipping insertion in model container [2020-07-10 14:42:31,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:30" (2/3) ... [2020-07-10 14:42:31,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@541ad80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:31, skipping insertion in model container [2020-07-10 14:42:31,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:31" (3/3) ... [2020-07-10 14:42:31,012 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1252b.c [2020-07-10 14:42:31,020 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:42:31,027 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:42:31,040 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:42:31,063 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:42:31,063 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:42:31,063 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:42:31,064 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:42:31,064 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:42:31,064 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:42:31,064 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:42:31,065 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:42:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-10 14:42:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 14:42:31,093 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:31,094 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-10 14:42:31,095 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:31,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1078913502, now seen corresponding path program 1 times [2020-07-10 14:42:31,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:31,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680365775] [2020-07-10 14:42:31,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:31,312 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-10 14:42:31,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 14:42:31,313 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #98#return; {47#true} is VALID [2020-07-10 14:42:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:31,371 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 ~w~0; {47#true} is VALID [2020-07-10 14:42:31,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:42:31,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {48#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {48#false} is VALID [2020-07-10 14:42:31,373 INFO L280 TraceCheckUtils]: 3: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:31,374 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-10 14:42:31,374 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-10 14:42:31,377 INFO L263 TraceCheckUtils]: 1: Hoare triple {47#true} call #t~ret2 := __fpclassify_float(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:31,378 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 ~w~0; {47#true} is VALID [2020-07-10 14:42:31,379 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:42:31,379 INFO L280 TraceCheckUtils]: 4: Hoare triple {48#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {48#false} is VALID [2020-07-10 14:42:31,380 INFO L280 TraceCheckUtils]: 5: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:31,380 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-10 14:42:31,381 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {48#false} is VALID [2020-07-10 14:42:31,381 INFO L280 TraceCheckUtils]: 8: Hoare triple {48#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {48#false} is VALID [2020-07-10 14:42:31,382 INFO L280 TraceCheckUtils]: 9: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:31,382 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {48#false} {47#true} #90#return; {48#false} is VALID [2020-07-10 14:42:31,385 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-10 14:42:31,385 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-10 14:42:31,386 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-10 14:42:31,386 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {47#true} {47#true} #98#return; {47#true} is VALID [2020-07-10 14:42:31,387 INFO L263 TraceCheckUtils]: 4: Hoare triple {47#true} call #t~ret10 := main(); {47#true} is VALID [2020-07-10 14:42:31,387 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~x~0 := 0.0;~y~0 := ~someUnaryFLOAToperation(0.0); {47#true} is VALID [2020-07-10 14:42:31,390 INFO L263 TraceCheckUtils]: 6: Hoare triple {47#true} call #t~ret7 := fmax_float(~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-10 14:42:31,391 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-10 14:42:31,393 INFO L263 TraceCheckUtils]: 8: Hoare triple {47#true} call #t~ret2 := __fpclassify_float(~x); {64#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:31,393 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 ~w~0; {47#true} is VALID [2020-07-10 14:42:31,394 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#true} assume !true; {48#false} is VALID [2020-07-10 14:42:31,395 INFO L280 TraceCheckUtils]: 11: Hoare triple {48#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {48#false} is VALID [2020-07-10 14:42:31,395 INFO L280 TraceCheckUtils]: 12: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:31,396 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {48#false} {47#true} #94#return; {48#false} is VALID [2020-07-10 14:42:31,396 INFO L280 TraceCheckUtils]: 14: Hoare triple {48#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {48#false} is VALID [2020-07-10 14:42:31,397 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#false} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {48#false} is VALID [2020-07-10 14:42:31,397 INFO L280 TraceCheckUtils]: 16: Hoare triple {48#false} assume true; {48#false} is VALID [2020-07-10 14:42:31,398 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {48#false} {47#true} #90#return; {48#false} is VALID [2020-07-10 14:42:31,398 INFO L280 TraceCheckUtils]: 18: Hoare triple {48#false} ~res~0 := #t~ret7;havoc #t~ret7;#t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {48#false} is VALID [2020-07-10 14:42:31,399 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#false} assume !#t~short9; {48#false} is VALID [2020-07-10 14:42:31,399 INFO L280 TraceCheckUtils]: 20: Hoare triple {48#false} assume !#t~short9;havoc #t~short9;havoc #t~ret8; {48#false} is VALID [2020-07-10 14:42:31,399 INFO L280 TraceCheckUtils]: 21: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-10 14:42:31,404 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-10 14:42:31,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680365775] [2020-07-10 14:42:31,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:31,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:42:31,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726645274] [2020-07-10 14:42:31,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 14:42:31,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:31,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:42:31,512 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-10 14:42:31,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:42:31,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:31,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:42:31,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:42:31,526 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2020-07-10 14:42:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:32,008 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2020-07-10 14:42:32,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:42:32,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 14:42:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-10 14:42:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2020-07-10 14:42:32,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2020-07-10 14:42:32,210 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-10 14:42:32,224 INFO L225 Difference]: With dead ends: 79 [2020-07-10 14:42:32,225 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 14:42:32,229 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-10 14:42:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 14:42:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-10 14:42:32,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:32,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:32,298 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:32,299 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:32,306 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:42:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:32,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:32,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:32,307 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:32,308 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-10 14:42:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:32,313 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-07-10 14:42:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:32,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:32,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:32,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:32,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 14:42:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-07-10 14:42:32,324 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2020-07-10 14:42:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:32,325 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-07-10 14:42:32,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:42:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-07-10 14:42:32,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 14:42:32,330 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:32,333 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-10 14:42:32,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:42:32,334 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:32,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:32,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1357269066, now seen corresponding path program 1 times [2020-07-10 14:42:32,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:32,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009229502] [2020-07-10 14:42:32,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:32,456 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-10 14:42:32,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-10 14:42:32,457 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {306#true} {306#true} #98#return; {306#true} is VALID [2020-07-10 14:42:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:32,560 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 ~w~0; {306#true} is VALID [2020-07-10 14:42:32,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {306#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {306#true} is VALID [2020-07-10 14:42:32,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:42:32,562 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:32,563 INFO L280 TraceCheckUtils]: 4: Hoare triple {332#(<= 2 |__fpclassify_float_#res|)} assume true; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:32,565 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {332#(<= 2 |__fpclassify_float_#res|)} {306#true} #94#return; {331#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:32,566 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-10 14:42:32,567 INFO L263 TraceCheckUtils]: 1: Hoare triple {306#true} call #t~ret2 := __fpclassify_float(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:32,568 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 ~w~0; {306#true} is VALID [2020-07-10 14:42:32,568 INFO L280 TraceCheckUtils]: 3: Hoare triple {306#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {306#true} is VALID [2020-07-10 14:42:32,568 INFO L280 TraceCheckUtils]: 4: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:42:32,569 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:32,570 INFO L280 TraceCheckUtils]: 6: Hoare triple {332#(<= 2 |__fpclassify_float_#res|)} assume true; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:32,571 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {332#(<= 2 |__fpclassify_float_#res|)} {306#true} #94#return; {331#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:32,572 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#(<= 2 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {331#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:32,573 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {307#false} is VALID [2020-07-10 14:42:32,574 INFO L280 TraceCheckUtils]: 10: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-10 14:42:32,574 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {307#false} {306#true} #90#return; {307#false} is VALID [2020-07-10 14:42:32,576 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-10 14:42:32,576 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-10 14:42:32,576 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#true} assume true; {306#true} is VALID [2020-07-10 14:42:32,577 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {306#true} {306#true} #98#return; {306#true} is VALID [2020-07-10 14:42:32,577 INFO L263 TraceCheckUtils]: 4: Hoare triple {306#true} call #t~ret10 := main(); {306#true} is VALID [2020-07-10 14:42:32,577 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#true} ~x~0 := 0.0;~y~0 := ~someUnaryFLOAToperation(0.0); {306#true} is VALID [2020-07-10 14:42:32,579 INFO L263 TraceCheckUtils]: 6: Hoare triple {306#true} call #t~ret7 := fmax_float(~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-10 14:42:32,579 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-10 14:42:32,581 INFO L263 TraceCheckUtils]: 8: Hoare triple {306#true} call #t~ret2 := __fpclassify_float(~x); {324#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:32,581 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 ~w~0; {306#true} is VALID [2020-07-10 14:42:32,582 INFO L280 TraceCheckUtils]: 10: Hoare triple {306#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {306#true} is VALID [2020-07-10 14:42:32,582 INFO L280 TraceCheckUtils]: 11: Hoare triple {306#true} goto; {306#true} is VALID [2020-07-10 14:42:32,584 INFO L280 TraceCheckUtils]: 12: Hoare triple {306#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:32,585 INFO L280 TraceCheckUtils]: 13: Hoare triple {332#(<= 2 |__fpclassify_float_#res|)} assume true; {332#(<= 2 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:32,586 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {332#(<= 2 |__fpclassify_float_#res|)} {306#true} #94#return; {331#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:32,587 INFO L280 TraceCheckUtils]: 15: Hoare triple {331#(<= 2 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {331#(<= 2 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:32,588 INFO L280 TraceCheckUtils]: 16: Hoare triple {331#(<= 2 |fmax_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {307#false} is VALID [2020-07-10 14:42:32,588 INFO L280 TraceCheckUtils]: 17: Hoare triple {307#false} assume true; {307#false} is VALID [2020-07-10 14:42:32,589 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {307#false} {306#true} #90#return; {307#false} is VALID [2020-07-10 14:42:32,589 INFO L280 TraceCheckUtils]: 19: Hoare triple {307#false} ~res~0 := #t~ret7;havoc #t~ret7;#t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {307#false} is VALID [2020-07-10 14:42:32,589 INFO L280 TraceCheckUtils]: 20: Hoare triple {307#false} assume !#t~short9; {307#false} is VALID [2020-07-10 14:42:32,590 INFO L280 TraceCheckUtils]: 21: Hoare triple {307#false} assume !#t~short9;havoc #t~short9;havoc #t~ret8; {307#false} is VALID [2020-07-10 14:42:32,590 INFO L280 TraceCheckUtils]: 22: Hoare triple {307#false} assume !false; {307#false} is VALID [2020-07-10 14:42:32,592 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-10 14:42:32,592 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009229502] [2020-07-10 14:42:32,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:32,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:42:32,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577312536] [2020-07-10 14:42:32,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:42:32,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:32,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:42:32,628 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-10 14:42:32,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:42:32,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:32,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:42:32,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:32,629 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 6 states. [2020-07-10 14:42:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:33,312 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2020-07-10 14:42:33,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:42:33,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 14:42:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:42:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:42:33,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-10 14:42:33,426 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-10 14:42:33,430 INFO L225 Difference]: With dead ends: 59 [2020-07-10 14:42:33,430 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 14:42:33,431 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:42:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 14:42:33,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-10 14:42:33,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:33,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:33,476 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:33,476 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:33,481 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:42:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:33,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:33,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:33,482 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:33,482 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 14:42:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:33,487 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-10 14:42:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:33,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:33,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:33,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:33,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:42:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-10 14:42:33,493 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2020-07-10 14:42:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:33,493 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-10 14:42:33,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:42:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:33,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:42:33,495 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:33,495 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-10 14:42:33,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:42:33,496 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:33,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:33,496 INFO L82 PathProgramCache]: Analyzing trace with hash 888409989, now seen corresponding path program 1 times [2020-07-10 14:42:33,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:33,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109979508] [2020-07-10 14:42:33,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:33,580 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-10 14:42:33,581 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-10 14:42:33,581 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {562#true} {562#true} #98#return; {562#true} is VALID [2020-07-10 14:42:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:33,688 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 ~w~0; {562#true} is VALID [2020-07-10 14:42:33,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {562#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {562#true} is VALID [2020-07-10 14:42:33,688 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:42:33,689 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {562#true} is VALID [2020-07-10 14:42:33,689 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {562#true} is VALID [2020-07-10 14:42:33,689 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {562#true} is VALID [2020-07-10 14:42:33,690 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:33,691 INFO L280 TraceCheckUtils]: 7: Hoare triple {594#(<= 1 |__fpclassify_float_#res|)} assume true; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:33,692 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {594#(<= 1 |__fpclassify_float_#res|)} {562#true} #94#return; {593#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:33,693 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-10 14:42:33,694 INFO L263 TraceCheckUtils]: 1: Hoare triple {562#true} call #t~ret2 := __fpclassify_float(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:33,694 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 ~w~0; {562#true} is VALID [2020-07-10 14:42:33,694 INFO L280 TraceCheckUtils]: 3: Hoare triple {562#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {562#true} is VALID [2020-07-10 14:42:33,695 INFO L280 TraceCheckUtils]: 4: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:42:33,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {562#true} is VALID [2020-07-10 14:42:33,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {562#true} is VALID [2020-07-10 14:42:33,696 INFO L280 TraceCheckUtils]: 7: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {562#true} is VALID [2020-07-10 14:42:33,696 INFO L280 TraceCheckUtils]: 8: Hoare triple {562#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:33,697 INFO L280 TraceCheckUtils]: 9: Hoare triple {594#(<= 1 |__fpclassify_float_#res|)} assume true; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:33,698 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {594#(<= 1 |__fpclassify_float_#res|)} {562#true} #94#return; {593#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:33,699 INFO L280 TraceCheckUtils]: 11: Hoare triple {593#(<= 1 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {593#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:33,700 INFO L280 TraceCheckUtils]: 12: Hoare triple {593#(<= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {563#false} is VALID [2020-07-10 14:42:33,700 INFO L280 TraceCheckUtils]: 13: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-10 14:42:33,700 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {563#false} {562#true} #90#return; {563#false} is VALID [2020-07-10 14:42:33,702 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-10 14:42:33,702 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-10 14:42:33,702 INFO L280 TraceCheckUtils]: 2: Hoare triple {562#true} assume true; {562#true} is VALID [2020-07-10 14:42:33,702 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {562#true} {562#true} #98#return; {562#true} is VALID [2020-07-10 14:42:33,703 INFO L263 TraceCheckUtils]: 4: Hoare triple {562#true} call #t~ret10 := main(); {562#true} is VALID [2020-07-10 14:42:33,703 INFO L280 TraceCheckUtils]: 5: Hoare triple {562#true} ~x~0 := 0.0;~y~0 := ~someUnaryFLOAToperation(0.0); {562#true} is VALID [2020-07-10 14:42:33,704 INFO L263 TraceCheckUtils]: 6: Hoare triple {562#true} call #t~ret7 := fmax_float(~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-10 14:42:33,705 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-10 14:42:33,706 INFO L263 TraceCheckUtils]: 8: Hoare triple {562#true} call #t~ret2 := __fpclassify_float(~x); {583#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-10 14:42:33,706 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 ~w~0; {562#true} is VALID [2020-07-10 14:42:33,706 INFO L280 TraceCheckUtils]: 10: Hoare triple {562#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {562#true} is VALID [2020-07-10 14:42:33,707 INFO L280 TraceCheckUtils]: 11: Hoare triple {562#true} goto; {562#true} is VALID [2020-07-10 14:42:33,707 INFO L280 TraceCheckUtils]: 12: Hoare triple {562#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {562#true} is VALID [2020-07-10 14:42:33,707 INFO L280 TraceCheckUtils]: 13: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {562#true} is VALID [2020-07-10 14:42:33,707 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {562#true} is VALID [2020-07-10 14:42:33,708 INFO L280 TraceCheckUtils]: 15: Hoare triple {562#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:33,709 INFO L280 TraceCheckUtils]: 16: Hoare triple {594#(<= 1 |__fpclassify_float_#res|)} assume true; {594#(<= 1 |__fpclassify_float_#res|)} is VALID [2020-07-10 14:42:33,710 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {594#(<= 1 |__fpclassify_float_#res|)} {562#true} #94#return; {593#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:33,711 INFO L280 TraceCheckUtils]: 18: Hoare triple {593#(<= 1 |fmax_float_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {593#(<= 1 |fmax_float_#t~ret2|)} is VALID [2020-07-10 14:42:33,711 INFO L280 TraceCheckUtils]: 19: Hoare triple {593#(<= 1 |fmax_float_#t~ret2|)} assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; {563#false} is VALID [2020-07-10 14:42:33,712 INFO L280 TraceCheckUtils]: 20: Hoare triple {563#false} assume true; {563#false} is VALID [2020-07-10 14:42:33,712 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {563#false} {562#true} #90#return; {563#false} is VALID [2020-07-10 14:42:33,712 INFO L280 TraceCheckUtils]: 22: Hoare triple {563#false} ~res~0 := #t~ret7;havoc #t~ret7;#t~short9 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); {563#false} is VALID [2020-07-10 14:42:33,712 INFO L280 TraceCheckUtils]: 23: Hoare triple {563#false} assume !#t~short9; {563#false} is VALID [2020-07-10 14:42:33,713 INFO L280 TraceCheckUtils]: 24: Hoare triple {563#false} assume !#t~short9;havoc #t~short9;havoc #t~ret8; {563#false} is VALID [2020-07-10 14:42:33,713 INFO L280 TraceCheckUtils]: 25: Hoare triple {563#false} assume !false; {563#false} is VALID [2020-07-10 14:42:33,714 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-10 14:42:33,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109979508] [2020-07-10 14:42:33,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:33,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 14:42:33,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929120065] [2020-07-10 14:42:33,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 14:42:33,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:33,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:42:33,748 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-10 14:42:33,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:42:33,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:33,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:42:33,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:33,750 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 6 states. [2020-07-10 14:42:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:34,365 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2020-07-10 14:42:34,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:42:34,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 14:42:34,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:42:34,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2020-07-10 14:42:34,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2020-07-10 14:42:34,472 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-10 14:42:34,475 INFO L225 Difference]: With dead ends: 63 [2020-07-10 14:42:34,476 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 14:42:34,478 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-10 14:42:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 14:42:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2020-07-10 14:42:34,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:34,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2020-07-10 14:42:34,518 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2020-07-10 14:42:34,518 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2020-07-10 14:42:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:34,526 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-10 14:42:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-10 14:42:34,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:34,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:34,527 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2020-07-10 14:42:34,528 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2020-07-10 14:42:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:34,537 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-10 14:42:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-10 14:42:34,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:34,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:34,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:34,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 14:42:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2020-07-10 14:42:34,545 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2020-07-10 14:42:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:34,546 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-10 14:42:34,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:42:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2020-07-10 14:42:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 14:42:34,552 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:34,552 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-10 14:42:34,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 14:42:34,553 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:34,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:34,556 INFO L82 PathProgramCache]: Analyzing trace with hash -908541370, now seen corresponding path program 1 times [2020-07-10 14:42:34,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:34,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362056700] [2020-07-10 14:42:34,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 14:42:34,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 14:42:34,843 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-10 14:42:34,851 INFO L168 Benchmark]: Toolchain (without parser) took 4963.01 ms. Allocated memory was 143.7 MB in the beginning and 250.1 MB in the end (delta: 106.4 MB). Free memory was 99.9 MB in the beginning and 98.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 108.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:34,853 INFO L168 Benchmark]: CDTParser took 1.36 ms. Allocated memory is still 143.7 MB. Free memory was 118.6 MB in the beginning and 118.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 14:42:34,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.81 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 180.2 MB in the end (delta: -80.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:34,861 INFO L168 Benchmark]: Boogie Preprocessor took 51.40 ms. Allocated memory is still 201.3 MB. Free memory was 180.2 MB in the beginning and 177.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:34,862 INFO L168 Benchmark]: RCFGBuilder took 634.18 ms. Allocated memory is still 201.3 MB. Free memory was 177.8 MB in the beginning and 147.2 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:34,869 INFO L168 Benchmark]: TraceAbstraction took 3842.81 ms. Allocated memory was 201.3 MB in the beginning and 250.1 MB in the end (delta: 48.8 MB). Free memory was 146.5 MB in the beginning and 98.3 MB in the end (delta: 48.2 MB). Peak memory consumption was 97.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:42:34,877 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 1.36 ms. Allocated memory is still 143.7 MB. Free memory was 118.6 MB in the beginning and 118.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 428.81 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.7 MB in the beginning and 180.2 MB in the end (delta: -80.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.40 ms. Allocated memory is still 201.3 MB. Free memory was 180.2 MB in the beginning and 177.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 634.18 ms. Allocated memory is still 201.3 MB. Free memory was 177.8 MB in the beginning and 147.2 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3842.81 ms. Allocated memory was 201.3 MB in the beginning and 250.1 MB in the end (delta: 48.8 MB). Free memory was 146.5 MB in the beginning and 98.3 MB in the end (delta: 48.2 MB). Peak memory consumption was 97.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...