/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1210.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:32:50,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:32:50,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:32:50,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:32:50,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:32:50,224 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:32:50,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:32:50,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:32:50,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:32:50,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:32:50,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:32:50,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:32:50,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:32:50,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:32:50,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:32:50,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:32:50,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:32:50,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:32:50,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:32:50,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:32:50,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:32:50,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:32:50,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:32:50,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:32:50,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:32:50,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:32:50,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:32:50,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:32:50,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:32:50,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:32:50,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:32:50,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:32:50,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:32:50,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:32:50,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:32:50,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:32:50,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:32:50,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:32:50,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:32:50,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:32:50,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:32:50,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:32:50,269 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:32:50,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:32:50,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:32:50,270 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:32:50,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:32:50,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:32:50,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:32:50,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:32:50,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:32:50,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:32:50,272 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:32:50,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:32:50,272 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:32:50,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:32:50,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:32:50,273 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:32:50,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:32:50,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:32:50,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:32:50,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:32:50,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:32:50,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:32:50,274 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:32:50,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:32:50,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:32:50,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:32:50,582 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:32:50,582 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:32:50,583 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1210.c [2020-07-11 00:32:50,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191e9ac46/1743ace464f94b6f936fb11a93bf2c22/FLAGfd155b738 [2020-07-11 00:32:51,151 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:32:51,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1210.c [2020-07-11 00:32:51,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191e9ac46/1743ace464f94b6f936fb11a93bf2c22/FLAGfd155b738 [2020-07-11 00:32:51,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/191e9ac46/1743ace464f94b6f936fb11a93bf2c22 [2020-07-11 00:32:51,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:32:51,508 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:32:51,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:32:51,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:32:51,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:32:51,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:32:51" (1/1) ... [2020-07-11 00:32:51,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2498d6d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:51, skipping insertion in model container [2020-07-11 00:32:51,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:32:51" (1/1) ... [2020-07-11 00:32:51,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:32:51,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:32:51,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:32:51,850 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:32:51,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:32:52,013 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:32:52,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52 WrapperNode [2020-07-11 00:32:52,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:32:52,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:32:52,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:32:52,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:32:52,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (1/1) ... [2020-07-11 00:32:52,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:32:52,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:32:52,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:32:52,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:32:52,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (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-11 00:32:52,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:32:52,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:32:52,153 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-11 00:32:52,153 INFO L138 BoogieDeclarations]: Found implementation of procedure modf_double [2020-07-11 00:32:52,153 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:32:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:32:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-11 00:32:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure modf_double [2020-07-11 00:32:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 00:32:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-11 00:32:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 00:32:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 00:32:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 00:32:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-11 00:32:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:32:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:32:52,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:32:52,987 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:32:52,987 INFO L295 CfgBuilder]: Removed 20 assume(true) statements. [2020-07-11 00:32:52,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:32:52 BoogieIcfgContainer [2020-07-11 00:32:52,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:32:52,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:32:52,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:32:52,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:32:52,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:32:51" (1/3) ... [2020-07-11 00:32:53,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352ec26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:32:53, skipping insertion in model container [2020-07-11 00:32:53,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:32:52" (2/3) ... [2020-07-11 00:32:53,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352ec26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:32:53, skipping insertion in model container [2020-07-11 00:32:53,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:32:52" (3/3) ... [2020-07-11 00:32:53,003 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1210.c [2020-07-11 00:32:53,015 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:32:53,023 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:32:53,039 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:32:53,064 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:32:53,064 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:32:53,064 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:32:53,064 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:32:53,065 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:32:53,065 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:32:53,065 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:32:53,065 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:32:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states. [2020-07-11 00:32:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-11 00:32:53,100 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:32:53,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:32:53,102 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:32:53,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:32:53,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1596885088, now seen corresponding path program 1 times [2020-07-11 00:32:53,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:32:53,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [803588050] [2020-07-11 00:32:53,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:32:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:53,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {215#(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; {189#true} is VALID [2020-07-11 00:32:53,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#true} #valid := #valid[0 := 0]; {189#true} is VALID [2020-07-11 00:32:53,348 INFO L280 TraceCheckUtils]: 2: Hoare triple {189#true} assume 0 < #StackHeapBarrier; {189#true} is VALID [2020-07-11 00:32:53,349 INFO L280 TraceCheckUtils]: 3: Hoare triple {189#true} ~one_modf~0 := 1.0; {189#true} is VALID [2020-07-11 00:32:53,349 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-11 00:32:53,350 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {189#true} {189#true} #302#return; {189#true} is VALID [2020-07-11 00:32:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:53,424 INFO L280 TraceCheckUtils]: 0: Hoare triple {216#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {189#true} is VALID [2020-07-11 00:32:53,425 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#true} ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; {189#true} is VALID [2020-07-11 00:32:53,426 INFO L280 TraceCheckUtils]: 2: Hoare triple {189#true} havoc ~i0~0; {189#true} is VALID [2020-07-11 00:32:53,427 INFO L280 TraceCheckUtils]: 3: Hoare triple {189#true} havoc ~i1~0; {189#true} is VALID [2020-07-11 00:32:53,427 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#true} havoc ~j0~0; {189#true} is VALID [2020-07-11 00:32:53,427 INFO L280 TraceCheckUtils]: 5: Hoare triple {189#true} havoc ~i~0; {189#true} is VALID [2020-07-11 00:32:53,429 INFO L280 TraceCheckUtils]: 6: Hoare triple {189#true} assume !true; {190#false} is VALID [2020-07-11 00:32:53,429 INFO L280 TraceCheckUtils]: 7: Hoare triple {190#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; {190#false} is VALID [2020-07-11 00:32:53,429 INFO L280 TraceCheckUtils]: 8: Hoare triple {190#false} assume ~j0~0 < 20; {190#false} is VALID [2020-07-11 00:32:53,430 INFO L280 TraceCheckUtils]: 9: Hoare triple {190#false} assume ~j0~0 < 0; {190#false} is VALID [2020-07-11 00:32:53,430 INFO L280 TraceCheckUtils]: 10: Hoare triple {190#false} assume !true; {190#false} is VALID [2020-07-11 00:32:53,430 INFO L280 TraceCheckUtils]: 11: Hoare triple {190#false} #res := ~x; {190#false} is VALID [2020-07-11 00:32:53,431 INFO L280 TraceCheckUtils]: 12: Hoare triple {190#false} assume true; {190#false} is VALID [2020-07-11 00:32:53,431 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {190#false} {189#true} #306#return; {190#false} is VALID [2020-07-11 00:32:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:53,458 INFO L280 TraceCheckUtils]: 0: Hoare triple {189#true} ~x := #in~x; {189#true} is VALID [2020-07-11 00:32:53,458 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {189#true} is VALID [2020-07-11 00:32:53,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-11 00:32:53,459 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {189#true} {190#false} #308#return; {190#false} is VALID [2020-07-11 00:32:53,461 INFO L263 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {215#(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-11 00:32:53,461 INFO L280 TraceCheckUtils]: 1: Hoare triple {215#(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; {189#true} is VALID [2020-07-11 00:32:53,462 INFO L280 TraceCheckUtils]: 2: Hoare triple {189#true} #valid := #valid[0 := 0]; {189#true} is VALID [2020-07-11 00:32:53,462 INFO L280 TraceCheckUtils]: 3: Hoare triple {189#true} assume 0 < #StackHeapBarrier; {189#true} is VALID [2020-07-11 00:32:53,462 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#true} ~one_modf~0 := 1.0; {189#true} is VALID [2020-07-11 00:32:53,463 INFO L280 TraceCheckUtils]: 5: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-11 00:32:53,463 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {189#true} {189#true} #302#return; {189#true} is VALID [2020-07-11 00:32:53,464 INFO L263 TraceCheckUtils]: 7: Hoare triple {189#true} call #t~ret26 := main(); {189#true} is VALID [2020-07-11 00:32:53,464 INFO L280 TraceCheckUtils]: 8: Hoare triple {189#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {189#true} is VALID [2020-07-11 00:32:53,465 INFO L280 TraceCheckUtils]: 9: Hoare triple {189#true} SUMMARY for call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(8); srcloc: L117 {189#true} is VALID [2020-07-11 00:32:53,467 INFO L263 TraceCheckUtils]: 10: Hoare triple {189#true} call #t~ret21 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {216#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:53,467 INFO L280 TraceCheckUtils]: 11: Hoare triple {216#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {189#true} is VALID [2020-07-11 00:32:53,467 INFO L280 TraceCheckUtils]: 12: Hoare triple {189#true} ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; {189#true} is VALID [2020-07-11 00:32:53,468 INFO L280 TraceCheckUtils]: 13: Hoare triple {189#true} havoc ~i0~0; {189#true} is VALID [2020-07-11 00:32:53,468 INFO L280 TraceCheckUtils]: 14: Hoare triple {189#true} havoc ~i1~0; {189#true} is VALID [2020-07-11 00:32:53,468 INFO L280 TraceCheckUtils]: 15: Hoare triple {189#true} havoc ~j0~0; {189#true} is VALID [2020-07-11 00:32:53,469 INFO L280 TraceCheckUtils]: 16: Hoare triple {189#true} havoc ~i~0; {189#true} is VALID [2020-07-11 00:32:53,470 INFO L280 TraceCheckUtils]: 17: Hoare triple {189#true} assume !true; {190#false} is VALID [2020-07-11 00:32:53,471 INFO L280 TraceCheckUtils]: 18: Hoare triple {190#false} ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; {190#false} is VALID [2020-07-11 00:32:53,471 INFO L280 TraceCheckUtils]: 19: Hoare triple {190#false} assume ~j0~0 < 20; {190#false} is VALID [2020-07-11 00:32:53,471 INFO L280 TraceCheckUtils]: 20: Hoare triple {190#false} assume ~j0~0 < 0; {190#false} is VALID [2020-07-11 00:32:53,472 INFO L280 TraceCheckUtils]: 21: Hoare triple {190#false} assume !true; {190#false} is VALID [2020-07-11 00:32:53,472 INFO L280 TraceCheckUtils]: 22: Hoare triple {190#false} #res := ~x; {190#false} is VALID [2020-07-11 00:32:53,472 INFO L280 TraceCheckUtils]: 23: Hoare triple {190#false} assume true; {190#false} is VALID [2020-07-11 00:32:53,472 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {190#false} {189#true} #306#return; {190#false} is VALID [2020-07-11 00:32:53,473 INFO L280 TraceCheckUtils]: 25: Hoare triple {190#false} ~res~0 := #t~ret21; {190#false} is VALID [2020-07-11 00:32:53,473 INFO L280 TraceCheckUtils]: 26: Hoare triple {190#false} havoc #t~ret21; {190#false} is VALID [2020-07-11 00:32:53,473 INFO L280 TraceCheckUtils]: 27: Hoare triple {190#false} SUMMARY for call #t~mem22 := read~real(~#iptr~0.base, ~#iptr~0.offset, 8); srcloc: L121 {190#false} is VALID [2020-07-11 00:32:53,474 INFO L263 TraceCheckUtils]: 28: Hoare triple {190#false} call #t~ret23 := isnan_double(#t~mem22); {189#true} is VALID [2020-07-11 00:32:53,474 INFO L280 TraceCheckUtils]: 29: Hoare triple {189#true} ~x := #in~x; {189#true} is VALID [2020-07-11 00:32:53,474 INFO L280 TraceCheckUtils]: 30: Hoare triple {189#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {189#true} is VALID [2020-07-11 00:32:53,475 INFO L280 TraceCheckUtils]: 31: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-11 00:32:53,475 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {189#true} {190#false} #308#return; {190#false} is VALID [2020-07-11 00:32:53,475 INFO L280 TraceCheckUtils]: 33: Hoare triple {190#false} assume -2147483648 <= #t~ret23 && #t~ret23 <= 2147483647; {190#false} is VALID [2020-07-11 00:32:53,476 INFO L280 TraceCheckUtils]: 34: Hoare triple {190#false} #t~short25 := 0 != #t~ret23; {190#false} is VALID [2020-07-11 00:32:53,476 INFO L280 TraceCheckUtils]: 35: Hoare triple {190#false} assume !#t~short25; {190#false} is VALID [2020-07-11 00:32:53,476 INFO L280 TraceCheckUtils]: 36: Hoare triple {190#false} assume #t~short25; {190#false} is VALID [2020-07-11 00:32:53,477 INFO L280 TraceCheckUtils]: 37: Hoare triple {190#false} havoc #t~ret23; {190#false} is VALID [2020-07-11 00:32:53,477 INFO L280 TraceCheckUtils]: 38: Hoare triple {190#false} havoc #t~mem22; {190#false} is VALID [2020-07-11 00:32:53,477 INFO L280 TraceCheckUtils]: 39: Hoare triple {190#false} havoc #t~ret24; {190#false} is VALID [2020-07-11 00:32:53,478 INFO L280 TraceCheckUtils]: 40: Hoare triple {190#false} havoc #t~short25; {190#false} is VALID [2020-07-11 00:32:53,478 INFO L280 TraceCheckUtils]: 41: Hoare triple {190#false} assume !false; {190#false} is VALID [2020-07-11 00:32:53,483 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-11 00:32:53,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [803588050] [2020-07-11 00:32:53,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:32:53,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 00:32:53,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091590933] [2020-07-11 00:32:53,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-11 00:32:53,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:32:53,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 00:32:53,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:53,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 00:32:53,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:32:53,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 00:32:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 00:32:53,570 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 4 states. [2020-07-11 00:32:54,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:54,815 INFO L93 Difference]: Finished difference Result 352 states and 406 transitions. [2020-07-11 00:32:54,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-11 00:32:54,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-11 00:32:54,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:32:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:32:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2020-07-11 00:32:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 00:32:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2020-07-11 00:32:54,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 406 transitions. [2020-07-11 00:32:55,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:55,341 INFO L225 Difference]: With dead ends: 352 [2020-07-11 00:32:55,342 INFO L226 Difference]: Without dead ends: 172 [2020-07-11 00:32:55,347 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-11 00:32:55,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-07-11 00:32:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-07-11 00:32:55,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:32:55,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 172 states. [2020-07-11 00:32:55,528 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 172 states. [2020-07-11 00:32:55,528 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 172 states. [2020-07-11 00:32:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:55,541 INFO L93 Difference]: Finished difference Result 172 states and 178 transitions. [2020-07-11 00:32:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 178 transitions. [2020-07-11 00:32:55,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:32:55,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:32:55,544 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 172 states. [2020-07-11 00:32:55,544 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 172 states. [2020-07-11 00:32:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:55,554 INFO L93 Difference]: Finished difference Result 172 states and 178 transitions. [2020-07-11 00:32:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 178 transitions. [2020-07-11 00:32:55,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:32:55,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:32:55,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:32:55,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:32:55,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-07-11 00:32:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 178 transitions. [2020-07-11 00:32:55,567 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 178 transitions. Word has length 42 [2020-07-11 00:32:55,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:32:55,567 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 178 transitions. [2020-07-11 00:32:55,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 00:32:55,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 172 states and 178 transitions. [2020-07-11 00:32:55,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 178 transitions. [2020-07-11 00:32:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-11 00:32:55,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:32:55,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:32:55,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:32:55,767 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:32:55,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:32:55,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1781987569, now seen corresponding path program 1 times [2020-07-11 00:32:55,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:32:55,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1671707611] [2020-07-11 00:32:55,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:32:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:55,994 INFO L280 TraceCheckUtils]: 0: Hoare triple {1663#(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; {1614#true} is VALID [2020-07-11 00:32:55,994 INFO L280 TraceCheckUtils]: 1: Hoare triple {1614#true} #valid := #valid[0 := 0]; {1614#true} is VALID [2020-07-11 00:32:55,994 INFO L280 TraceCheckUtils]: 2: Hoare triple {1614#true} assume 0 < #StackHeapBarrier; {1614#true} is VALID [2020-07-11 00:32:55,995 INFO L280 TraceCheckUtils]: 3: Hoare triple {1614#true} ~one_modf~0 := 1.0; {1614#true} is VALID [2020-07-11 00:32:55,995 INFO L280 TraceCheckUtils]: 4: Hoare triple {1614#true} assume true; {1614#true} is VALID [2020-07-11 00:32:55,996 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1614#true} {1614#true} #302#return; {1614#true} is VALID [2020-07-11 00:32:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:56,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {1664#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1614#true} is VALID [2020-07-11 00:32:56,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {1614#true} ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; {1614#true} is VALID [2020-07-11 00:32:56,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {1614#true} havoc ~i0~0; {1614#true} is VALID [2020-07-11 00:32:56,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {1614#true} havoc ~i1~0; {1614#true} is VALID [2020-07-11 00:32:56,035 INFO L280 TraceCheckUtils]: 4: Hoare triple {1614#true} havoc ~j0~0; {1614#true} is VALID [2020-07-11 00:32:56,035 INFO L280 TraceCheckUtils]: 5: Hoare triple {1614#true} havoc ~i~0; {1614#true} is VALID [2020-07-11 00:32:56,036 INFO L280 TraceCheckUtils]: 6: Hoare triple {1614#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L22-2 {1614#true} is VALID [2020-07-11 00:32:56,036 INFO L280 TraceCheckUtils]: 7: Hoare triple {1614#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23 {1614#true} is VALID [2020-07-11 00:32:56,036 INFO L280 TraceCheckUtils]: 8: Hoare triple {1614#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L24 {1614#true} is VALID [2020-07-11 00:32:56,037 INFO L280 TraceCheckUtils]: 9: Hoare triple {1614#true} ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); {1614#true} is VALID [2020-07-11 00:32:56,037 INFO L280 TraceCheckUtils]: 10: Hoare triple {1614#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L25-1 {1614#true} is VALID [2020-07-11 00:32:56,037 INFO L280 TraceCheckUtils]: 11: Hoare triple {1614#true} havoc #t~mem0; {1614#true} is VALID [2020-07-11 00:32:56,037 INFO L280 TraceCheckUtils]: 12: Hoare triple {1614#true} havoc #t~union1; {1614#true} is VALID [2020-07-11 00:32:56,038 INFO L280 TraceCheckUtils]: 13: Hoare triple {1614#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L26 {1614#true} is VALID [2020-07-11 00:32:56,038 INFO L280 TraceCheckUtils]: 14: Hoare triple {1614#true} ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); {1614#true} is VALID [2020-07-11 00:32:56,038 INFO L280 TraceCheckUtils]: 15: Hoare triple {1614#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L26-2 {1614#true} is VALID [2020-07-11 00:32:56,039 INFO L280 TraceCheckUtils]: 16: Hoare triple {1614#true} havoc #t~mem2; {1614#true} is VALID [2020-07-11 00:32:56,039 INFO L280 TraceCheckUtils]: 17: Hoare triple {1614#true} havoc #t~union3; {1614#true} is VALID [2020-07-11 00:32:56,039 INFO L280 TraceCheckUtils]: 18: Hoare triple {1614#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L23-1 {1614#true} is VALID [2020-07-11 00:32:56,040 INFO L280 TraceCheckUtils]: 19: Hoare triple {1614#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1614#true} is VALID [2020-07-11 00:32:56,040 INFO L280 TraceCheckUtils]: 20: Hoare triple {1614#true} goto; {1614#true} is VALID [2020-07-11 00:32:56,040 INFO L280 TraceCheckUtils]: 21: Hoare triple {1614#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; {1614#true} is VALID [2020-07-11 00:32:56,041 INFO L280 TraceCheckUtils]: 22: Hoare triple {1614#true} assume ~j0~0 < 20; {1614#true} is VALID [2020-07-11 00:32:56,041 INFO L280 TraceCheckUtils]: 23: Hoare triple {1614#true} assume ~j0~0 < 0; {1614#true} is VALID [2020-07-11 00:32:56,042 INFO L280 TraceCheckUtils]: 24: Hoare triple {1614#true} SUMMARY for call ~#iw_u~0.base, ~#iw_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L31-2 {1614#true} is VALID [2020-07-11 00:32:56,042 INFO L280 TraceCheckUtils]: 25: Hoare triple {1614#true} SUMMARY for call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#iw_u~0.base, 4 + ~#iw_u~0.offset, 4); srcloc: L32 {1614#true} is VALID [2020-07-11 00:32:56,042 INFO L280 TraceCheckUtils]: 26: Hoare triple {1614#true} SUMMARY for call write~int(0, ~#iw_u~0.base, ~#iw_u~0.offset, 4); srcloc: L33 {1614#true} is VALID [2020-07-11 00:32:56,042 INFO L280 TraceCheckUtils]: 27: Hoare triple {1614#true} SUMMARY for call #t~mem4 := read~real(~#iw_u~0.base, ~#iw_u~0.offset, 8); srcloc: L34 {1614#true} is VALID [2020-07-11 00:32:56,043 INFO L280 TraceCheckUtils]: 28: Hoare triple {1614#true} SUMMARY for call write~real(#t~mem4, ~iptr.base, ~iptr.offset, 8); srcloc: L35 {1614#true} is VALID [2020-07-11 00:32:56,043 INFO L280 TraceCheckUtils]: 29: Hoare triple {1614#true} havoc #t~mem4; {1614#true} is VALID [2020-07-11 00:32:56,044 INFO L280 TraceCheckUtils]: 30: Hoare triple {1614#true} SUMMARY for call ULTIMATE.dealloc(~#iw_u~0.base, ~#iw_u~0.offset); srcloc: L32-1 {1614#true} is VALID [2020-07-11 00:32:56,044 INFO L280 TraceCheckUtils]: 31: Hoare triple {1614#true} havoc ~#iw_u~0.base, ~#iw_u~0.offset; {1614#true} is VALID [2020-07-11 00:32:56,044 INFO L280 TraceCheckUtils]: 32: Hoare triple {1614#true} goto; {1614#true} is VALID [2020-07-11 00:32:56,044 INFO L280 TraceCheckUtils]: 33: Hoare triple {1614#true} #res := ~x; {1614#true} is VALID [2020-07-11 00:32:56,045 INFO L280 TraceCheckUtils]: 34: Hoare triple {1614#true} assume true; {1614#true} is VALID [2020-07-11 00:32:56,045 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1614#true} {1614#true} #306#return; {1614#true} is VALID [2020-07-11 00:32:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:32:56,051 INFO L280 TraceCheckUtils]: 0: Hoare triple {1614#true} ~x := #in~x; {1614#true} is VALID [2020-07-11 00:32:56,051 INFO L280 TraceCheckUtils]: 1: Hoare triple {1614#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1614#true} is VALID [2020-07-11 00:32:56,052 INFO L280 TraceCheckUtils]: 2: Hoare triple {1614#true} assume true; {1614#true} is VALID [2020-07-11 00:32:56,052 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1614#true} {1614#true} #308#return; {1614#true} is VALID [2020-07-11 00:32:56,053 INFO L263 TraceCheckUtils]: 0: Hoare triple {1614#true} call ULTIMATE.init(); {1663#(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-11 00:32:56,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {1663#(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; {1614#true} is VALID [2020-07-11 00:32:56,054 INFO L280 TraceCheckUtils]: 2: Hoare triple {1614#true} #valid := #valid[0 := 0]; {1614#true} is VALID [2020-07-11 00:32:56,054 INFO L280 TraceCheckUtils]: 3: Hoare triple {1614#true} assume 0 < #StackHeapBarrier; {1614#true} is VALID [2020-07-11 00:32:56,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {1614#true} ~one_modf~0 := 1.0; {1614#true} is VALID [2020-07-11 00:32:56,055 INFO L280 TraceCheckUtils]: 5: Hoare triple {1614#true} assume true; {1614#true} is VALID [2020-07-11 00:32:56,055 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1614#true} {1614#true} #302#return; {1614#true} is VALID [2020-07-11 00:32:56,055 INFO L263 TraceCheckUtils]: 7: Hoare triple {1614#true} call #t~ret26 := main(); {1614#true} is VALID [2020-07-11 00:32:56,055 INFO L280 TraceCheckUtils]: 8: Hoare triple {1614#true} ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); {1614#true} is VALID [2020-07-11 00:32:56,056 INFO L280 TraceCheckUtils]: 9: Hoare triple {1614#true} SUMMARY for call ~#iptr~0.base, ~#iptr~0.offset := #Ultimate.allocOnStack(8); srcloc: L117 {1614#true} is VALID [2020-07-11 00:32:56,057 INFO L263 TraceCheckUtils]: 10: Hoare triple {1614#true} call #t~ret21 := modf_double(~x~0, ~#iptr~0.base, ~#iptr~0.offset); {1664#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-11 00:32:56,058 INFO L280 TraceCheckUtils]: 11: Hoare triple {1664#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {1614#true} is VALID [2020-07-11 00:32:56,058 INFO L280 TraceCheckUtils]: 12: Hoare triple {1614#true} ~iptr.base, ~iptr.offset := #in~iptr.base, #in~iptr.offset; {1614#true} is VALID [2020-07-11 00:32:56,058 INFO L280 TraceCheckUtils]: 13: Hoare triple {1614#true} havoc ~i0~0; {1614#true} is VALID [2020-07-11 00:32:56,059 INFO L280 TraceCheckUtils]: 14: Hoare triple {1614#true} havoc ~i1~0; {1614#true} is VALID [2020-07-11 00:32:56,059 INFO L280 TraceCheckUtils]: 15: Hoare triple {1614#true} havoc ~j0~0; {1614#true} is VALID [2020-07-11 00:32:56,059 INFO L280 TraceCheckUtils]: 16: Hoare triple {1614#true} havoc ~i~0; {1614#true} is VALID [2020-07-11 00:32:56,060 INFO L280 TraceCheckUtils]: 17: Hoare triple {1614#true} SUMMARY for call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L22-2 {1614#true} is VALID [2020-07-11 00:32:56,060 INFO L280 TraceCheckUtils]: 18: Hoare triple {1614#true} SUMMARY for call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L23 {1614#true} is VALID [2020-07-11 00:32:56,060 INFO L280 TraceCheckUtils]: 19: Hoare triple {1614#true} SUMMARY for call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); srcloc: L24 {1614#true} is VALID [2020-07-11 00:32:56,060 INFO L280 TraceCheckUtils]: 20: Hoare triple {1614#true} ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); {1614#true} is VALID [2020-07-11 00:32:56,061 INFO L280 TraceCheckUtils]: 21: Hoare triple {1614#true} SUMMARY for call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L25-1 {1614#true} is VALID [2020-07-11 00:32:56,061 INFO L280 TraceCheckUtils]: 22: Hoare triple {1614#true} havoc #t~mem0; {1614#true} is VALID [2020-07-11 00:32:56,061 INFO L280 TraceCheckUtils]: 23: Hoare triple {1614#true} havoc #t~union1; {1614#true} is VALID [2020-07-11 00:32:56,061 INFO L280 TraceCheckUtils]: 24: Hoare triple {1614#true} SUMMARY for call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); srcloc: L26 {1614#true} is VALID [2020-07-11 00:32:56,062 INFO L280 TraceCheckUtils]: 25: Hoare triple {1614#true} ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); {1614#true} is VALID [2020-07-11 00:32:56,062 INFO L280 TraceCheckUtils]: 26: Hoare triple {1614#true} SUMMARY for call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); srcloc: L26-2 {1614#true} is VALID [2020-07-11 00:32:56,062 INFO L280 TraceCheckUtils]: 27: Hoare triple {1614#true} havoc #t~mem2; {1614#true} is VALID [2020-07-11 00:32:56,063 INFO L280 TraceCheckUtils]: 28: Hoare triple {1614#true} havoc #t~union3; {1614#true} is VALID [2020-07-11 00:32:56,063 INFO L280 TraceCheckUtils]: 29: Hoare triple {1614#true} SUMMARY for call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); srcloc: L23-1 {1614#true} is VALID [2020-07-11 00:32:56,063 INFO L280 TraceCheckUtils]: 30: Hoare triple {1614#true} havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1614#true} is VALID [2020-07-11 00:32:56,063 INFO L280 TraceCheckUtils]: 31: Hoare triple {1614#true} goto; {1614#true} is VALID [2020-07-11 00:32:56,064 INFO L280 TraceCheckUtils]: 32: Hoare triple {1614#true} ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; {1614#true} is VALID [2020-07-11 00:32:56,064 INFO L280 TraceCheckUtils]: 33: Hoare triple {1614#true} assume ~j0~0 < 20; {1614#true} is VALID [2020-07-11 00:32:56,064 INFO L280 TraceCheckUtils]: 34: Hoare triple {1614#true} assume ~j0~0 < 0; {1614#true} is VALID [2020-07-11 00:32:56,064 INFO L280 TraceCheckUtils]: 35: Hoare triple {1614#true} SUMMARY for call ~#iw_u~0.base, ~#iw_u~0.offset := #Ultimate.allocOnStack(8); srcloc: L31-2 {1614#true} is VALID [2020-07-11 00:32:56,065 INFO L280 TraceCheckUtils]: 36: Hoare triple {1614#true} SUMMARY for call write~int(~bitwiseAnd(~i0~0, 2147483648), ~#iw_u~0.base, 4 + ~#iw_u~0.offset, 4); srcloc: L32 {1614#true} is VALID [2020-07-11 00:32:56,065 INFO L280 TraceCheckUtils]: 37: Hoare triple {1614#true} SUMMARY for call write~int(0, ~#iw_u~0.base, ~#iw_u~0.offset, 4); srcloc: L33 {1614#true} is VALID [2020-07-11 00:32:56,065 INFO L280 TraceCheckUtils]: 38: Hoare triple {1614#true} SUMMARY for call #t~mem4 := read~real(~#iw_u~0.base, ~#iw_u~0.offset, 8); srcloc: L34 {1614#true} is VALID [2020-07-11 00:32:56,066 INFO L280 TraceCheckUtils]: 39: Hoare triple {1614#true} SUMMARY for call write~real(#t~mem4, ~iptr.base, ~iptr.offset, 8); srcloc: L35 {1614#true} is VALID [2020-07-11 00:32:56,066 INFO L280 TraceCheckUtils]: 40: Hoare triple {1614#true} havoc #t~mem4; {1614#true} is VALID [2020-07-11 00:32:56,066 INFO L280 TraceCheckUtils]: 41: Hoare triple {1614#true} SUMMARY for call ULTIMATE.dealloc(~#iw_u~0.base, ~#iw_u~0.offset); srcloc: L32-1 {1614#true} is VALID [2020-07-11 00:32:56,066 INFO L280 TraceCheckUtils]: 42: Hoare triple {1614#true} havoc ~#iw_u~0.base, ~#iw_u~0.offset; {1614#true} is VALID [2020-07-11 00:32:56,067 INFO L280 TraceCheckUtils]: 43: Hoare triple {1614#true} goto; {1614#true} is VALID [2020-07-11 00:32:56,067 INFO L280 TraceCheckUtils]: 44: Hoare triple {1614#true} #res := ~x; {1614#true} is VALID [2020-07-11 00:32:56,067 INFO L280 TraceCheckUtils]: 45: Hoare triple {1614#true} assume true; {1614#true} is VALID [2020-07-11 00:32:56,067 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1614#true} {1614#true} #306#return; {1614#true} is VALID [2020-07-11 00:32:56,068 INFO L280 TraceCheckUtils]: 47: Hoare triple {1614#true} ~res~0 := #t~ret21; {1614#true} is VALID [2020-07-11 00:32:56,068 INFO L280 TraceCheckUtils]: 48: Hoare triple {1614#true} havoc #t~ret21; {1614#true} is VALID [2020-07-11 00:32:56,068 INFO L280 TraceCheckUtils]: 49: Hoare triple {1614#true} SUMMARY for call #t~mem22 := read~real(~#iptr~0.base, ~#iptr~0.offset, 8); srcloc: L121 {1614#true} is VALID [2020-07-11 00:32:56,069 INFO L263 TraceCheckUtils]: 50: Hoare triple {1614#true} call #t~ret23 := isnan_double(#t~mem22); {1614#true} is VALID [2020-07-11 00:32:56,069 INFO L280 TraceCheckUtils]: 51: Hoare triple {1614#true} ~x := #in~x; {1614#true} is VALID [2020-07-11 00:32:56,069 INFO L280 TraceCheckUtils]: 52: Hoare triple {1614#true} #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); {1614#true} is VALID [2020-07-11 00:32:56,069 INFO L280 TraceCheckUtils]: 53: Hoare triple {1614#true} assume true; {1614#true} is VALID [2020-07-11 00:32:56,070 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {1614#true} {1614#true} #308#return; {1614#true} is VALID [2020-07-11 00:32:56,070 INFO L280 TraceCheckUtils]: 55: Hoare triple {1614#true} assume -2147483648 <= #t~ret23 && #t~ret23 <= 2147483647; {1614#true} is VALID [2020-07-11 00:32:56,070 INFO L280 TraceCheckUtils]: 56: Hoare triple {1614#true} #t~short25 := 0 != #t~ret23; {1614#true} is VALID [2020-07-11 00:32:56,071 INFO L280 TraceCheckUtils]: 57: Hoare triple {1614#true} assume !#t~short25; {1662#(not |main_#t~short25|)} is VALID [2020-07-11 00:32:56,072 INFO L280 TraceCheckUtils]: 58: Hoare triple {1662#(not |main_#t~short25|)} assume #t~short25; {1615#false} is VALID [2020-07-11 00:32:56,072 INFO L280 TraceCheckUtils]: 59: Hoare triple {1615#false} havoc #t~ret23; {1615#false} is VALID [2020-07-11 00:32:56,072 INFO L280 TraceCheckUtils]: 60: Hoare triple {1615#false} havoc #t~mem22; {1615#false} is VALID [2020-07-11 00:32:56,073 INFO L280 TraceCheckUtils]: 61: Hoare triple {1615#false} havoc #t~ret24; {1615#false} is VALID [2020-07-11 00:32:56,073 INFO L280 TraceCheckUtils]: 62: Hoare triple {1615#false} havoc #t~short25; {1615#false} is VALID [2020-07-11 00:32:56,073 INFO L280 TraceCheckUtils]: 63: Hoare triple {1615#false} assume !false; {1615#false} is VALID [2020-07-11 00:32:56,077 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-11 00:32:56,077 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1671707611] [2020-07-11 00:32:56,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:32:56,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:32:56,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699944508] [2020-07-11 00:32:56,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2020-07-11 00:32:56,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:32:56,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:32:56,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:56,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:32:56,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:32:56,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:32:56,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:32:56,147 INFO L87 Difference]: Start difference. First operand 172 states and 178 transitions. Second operand 5 states. [2020-07-11 00:32:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:57,131 INFO L93 Difference]: Finished difference Result 179 states and 184 transitions. [2020-07-11 00:32:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:32:57,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2020-07-11 00:32:57,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:32:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:32:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2020-07-11 00:32:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:32:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2020-07-11 00:32:57,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 184 transitions. [2020-07-11 00:32:57,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:57,351 INFO L225 Difference]: With dead ends: 179 [2020-07-11 00:32:57,351 INFO L226 Difference]: Without dead ends: 172 [2020-07-11 00:32:57,353 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-11 00:32:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-07-11 00:32:57,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-07-11 00:32:57,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:32:57,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 172 states. [2020-07-11 00:32:57,483 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 172 states. [2020-07-11 00:32:57,483 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 172 states. [2020-07-11 00:32:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:57,494 INFO L93 Difference]: Finished difference Result 172 states and 177 transitions. [2020-07-11 00:32:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2020-07-11 00:32:57,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:32:57,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:32:57,496 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 172 states. [2020-07-11 00:32:57,497 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 172 states. [2020-07-11 00:32:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:32:57,505 INFO L93 Difference]: Finished difference Result 172 states and 177 transitions. [2020-07-11 00:32:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2020-07-11 00:32:57,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:32:57,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:32:57,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:32:57,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:32:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-07-11 00:32:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 177 transitions. [2020-07-11 00:32:57,515 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 177 transitions. Word has length 64 [2020-07-11 00:32:57,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:32:57,519 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 177 transitions. [2020-07-11 00:32:57,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:32:57,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 172 states and 177 transitions. [2020-07-11 00:32:57,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:32:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2020-07-11 00:32:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-07-11 00:32:57,720 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:32:57,720 INFO L422 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:32:57,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:32:57,720 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:32:57,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:32:57,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1985524025, now seen corresponding path program 1 times [2020-07-11 00:32:57,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:32:57,721 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1486665349] [2020-07-11 00:32:57,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:32:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 00:32:57,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:32:57,920 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.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.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:106) 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-11 00:32:57,928 INFO L168 Benchmark]: Toolchain (without parser) took 6418.40 ms. Allocated memory was 140.5 MB in the beginning and 312.0 MB in the end (delta: 171.4 MB). Free memory was 98.1 MB in the beginning and 276.8 MB in the end (delta: -178.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 00:32:57,929 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.5 MB. Free memory was 117.2 MB in the beginning and 117.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 00:32:57,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.62 ms. Allocated memory was 140.5 MB in the beginning and 198.7 MB in the end (delta: 58.2 MB). Free memory was 97.9 MB in the beginning and 174.6 MB in the end (delta: -76.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2020-07-11 00:32:57,935 INFO L168 Benchmark]: Boogie Preprocessor took 75.18 ms. Allocated memory is still 198.7 MB. Free memory was 174.6 MB in the beginning and 171.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:32:57,937 INFO L168 Benchmark]: RCFGBuilder took 903.30 ms. Allocated memory is still 198.7 MB. Free memory was 171.7 MB in the beginning and 97.9 MB in the end (delta: 73.8 MB). Peak memory consumption was 73.8 MB. Max. memory is 7.1 GB. [2020-07-11 00:32:57,939 INFO L168 Benchmark]: TraceAbstraction took 4929.39 ms. Allocated memory was 198.7 MB in the beginning and 312.0 MB in the end (delta: 113.2 MB). Free memory was 97.2 MB in the beginning and 276.8 MB in the end (delta: -179.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 00:32:57,952 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.25 ms. Allocated memory is still 140.5 MB. Free memory was 117.2 MB in the beginning and 117.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 504.62 ms. Allocated memory was 140.5 MB in the beginning and 198.7 MB in the end (delta: 58.2 MB). Free memory was 97.9 MB in the beginning and 174.6 MB in the end (delta: -76.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.18 ms. Allocated memory is still 198.7 MB. Free memory was 174.6 MB in the beginning and 171.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 903.30 ms. Allocated memory is still 198.7 MB. Free memory was 171.7 MB in the beginning and 97.9 MB in the end (delta: 73.8 MB). Peak memory consumption was 73.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4929.39 ms. Allocated memory was 198.7 MB in the beginning and 312.0 MB in the end (delta: 113.2 MB). Free memory was 97.2 MB in the beginning and 276.8 MB in the end (delta: -179.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...