/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_1211a.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:05:54,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:05:54,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:05:54,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:05:54,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:05:54,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:05:54,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:05:54,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:05:54,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:05:54,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:05:54,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:05:54,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:05:54,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:05:54,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:05:54,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:05:54,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:05:54,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:05:54,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:05:54,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:05:54,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:05:54,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:05:54,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:05:54,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:05:54,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:05:54,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:05:54,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:05:54,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:05:54,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:05:54,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:05:54,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:05:54,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:05:54,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:05:54,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:05:54,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:05:54,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:05:54,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:05:54,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:05:54,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:05:54,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:05:54,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:05:54,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:05:54,596 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:05:54,615 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:05:54,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:05:54,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:05:54,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:05:54,617 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:05:54,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:05:54,617 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:05:54,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:05:54,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:05:54,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:05:54,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:05:54,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:05:54,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:05:54,619 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:05:54,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:05:54,619 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:05:54,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:05:54,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:05:54,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:05:54,620 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:05:54,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:05:54,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:05:54,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:05:54,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:05:54,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:05:54,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:05:54,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:05:54,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:05:54,622 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:05:54,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:05:54,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:05:54,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:05:54,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:05:54,908 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:05:54,909 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:05:54,910 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1211a.c [2020-07-17 22:05:54,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c1f124e/114f6c2d1f1c4dc5a5bb965272a81154/FLAG62f8f6298 [2020-07-17 22:05:55,465 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:05:55,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1211a.c [2020-07-17 22:05:55,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c1f124e/114f6c2d1f1c4dc5a5bb965272a81154/FLAG62f8f6298 [2020-07-17 22:05:55,841 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c1f124e/114f6c2d1f1c4dc5a5bb965272a81154 [2020-07-17 22:05:55,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:05:55,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:05:55,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:05:55,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:05:55,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:05:55,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:05:55" (1/1) ... [2020-07-17 22:05:55,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791d2189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:55, skipping insertion in model container [2020-07-17 22:05:55,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:05:55" (1/1) ... [2020-07-17 22:05:55,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:05:55,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:05:56,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:05:56,136 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:05:56,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:05:56,282 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:05:56,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56 WrapperNode [2020-07-17 22:05:56,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:05:56,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:05:56,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:05:56,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:05:56,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... [2020-07-17 22:05:56,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:05:56,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:05:56,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:05:56,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:05:56,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:05:56,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:05:56,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:05:56,430 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_float [2020-07-17 22:05:56,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2020-07-17 22:05:56,430 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2020-07-17 22:05:56,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:05:56,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:05:56,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2020-07-17 22:05:56,431 INFO L130 BoogieDeclarations]: Found specification of procedure modf_float [2020-07-17 22:05:56,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:05:56,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-17 22:05:56,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:05:56,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:05:56,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:05:56,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-17 22:05:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2020-07-17 22:05:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2020-07-17 22:05:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:05:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2020-07-17 22:05:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:05:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:05:57,068 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:05:57,069 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-17 22:05:57,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:05:57 BoogieIcfgContainer [2020-07-17 22:05:57,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:05:57,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:05:57,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:05:57,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:05:57,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:05:55" (1/3) ... [2020-07-17 22:05:57,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6423a03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:05:57, skipping insertion in model container [2020-07-17 22:05:57,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:05:56" (2/3) ... [2020-07-17 22:05:57,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6423a03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:05:57, skipping insertion in model container [2020-07-17 22:05:57,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:05:57" (3/3) ... [2020-07-17 22:05:57,083 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1211a.c [2020-07-17 22:05:57,095 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:05:57,103 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:05:57,118 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:05:57,145 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:05:57,145 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:05:57,145 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:05:57,145 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:05:57,146 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:05:57,146 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:05:57,146 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:05:57,147 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:05:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-07-17 22:05:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:05:57,177 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:05:57,178 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-17 22:05:57,179 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:05:57,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:05:57,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1328912444, now seen corresponding path program 1 times [2020-07-17 22:05:57,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:05:57,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674667378] [2020-07-17 22:05:57,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:05:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:57,404 INFO L280 TraceCheckUtils]: 0: Hoare triple {81#(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; {62#true} is VALID [2020-07-17 22:05:57,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-17 22:05:57,405 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {62#true} {62#true} #170#return; {62#true} is VALID [2020-07-17 22:05:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:57,436 INFO L280 TraceCheckUtils]: 0: Hoare triple {82#(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; {62#true} is VALID [2020-07-17 22:05:57,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-17 22:05:57,438 INFO L280 TraceCheckUtils]: 2: Hoare triple {63#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {63#false} is VALID [2020-07-17 22:05:57,438 INFO L280 TraceCheckUtils]: 3: Hoare triple {63#false} assume !(~j0~0 < 23);havoc ~ix~1;call write~real(~someBinaryArithmeticFLOAToperation(~x, ~one_modf~0), ~iptr.base, ~iptr.offset, 4); {63#false} is VALID [2020-07-17 22:05:57,439 INFO L280 TraceCheckUtils]: 4: Hoare triple {63#false} assume !true; {63#false} is VALID [2020-07-17 22:05:57,439 INFO L280 TraceCheckUtils]: 5: Hoare triple {63#false} assume !true; {63#false} is VALID [2020-07-17 22:05:57,440 INFO L280 TraceCheckUtils]: 6: Hoare triple {63#false} #res := ~x; {63#false} is VALID [2020-07-17 22:05:57,440 INFO L280 TraceCheckUtils]: 7: Hoare triple {63#false} assume true; {63#false} is VALID [2020-07-17 22:05:57,440 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {63#false} {62#true} #164#return; {63#false} is VALID [2020-07-17 22:05:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:57,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~ix~2; {62#true} is VALID [2020-07-17 22:05:57,451 INFO L280 TraceCheckUtils]: 1: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-17 22:05:57,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {63#false} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); {63#false} is VALID [2020-07-17 22:05:57,452 INFO L280 TraceCheckUtils]: 3: Hoare triple {63#false} assume true; {63#false} is VALID [2020-07-17 22:05:57,452 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {63#false} {63#false} #166#return; {63#false} is VALID [2020-07-17 22:05:57,454 INFO L263 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {81#(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-17 22:05:57,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#(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; {62#true} is VALID [2020-07-17 22:05:57,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2020-07-17 22:05:57,456 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #170#return; {62#true} is VALID [2020-07-17 22:05:57,456 INFO L263 TraceCheckUtils]: 4: Hoare triple {62#true} call #t~ret24 := main(); {62#true} is VALID [2020-07-17 22:05:57,456 INFO L280 TraceCheckUtils]: 5: Hoare triple {62#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4);call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4);havoc #t~nondet17; {62#true} is VALID [2020-07-17 22:05:57,459 INFO L263 TraceCheckUtils]: 6: Hoare triple {62#true} call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:05:57,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {82#(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; {62#true} is VALID [2020-07-17 22:05:57,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-17 22:05:57,461 INFO L280 TraceCheckUtils]: 9: Hoare triple {63#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {63#false} is VALID [2020-07-17 22:05:57,461 INFO L280 TraceCheckUtils]: 10: Hoare triple {63#false} assume !(~j0~0 < 23);havoc ~ix~1;call write~real(~someBinaryArithmeticFLOAToperation(~x, ~one_modf~0), ~iptr.base, ~iptr.offset, 4); {63#false} is VALID [2020-07-17 22:05:57,462 INFO L280 TraceCheckUtils]: 11: Hoare triple {63#false} assume !true; {63#false} is VALID [2020-07-17 22:05:57,462 INFO L280 TraceCheckUtils]: 12: Hoare triple {63#false} assume !true; {63#false} is VALID [2020-07-17 22:05:57,462 INFO L280 TraceCheckUtils]: 13: Hoare triple {63#false} #res := ~x; {63#false} is VALID [2020-07-17 22:05:57,463 INFO L280 TraceCheckUtils]: 14: Hoare triple {63#false} assume true; {63#false} is VALID [2020-07-17 22:05:57,463 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {63#false} {62#true} #164#return; {63#false} is VALID [2020-07-17 22:05:57,464 INFO L280 TraceCheckUtils]: 16: Hoare triple {63#false} ~res~0 := #t~ret18;havoc #t~ret18;call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); {63#false} is VALID [2020-07-17 22:05:57,464 INFO L263 TraceCheckUtils]: 17: Hoare triple {63#false} call #t~ret20 := isinf_float(#t~mem19); {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:05:57,464 INFO L280 TraceCheckUtils]: 18: Hoare triple {82#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~ix~2; {62#true} is VALID [2020-07-17 22:05:57,465 INFO L280 TraceCheckUtils]: 19: Hoare triple {62#true} assume !true; {63#false} is VALID [2020-07-17 22:05:57,466 INFO L280 TraceCheckUtils]: 20: Hoare triple {63#false} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); {63#false} is VALID [2020-07-17 22:05:57,466 INFO L280 TraceCheckUtils]: 21: Hoare triple {63#false} assume true; {63#false} is VALID [2020-07-17 22:05:57,467 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {63#false} {63#false} #166#return; {63#false} is VALID [2020-07-17 22:05:57,467 INFO L280 TraceCheckUtils]: 23: Hoare triple {63#false} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647;#t~short23 := 0 != #t~ret20; {63#false} is VALID [2020-07-17 22:05:57,467 INFO L280 TraceCheckUtils]: 24: Hoare triple {63#false} assume !#t~short23; {63#false} is VALID [2020-07-17 22:05:57,468 INFO L280 TraceCheckUtils]: 25: Hoare triple {63#false} assume #t~short23;havoc #t~short23;havoc #t~short22;havoc #t~ret21;havoc #t~mem19;havoc #t~ret20; {63#false} is VALID [2020-07-17 22:05:57,468 INFO L280 TraceCheckUtils]: 26: Hoare triple {63#false} assume !false; {63#false} is VALID [2020-07-17 22:05:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:05:57,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674667378] [2020-07-17 22:05:57,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:05:57,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:05:57,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357646381] [2020-07-17 22:05:57,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-17 22:05:57,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:05:57,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:05:57,542 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-17 22:05:57,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:05:57,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:05:57,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:05:57,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:05:57,554 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 4 states. [2020-07-17 22:05:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:58,123 INFO L93 Difference]: Finished difference Result 110 states and 158 transitions. [2020-07-17 22:05:58,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:05:58,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-17 22:05:58,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:05:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:05:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2020-07-17 22:05:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:05:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2020-07-17 22:05:58,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 158 transitions. [2020-07-17 22:05:58,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:05:58,375 INFO L225 Difference]: With dead ends: 110 [2020-07-17 22:05:58,376 INFO L226 Difference]: Without dead ends: 55 [2020-07-17 22:05:58,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:05:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-17 22:05:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-17 22:05:58,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:05:58,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:58,468 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:58,468 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:58,475 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-17 22:05:58,475 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-17 22:05:58,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:05:58,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:05:58,477 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:58,477 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:58,483 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-07-17 22:05:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-17 22:05:58,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:05:58,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:05:58,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:05:58,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:05:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 22:05:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-07-17 22:05:58,495 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 27 [2020-07-17 22:05:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:05:58,496 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-17 22:05:58,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:05:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-17 22:05:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:05:58,498 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:05:58,498 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:05:58,499 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:05:58,499 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:05:58,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:05:58,500 INFO L82 PathProgramCache]: Analyzing trace with hash -2017954314, now seen corresponding path program 1 times [2020-07-17 22:05:58,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:05:58,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883818024] [2020-07-17 22:05:58,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:05:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:58,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {431#(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; {408#true} is VALID [2020-07-17 22:05:58,698 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-17 22:05:58,699 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {408#true} {408#true} #170#return; {408#true} is VALID [2020-07-17 22:05:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:58,754 INFO L280 TraceCheckUtils]: 0: Hoare triple {432#(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; {408#true} is VALID [2020-07-17 22:05:58,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#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; {408#true} is VALID [2020-07-17 22:05:58,755 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-17 22:05:58,759 INFO L280 TraceCheckUtils]: 3: Hoare triple {408#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {408#true} is VALID [2020-07-17 22:05:58,759 INFO L280 TraceCheckUtils]: 4: Hoare triple {408#true} assume ~j0~0 < 23; {408#true} is VALID [2020-07-17 22:05:58,760 INFO L280 TraceCheckUtils]: 5: Hoare triple {408#true} assume ~j0~0 < 0; {408#true} is VALID [2020-07-17 22:05:58,761 INFO L280 TraceCheckUtils]: 6: Hoare triple {408#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; {408#true} is VALID [2020-07-17 22:05:58,762 INFO L280 TraceCheckUtils]: 7: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-17 22:05:58,763 INFO L280 TraceCheckUtils]: 8: Hoare triple {408#true} #res := ~x; {408#true} is VALID [2020-07-17 22:05:58,763 INFO L280 TraceCheckUtils]: 9: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-17 22:05:58,763 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {408#true} {408#true} #164#return; {408#true} is VALID [2020-07-17 22:05:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:05:58,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~ix~2; {408#true} is VALID [2020-07-17 22:05:58,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {408#true} call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4);call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4);~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4);havoc #t~union16;havoc #t~mem15;call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset);havoc ~#gf_u~4.base, ~#gf_u~4.offset; {408#true} is VALID [2020-07-17 22:05:58,803 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-17 22:05:58,804 INFO L280 TraceCheckUtils]: 3: Hoare triple {408#true} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); {408#true} is VALID [2020-07-17 22:05:58,804 INFO L280 TraceCheckUtils]: 4: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-17 22:05:58,804 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {408#true} {408#true} #166#return; {408#true} is VALID [2020-07-17 22:05:58,808 INFO L263 TraceCheckUtils]: 0: Hoare triple {408#true} call ULTIMATE.init(); {431#(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-17 22:05:58,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {431#(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; {408#true} is VALID [2020-07-17 22:05:58,809 INFO L280 TraceCheckUtils]: 2: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-17 22:05:58,809 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {408#true} {408#true} #170#return; {408#true} is VALID [2020-07-17 22:05:58,809 INFO L263 TraceCheckUtils]: 4: Hoare triple {408#true} call #t~ret24 := main(); {408#true} is VALID [2020-07-17 22:05:58,809 INFO L280 TraceCheckUtils]: 5: Hoare triple {408#true} ~x~0 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(4);call write~init~real(#t~nondet17, ~#iptr~0.base, ~#iptr~0.offset, 4);havoc #t~nondet17; {408#true} is VALID [2020-07-17 22:05:58,812 INFO L263 TraceCheckUtils]: 6: Hoare triple {408#true} call #t~ret18 := modf_float(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:05:58,812 INFO L280 TraceCheckUtils]: 7: Hoare triple {432#(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; {408#true} is VALID [2020-07-17 22:05:58,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {408#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; {408#true} is VALID [2020-07-17 22:05:58,813 INFO L280 TraceCheckUtils]: 9: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-17 22:05:58,813 INFO L280 TraceCheckUtils]: 10: Hoare triple {408#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 8388608, 255) - 127; {408#true} is VALID [2020-07-17 22:05:58,814 INFO L280 TraceCheckUtils]: 11: Hoare triple {408#true} assume ~j0~0 < 23; {408#true} is VALID [2020-07-17 22:05:58,814 INFO L280 TraceCheckUtils]: 12: Hoare triple {408#true} assume ~j0~0 < 0; {408#true} is VALID [2020-07-17 22:05:58,814 INFO L280 TraceCheckUtils]: 13: Hoare triple {408#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; {408#true} is VALID [2020-07-17 22:05:58,815 INFO L280 TraceCheckUtils]: 14: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-17 22:05:58,815 INFO L280 TraceCheckUtils]: 15: Hoare triple {408#true} #res := ~x; {408#true} is VALID [2020-07-17 22:05:58,815 INFO L280 TraceCheckUtils]: 16: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-17 22:05:58,816 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {408#true} {408#true} #164#return; {408#true} is VALID [2020-07-17 22:05:58,816 INFO L280 TraceCheckUtils]: 18: Hoare triple {408#true} ~res~0 := #t~ret18;havoc #t~ret18;call #t~mem19 := read~real(~#iptr~0.base, ~#iptr~0.offset, 4); {408#true} is VALID [2020-07-17 22:05:58,819 INFO L263 TraceCheckUtils]: 19: Hoare triple {408#true} call #t~ret20 := isinf_float(#t~mem19); {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-17 22:05:58,819 INFO L280 TraceCheckUtils]: 20: Hoare triple {432#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x;havoc ~ix~2; {408#true} is VALID [2020-07-17 22:05:58,819 INFO L280 TraceCheckUtils]: 21: Hoare triple {408#true} call ~#gf_u~4.base, ~#gf_u~4.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~4.base, ~#gf_u~4.offset, 4);call #t~mem15 := read~int(~#gf_u~4.base, ~#gf_u~4.offset, 4);~ix~2 := (if #t~mem15 % 4294967296 % 4294967296 <= 2147483647 then #t~mem15 % 4294967296 % 4294967296 else #t~mem15 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union16, ~#gf_u~4.base, ~#gf_u~4.offset, 4);havoc #t~union16;havoc #t~mem15;call ULTIMATE.dealloc(~#gf_u~4.base, ~#gf_u~4.offset);havoc ~#gf_u~4.base, ~#gf_u~4.offset; {408#true} is VALID [2020-07-17 22:05:58,820 INFO L280 TraceCheckUtils]: 22: Hoare triple {408#true} goto; {408#true} is VALID [2020-07-17 22:05:58,820 INFO L280 TraceCheckUtils]: 23: Hoare triple {408#true} ~ix~2 := ~bitwiseAnd(~ix~2, 2147483647);#res := (if 2139095040 == ~ix~2 then 1 else 0); {408#true} is VALID [2020-07-17 22:05:58,820 INFO L280 TraceCheckUtils]: 24: Hoare triple {408#true} assume true; {408#true} is VALID [2020-07-17 22:05:58,821 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {408#true} {408#true} #166#return; {408#true} is VALID [2020-07-17 22:05:58,821 INFO L280 TraceCheckUtils]: 26: Hoare triple {408#true} assume -2147483648 <= #t~ret20 && #t~ret20 <= 2147483647;#t~short23 := 0 != #t~ret20; {408#true} is VALID [2020-07-17 22:05:58,823 INFO L280 TraceCheckUtils]: 27: Hoare triple {408#true} assume !#t~short23; {430#(not |main_#t~short23|)} is VALID [2020-07-17 22:05:58,824 INFO L280 TraceCheckUtils]: 28: Hoare triple {430#(not |main_#t~short23|)} assume #t~short23;havoc #t~short23;havoc #t~short22;havoc #t~ret21;havoc #t~mem19;havoc #t~ret20; {409#false} is VALID [2020-07-17 22:05:58,824 INFO L280 TraceCheckUtils]: 29: Hoare triple {409#false} assume !false; {409#false} is VALID [2020-07-17 22:05:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:05:58,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883818024] [2020-07-17 22:05:58,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:05:58,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:05:58,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150361824] [2020-07-17 22:05:58,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-17 22:05:58,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:05:58,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:05:58,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:05:58,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:05:58,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:05:58,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:05:58,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:05:58,877 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2020-07-17 22:05:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:59,410 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2020-07-17 22:05:59,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:05:59,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-17 22:05:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:05:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:05:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2020-07-17 22:05:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:05:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2020-07-17 22:05:59,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2020-07-17 22:05:59,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:05:59,522 INFO L225 Difference]: With dead ends: 58 [2020-07-17 22:05:59,522 INFO L226 Difference]: Without dead ends: 55 [2020-07-17 22:05:59,524 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-17 22:05:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-17 22:05:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-17 22:05:59,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:05:59,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:59,586 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:59,586 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:59,591 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2020-07-17 22:05:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-17 22:05:59,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:05:59,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:05:59,592 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:59,592 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2020-07-17 22:05:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:05:59,596 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2020-07-17 22:05:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-17 22:05:59,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:05:59,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:05:59,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:05:59,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:05:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 22:05:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-17 22:05:59,602 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 30 [2020-07-17 22:05:59,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:05:59,602 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-17 22:05:59,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:05:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-17 22:05:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-17 22:05:59,604 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:05:59,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:05:59,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:05:59,605 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:05:59,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:05:59,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2060718957, now seen corresponding path program 1 times [2020-07-17 22:05:59,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:05:59,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909694718] [2020-07-17 22:05:59,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:05:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:05:59,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:05:59,743 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:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) 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.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-17 22:05:59,753 INFO L168 Benchmark]: Toolchain (without parser) took 3896.40 ms. Allocated memory was 144.7 MB in the beginning and 248.5 MB in the end (delta: 103.8 MB). Free memory was 101.5 MB in the beginning and 94.5 MB in the end (delta: 6.9 MB). Peak memory consumption was 110.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:05:59,754 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:05:59,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 426.07 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 180.0 MB in the end (delta: -79.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:05:59,757 INFO L168 Benchmark]: Boogie Preprocessor took 62.93 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 176.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:05:59,759 INFO L168 Benchmark]: RCFGBuilder took 726.58 ms. Allocated memory is still 201.9 MB. Free memory was 176.9 MB in the beginning and 130.8 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:05:59,762 INFO L168 Benchmark]: TraceAbstraction took 2673.70 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 130.1 MB in the beginning and 94.5 MB in the end (delta: 35.6 MB). Peak memory consumption was 82.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:05:59,776 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.55 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 426.07 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 180.0 MB in the end (delta: -79.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.93 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 176.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 726.58 ms. Allocated memory is still 201.9 MB. Free memory was 176.9 MB in the beginning and 130.8 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2673.70 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 130.1 MB in the beginning and 94.5 MB in the end (delta: 35.6 MB). Peak memory consumption was 82.2 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...