/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_1210.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 11:59:38,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 11:59:38,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 11:59:38,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 11:59:38,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 11:59:38,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 11:59:38,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 11:59:38,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 11:59:38,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 11:59:38,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 11:59:38,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 11:59:38,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 11:59:38,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 11:59:38,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 11:59:38,464 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 11:59:38,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 11:59:38,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 11:59:38,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 11:59:38,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 11:59:38,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 11:59:38,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 11:59:38,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 11:59:38,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 11:59:38,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 11:59:38,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 11:59:38,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 11:59:38,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 11:59:38,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 11:59:38,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 11:59:38,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 11:59:38,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 11:59:38,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 11:59:38,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 11:59:38,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 11:59:38,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 11:59:38,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 11:59:38,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 11:59:38,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 11:59:38,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 11:59:38,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 11:59:38,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 11:59:38,502 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-08 11:59:38,539 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 11:59:38,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 11:59:38,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 11:59:38,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 11:59:38,541 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 11:59:38,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 11:59:38,544 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 11:59:38,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 11:59:38,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 11:59:38,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 11:59:38,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 11:59:38,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 11:59:38,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 11:59:38,546 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 11:59:38,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 11:59:38,546 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 11:59:38,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 11:59:38,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 11:59:38,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 11:59:38,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 11:59:38,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 11:59:38,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 11:59:38,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 11:59:38,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 11:59:38,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 11:59:38,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 11:59:38,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 11:59:38,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 11:59:38,550 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 11:59:38,550 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 11:59:38,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 11:59:38,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 11:59:38,833 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 11:59:38,835 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 11:59:38,835 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 11:59:38,835 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1210.c [2020-07-08 11:59:38,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb54d1514/b47254bc754b4e2ba36f97665b5aebcc/FLAG65d654fe6 [2020-07-08 11:59:39,396 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 11:59:39,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1210.c [2020-07-08 11:59:39,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb54d1514/b47254bc754b4e2ba36f97665b5aebcc/FLAG65d654fe6 [2020-07-08 11:59:39,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb54d1514/b47254bc754b4e2ba36f97665b5aebcc [2020-07-08 11:59:39,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 11:59:39,750 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 11:59:39,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 11:59:39,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 11:59:39,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 11:59:39,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:59:39" (1/1) ... [2020-07-08 11:59:39,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@598cff86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:39, skipping insertion in model container [2020-07-08 11:59:39,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:59:39" (1/1) ... [2020-07-08 11:59:39,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 11:59:39,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 11:59:40,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 11:59:40,043 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 11:59:40,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 11:59:40,111 INFO L208 MainTranslator]: Completed translation [2020-07-08 11:59:40,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:40 WrapperNode [2020-07-08 11:59:40,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 11:59:40,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 11:59:40,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 11:59:40,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 11:59:40,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:40" (1/1) ... [2020-07-08 11:59:40,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:40" (1/1) ... [2020-07-08 11:59:40,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:40" (1/1) ... [2020-07-08 11:59:40,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:40" (1/1) ... [2020-07-08 11:59:40,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:40" (1/1) ... [2020-07-08 11:59:40,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:40" (1/1) ... [2020-07-08 11:59:40,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:40" (1/1) ... [2020-07-08 11:59:40,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 11:59:40,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 11:59:40,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 11:59:40,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 11:59:40,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 11:59:40,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 11:59:40,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 11:59:40,346 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_float [2020-07-08 11:59:40,346 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2020-07-08 11:59:40,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 11:59:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 11:59:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure modf_float [2020-07-08 11:59:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 11:59:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-08 11:59:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 11:59:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 11:59:40,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 11:59:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-08 11:59:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2020-07-08 11:59:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 11:59:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 11:59:40,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 11:59:40,944 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 11:59:40,945 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-08 11:59:40,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:59:40 BoogieIcfgContainer [2020-07-08 11:59:40,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 11:59:40,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 11:59:40,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 11:59:40,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 11:59:40,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:59:39" (1/3) ... [2020-07-08 11:59:40,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b60b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:59:40, skipping insertion in model container [2020-07-08 11:59:40,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:59:40" (2/3) ... [2020-07-08 11:59:40,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b60b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:59:40, skipping insertion in model container [2020-07-08 11:59:40,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:59:40" (3/3) ... [2020-07-08 11:59:40,961 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1210.c [2020-07-08 11:59:40,973 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 11:59:40,981 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 11:59:40,997 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 11:59:41,024 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 11:59:41,024 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 11:59:41,024 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 11:59:41,024 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 11:59:41,025 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 11:59:41,025 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 11:59:41,025 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 11:59:41,025 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 11:59:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2020-07-08 11:59:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 11:59:41,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 11:59:41,056 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] [2020-07-08 11:59:41,057 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 11:59:41,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 11:59:41,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1399428577, now seen corresponding path program 1 times [2020-07-08 11:59:41,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 11:59:41,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269319097] [2020-07-08 11:59:41,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 11:59:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:41,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {68#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {51#true} is VALID [2020-07-08 11:59:41,302 INFO L280 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-08 11:59:41,303 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #129#return; {51#true} is VALID [2020-07-08 11:59:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:41,337 INFO L280 TraceCheckUtils]: 0: Hoare triple {69#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; {51#true} is VALID [2020-07-08 11:59:41,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {51#true} assume !true; {52#false} is VALID [2020-07-08 11:59:41,339 INFO L280 TraceCheckUtils]: 2: Hoare triple {52#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {52#false} is VALID [2020-07-08 11:59:41,340 INFO L280 TraceCheckUtils]: 3: Hoare triple {52#false} assume !(~j0~0 < 23);havoc ~ix~1;call write~real(~someBinaryArithmeticFLOAToperation(~x, ~one_modf~0), ~iptr.base, ~iptr.offset, 4); {52#false} is VALID [2020-07-08 11:59:41,340 INFO L280 TraceCheckUtils]: 4: Hoare triple {52#false} assume !true; {52#false} is VALID [2020-07-08 11:59:41,341 INFO L280 TraceCheckUtils]: 5: Hoare triple {52#false} assume !true; {52#false} is VALID [2020-07-08 11:59:41,341 INFO L280 TraceCheckUtils]: 6: Hoare triple {52#false} #res := ~x; {52#false} is VALID [2020-07-08 11:59:41,341 INFO L280 TraceCheckUtils]: 7: Hoare triple {52#false} assume true; {52#false} is VALID [2020-07-08 11:59:41,342 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {52#false} {51#true} #133#return; {52#false} is VALID [2020-07-08 11:59:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:41,354 INFO L280 TraceCheckUtils]: 0: Hoare triple {51#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {51#true} is VALID [2020-07-08 11:59:41,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-08 11:59:41,355 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {51#true} {52#false} #135#return; {52#false} is VALID [2020-07-08 11:59:41,357 INFO L263 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {68#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} is VALID [2020-07-08 11:59:41,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {51#true} is VALID [2020-07-08 11:59:41,358 INFO L280 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-08 11:59:41,358 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #129#return; {51#true} is VALID [2020-07-08 11:59:41,358 INFO L263 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret18 := main(); {51#true} is VALID [2020-07-08 11:59:41,359 INFO L280 TraceCheckUtils]: 5: Hoare triple {51#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4); {51#true} is VALID [2020-07-08 11:59:41,361 INFO L263 TraceCheckUtils]: 6: Hoare triple {51#true} call #t~ret13 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {69#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 11:59:41,362 INFO L280 TraceCheckUtils]: 7: Hoare triple {69#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; {51#true} is VALID [2020-07-08 11:59:41,363 INFO L280 TraceCheckUtils]: 8: Hoare triple {51#true} assume !true; {52#false} is VALID [2020-07-08 11:59:41,363 INFO L280 TraceCheckUtils]: 9: Hoare triple {52#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {52#false} is VALID [2020-07-08 11:59:41,364 INFO L280 TraceCheckUtils]: 10: Hoare triple {52#false} assume !(~j0~0 < 23);havoc ~ix~1;call write~real(~someBinaryArithmeticFLOAToperation(~x, ~one_modf~0), ~iptr.base, ~iptr.offset, 4); {52#false} is VALID [2020-07-08 11:59:41,364 INFO L280 TraceCheckUtils]: 11: Hoare triple {52#false} assume !true; {52#false} is VALID [2020-07-08 11:59:41,364 INFO L280 TraceCheckUtils]: 12: Hoare triple {52#false} assume !true; {52#false} is VALID [2020-07-08 11:59:41,365 INFO L280 TraceCheckUtils]: 13: Hoare triple {52#false} #res := ~x; {52#false} is VALID [2020-07-08 11:59:41,365 INFO L280 TraceCheckUtils]: 14: Hoare triple {52#false} assume true; {52#false} is VALID [2020-07-08 11:59:41,365 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {52#false} {51#true} #133#return; {52#false} is VALID [2020-07-08 11:59:41,366 INFO L280 TraceCheckUtils]: 16: Hoare triple {52#false} ~res~0 := #t~ret13;havoc #t~ret13;call #t~mem14 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); {52#false} is VALID [2020-07-08 11:59:41,366 INFO L263 TraceCheckUtils]: 17: Hoare triple {52#false} call #t~ret15 := isnan_float(#t~mem14); {51#true} is VALID [2020-07-08 11:59:41,367 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {51#true} is VALID [2020-07-08 11:59:41,367 INFO L280 TraceCheckUtils]: 19: Hoare triple {51#true} assume true; {51#true} is VALID [2020-07-08 11:59:41,367 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {51#true} {52#false} #135#return; {52#false} is VALID [2020-07-08 11:59:41,368 INFO L280 TraceCheckUtils]: 21: Hoare triple {52#false} assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647;#t~short17 := 0 != #t~ret15; {52#false} is VALID [2020-07-08 11:59:41,368 INFO L280 TraceCheckUtils]: 22: Hoare triple {52#false} assume !#t~short17; {52#false} is VALID [2020-07-08 11:59:41,368 INFO L280 TraceCheckUtils]: 23: Hoare triple {52#false} assume #t~short17;havoc #t~mem14;havoc #t~short17;havoc #t~ret15;havoc #t~ret16; {52#false} is VALID [2020-07-08 11:59:41,369 INFO L280 TraceCheckUtils]: 24: Hoare triple {52#false} assume !false; {52#false} is VALID [2020-07-08 11:59:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 11:59:41,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269319097] [2020-07-08 11:59:41,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 11:59:41,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 11:59:41,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869443925] [2020-07-08 11:59:41,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-08 11:59:41,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 11:59:41,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 11:59:41,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 11:59:41,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 11:59:41,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 11:59:41,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 11:59:41,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 11:59:41,483 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2020-07-08 11:59:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:42,083 INFO L93 Difference]: Finished difference Result 88 states and 126 transitions. [2020-07-08 11:59:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 11:59:42,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-08 11:59:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 11:59:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 11:59:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2020-07-08 11:59:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 11:59:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2020-07-08 11:59:42,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2020-07-08 11:59:42,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 11:59:42,346 INFO L225 Difference]: With dead ends: 88 [2020-07-08 11:59:42,346 INFO L226 Difference]: Without dead ends: 44 [2020-07-08 11:59:42,351 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 11:59:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-08 11:59:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-08 11:59:42,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 11:59:42,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-08 11:59:42,420 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-08 11:59:42,421 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-08 11:59:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:42,428 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-08 11:59:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-08 11:59:42,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:59:42,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:59:42,430 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-08 11:59:42,430 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-08 11:59:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:42,435 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-08 11:59:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-08 11:59:42,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:59:42,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:59:42,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 11:59:42,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 11:59:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-08 11:59:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2020-07-08 11:59:42,444 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 25 [2020-07-08 11:59:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 11:59:42,444 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2020-07-08 11:59:42,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 11:59:42,445 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-08 11:59:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 11:59:42,446 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 11:59:42,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 11:59:42,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 11:59:42,447 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 11:59:42,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 11:59:42,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1932138526, now seen corresponding path program 1 times [2020-07-08 11:59:42,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 11:59:42,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956054117] [2020-07-08 11:59:42,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 11:59:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:42,584 INFO L280 TraceCheckUtils]: 0: Hoare triple {351#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {331#true} is VALID [2020-07-08 11:59:42,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {331#true} assume true; {331#true} is VALID [2020-07-08 11:59:42,585 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {331#true} {331#true} #129#return; {331#true} is VALID [2020-07-08 11:59:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:42,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {352#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; {331#true} is VALID [2020-07-08 11:59:42,620 INFO L280 TraceCheckUtils]: 1: Hoare triple {331#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);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);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; {331#true} is VALID [2020-07-08 11:59:42,620 INFO L280 TraceCheckUtils]: 2: Hoare triple {331#true} goto; {331#true} is VALID [2020-07-08 11:59:42,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {331#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {331#true} is VALID [2020-07-08 11:59:42,621 INFO L280 TraceCheckUtils]: 4: Hoare triple {331#true} assume ~j0~0 < 23; {331#true} is VALID [2020-07-08 11:59:42,621 INFO L280 TraceCheckUtils]: 5: Hoare triple {331#true} assume ~j0~0 < 0; {331#true} is VALID [2020-07-08 11:59:42,622 INFO L280 TraceCheckUtils]: 6: Hoare triple {331#true} call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.allocOnStack(4);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4);call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4);call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4);havoc #t~mem2;call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset);havoc ~#sf_u~0.base, ~#sf_u~0.offset; {331#true} is VALID [2020-07-08 11:59:42,622 INFO L280 TraceCheckUtils]: 7: Hoare triple {331#true} goto; {331#true} is VALID [2020-07-08 11:59:42,622 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#true} #res := ~x; {331#true} is VALID [2020-07-08 11:59:42,623 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#true} assume true; {331#true} is VALID [2020-07-08 11:59:42,623 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {331#true} {331#true} #133#return; {331#true} is VALID [2020-07-08 11:59:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 11:59:42,630 INFO L280 TraceCheckUtils]: 0: Hoare triple {331#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {331#true} is VALID [2020-07-08 11:59:42,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {331#true} assume true; {331#true} is VALID [2020-07-08 11:59:42,631 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {331#true} {331#true} #135#return; {331#true} is VALID [2020-07-08 11:59:42,632 INFO L263 TraceCheckUtils]: 0: Hoare triple {331#true} call ULTIMATE.init(); {351#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} is VALID [2020-07-08 11:59:42,633 INFO L280 TraceCheckUtils]: 1: Hoare triple {351#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~one_modf~0 |old(~one_modf~0)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {331#true} is VALID [2020-07-08 11:59:42,633 INFO L280 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2020-07-08 11:59:42,633 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #129#return; {331#true} is VALID [2020-07-08 11:59:42,634 INFO L263 TraceCheckUtils]: 4: Hoare triple {331#true} call #t~ret18 := main(); {331#true} is VALID [2020-07-08 11:59:42,634 INFO L280 TraceCheckUtils]: 5: Hoare triple {331#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4); {331#true} is VALID [2020-07-08 11:59:42,636 INFO L263 TraceCheckUtils]: 6: Hoare triple {331#true} call #t~ret13 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {352#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 11:59:42,636 INFO L280 TraceCheckUtils]: 7: Hoare triple {352#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset;havoc ~i0~0;havoc ~j0~0;havoc ~i~0; {331#true} is VALID [2020-07-08 11:59:42,637 INFO L280 TraceCheckUtils]: 8: Hoare triple {331#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);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);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; {331#true} is VALID [2020-07-08 11:59:42,637 INFO L280 TraceCheckUtils]: 9: Hoare triple {331#true} goto; {331#true} is VALID [2020-07-08 11:59:42,638 INFO L280 TraceCheckUtils]: 10: Hoare triple {331#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {331#true} is VALID [2020-07-08 11:59:42,638 INFO L280 TraceCheckUtils]: 11: Hoare triple {331#true} assume ~j0~0 < 23; {331#true} is VALID [2020-07-08 11:59:42,638 INFO L280 TraceCheckUtils]: 12: Hoare triple {331#true} assume ~j0~0 < 0; {331#true} is VALID [2020-07-08 11:59:42,639 INFO L280 TraceCheckUtils]: 13: Hoare triple {331#true} call ~#sf_u~0.base, ~#sf_u~0.offset := #Ultimate.allocOnStack(4);call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#sf_u~0.base, ~#sf_u~0.offset, 4);call #t~mem2 := read~real(~#sf_u~0.base, ~#sf_u~0.offset, 4);call write~real(#t~mem2, ~iptr.base, ~iptr.offset, 4);havoc #t~mem2;call ULTIMATE.dealloc(~#sf_u~0.base, ~#sf_u~0.offset);havoc ~#sf_u~0.base, ~#sf_u~0.offset; {331#true} is VALID [2020-07-08 11:59:42,639 INFO L280 TraceCheckUtils]: 14: Hoare triple {331#true} goto; {331#true} is VALID [2020-07-08 11:59:42,639 INFO L280 TraceCheckUtils]: 15: Hoare triple {331#true} #res := ~x; {331#true} is VALID [2020-07-08 11:59:42,640 INFO L280 TraceCheckUtils]: 16: Hoare triple {331#true} assume true; {331#true} is VALID [2020-07-08 11:59:42,640 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {331#true} {331#true} #133#return; {331#true} is VALID [2020-07-08 11:59:42,640 INFO L280 TraceCheckUtils]: 18: Hoare triple {331#true} ~res~0 := #t~ret13;havoc #t~ret13;call #t~mem14 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); {331#true} is VALID [2020-07-08 11:59:42,641 INFO L263 TraceCheckUtils]: 19: Hoare triple {331#true} call #t~ret15 := isnan_float(#t~mem14); {331#true} is VALID [2020-07-08 11:59:42,641 INFO L280 TraceCheckUtils]: 20: Hoare triple {331#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {331#true} is VALID [2020-07-08 11:59:42,641 INFO L280 TraceCheckUtils]: 21: Hoare triple {331#true} assume true; {331#true} is VALID [2020-07-08 11:59:42,642 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {331#true} {331#true} #135#return; {331#true} is VALID [2020-07-08 11:59:42,642 INFO L280 TraceCheckUtils]: 23: Hoare triple {331#true} assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647;#t~short17 := 0 != #t~ret15; {331#true} is VALID [2020-07-08 11:59:42,643 INFO L280 TraceCheckUtils]: 24: Hoare triple {331#true} assume !#t~short17; {350#(not |main_#t~short17|)} is VALID [2020-07-08 11:59:42,644 INFO L280 TraceCheckUtils]: 25: Hoare triple {350#(not |main_#t~short17|)} assume #t~short17;havoc #t~mem14;havoc #t~short17;havoc #t~ret15;havoc #t~ret16; {332#false} is VALID [2020-07-08 11:59:42,644 INFO L280 TraceCheckUtils]: 26: Hoare triple {332#false} assume !false; {332#false} is VALID [2020-07-08 11:59:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 11:59:42,647 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956054117] [2020-07-08 11:59:42,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 11:59:42,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 11:59:42,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803173213] [2020-07-08 11:59:42,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-08 11:59:42,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 11:59:42,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 11:59:42,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 11:59:42,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 11:59:42,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 11:59:42,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 11:59:42,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 11:59:42,688 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2020-07-08 11:59:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:43,202 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2020-07-08 11:59:43,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 11:59:43,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-08 11:59:43,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 11:59:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 11:59:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-08 11:59:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 11:59:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-08 11:59:43,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2020-07-08 11:59:43,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 11:59:43,313 INFO L225 Difference]: With dead ends: 47 [2020-07-08 11:59:43,314 INFO L226 Difference]: Without dead ends: 44 [2020-07-08 11:59:43,315 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 11:59:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-08 11:59:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-08 11:59:43,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 11:59:43,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-08 11:59:43,349 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-08 11:59:43,350 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-08 11:59:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:43,354 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-08 11:59:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-08 11:59:43,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:59:43,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:59:43,355 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-08 11:59:43,355 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-08 11:59:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 11:59:43,359 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-08 11:59:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-08 11:59:43,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 11:59:43,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 11:59:43,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 11:59:43,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 11:59:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-08 11:59:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2020-07-08 11:59:43,364 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 27 [2020-07-08 11:59:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 11:59:43,364 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2020-07-08 11:59:43,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 11:59:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-08 11:59:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-08 11:59:43,366 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 11:59:43,366 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 11:59:43,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 11:59:43,367 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 11:59:43,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 11:59:43,367 INFO L82 PathProgramCache]: Analyzing trace with hash -425385736, now seen corresponding path program 1 times [2020-07-08 11:59:43,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 11:59:43,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160942061] [2020-07-08 11:59:43,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 11:59:43,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 11:59:43,440 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1012) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1159) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:214) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.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-08 11:59:43,448 INFO L168 Benchmark]: Toolchain (without parser) took 3695.80 ms. Allocated memory was 138.9 MB in the beginning and 245.4 MB in the end (delta: 106.4 MB). Free memory was 102.9 MB in the beginning and 144.5 MB in the end (delta: -41.6 MB). Peak memory consumption was 64.8 MB. Max. memory is 7.1 GB. [2020-07-08 11:59:43,450 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 11:59:43,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.43 ms. Allocated memory is still 138.9 MB. Free memory was 102.7 MB in the beginning and 90.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2020-07-08 11:59:43,453 INFO L168 Benchmark]: Boogie Preprocessor took 167.19 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 90.5 MB in the beginning and 179.7 MB in the end (delta: -89.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-08 11:59:43,455 INFO L168 Benchmark]: RCFGBuilder took 663.98 ms. Allocated memory is still 202.9 MB. Free memory was 179.7 MB in the beginning and 140.6 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. [2020-07-08 11:59:43,457 INFO L168 Benchmark]: TraceAbstraction took 2491.99 ms. Allocated memory was 202.9 MB in the beginning and 245.4 MB in the end (delta: 42.5 MB). Free memory was 139.9 MB in the beginning and 144.5 MB in the end (delta: -4.6 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. [2020-07-08 11:59:43,467 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 361.43 ms. Allocated memory is still 138.9 MB. Free memory was 102.7 MB in the beginning and 90.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 167.19 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 90.5 MB in the beginning and 179.7 MB in the end (delta: -89.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 663.98 ms. Allocated memory is still 202.9 MB. Free memory was 179.7 MB in the beginning and 140.6 MB in the end (delta: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2491.99 ms. Allocated memory was 202.9 MB in the beginning and 245.4 MB in the end (delta: 42.5 MB). Free memory was 139.9 MB in the beginning and 144.5 MB in the end (delta: -4.6 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...