/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1131a.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 15:53:45,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 15:53:45,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 15:53:45,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 15:53:45,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 15:53:45,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 15:53:45,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 15:53:45,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 15:53:45,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 15:53:45,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 15:53:45,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 15:53:45,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 15:53:45,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 15:53:45,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 15:53:45,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 15:53:45,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 15:53:45,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 15:53:45,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 15:53:45,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 15:53:45,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 15:53:45,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 15:53:45,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 15:53:45,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 15:53:45,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 15:53:45,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 15:53:45,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 15:53:45,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 15:53:45,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 15:53:45,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 15:53:45,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 15:53:45,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 15:53:45,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 15:53:45,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 15:53:45,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 15:53:45,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 15:53:45,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 15:53:45,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 15:53:45,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 15:53:45,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 15:53:45,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 15:53:45,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 15:53:45,219 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 15:53:45,228 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 15:53:45,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 15:53:45,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 15:53:45,230 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 15:53:45,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 15:53:45,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 15:53:45,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 15:53:45,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 15:53:45,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 15:53:45,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 15:53:45,232 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 15:53:45,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 15:53:45,232 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 15:53:45,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 15:53:45,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 15:53:45,233 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 15:53:45,233 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 15:53:45,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 15:53:45,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 15:53:45,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 15:53:45,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 15:53:45,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 15:53:45,234 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 15:53:45,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 15:53:45,528 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 15:53:45,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 15:53:45,533 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 15:53:45,533 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 15:53:45,534 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1131a.c [2020-07-08 15:53:45,602 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1812acc3b/4b85350e85524c8b8acea80efcc42560/FLAGd7afa04c6 [2020-07-08 15:53:46,103 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 15:53:46,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1131a.c [2020-07-08 15:53:46,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1812acc3b/4b85350e85524c8b8acea80efcc42560/FLAGd7afa04c6 [2020-07-08 15:53:46,437 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1812acc3b/4b85350e85524c8b8acea80efcc42560 [2020-07-08 15:53:46,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 15:53:46,448 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 15:53:46,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 15:53:46,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 15:53:46,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 15:53:46,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:53:46" (1/1) ... [2020-07-08 15:53:46,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@529854f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:46, skipping insertion in model container [2020-07-08 15:53:46,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:53:46" (1/1) ... [2020-07-08 15:53:46,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 15:53:46,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 15:53:46,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:53:46,866 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 15:53:46,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 15:53:46,987 INFO L208 MainTranslator]: Completed translation [2020-07-08 15:53:46,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:46 WrapperNode [2020-07-08 15:53:46,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 15:53:46,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 15:53:46,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 15:53:46,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 15:53:47,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:46" (1/1) ... [2020-07-08 15:53:47,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:46" (1/1) ... [2020-07-08 15:53:47,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:46" (1/1) ... [2020-07-08 15:53:47,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:46" (1/1) ... [2020-07-08 15:53:47,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:46" (1/1) ... [2020-07-08 15:53:47,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:46" (1/1) ... [2020-07-08 15:53:47,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:46" (1/1) ... [2020-07-08 15:53:47,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 15:53:47,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 15:53:47,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 15:53:47,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 15:53:47,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 15:53:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 15:53:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 15:53:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2020-07-08 15:53:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure fmod_double [2020-07-08 15:53:47,147 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_double [2020-07-08 15:53:47,147 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 15:53:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 15:53:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2020-07-08 15:53:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2020-07-08 15:53:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure fmod_double [2020-07-08 15:53:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 15:53:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-08 15:53:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 15:53:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 15:53:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-08 15:53:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 15:53:47,148 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_double [2020-07-08 15:53:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 15:53:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 15:53:47,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2020-07-08 15:53:47,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 15:53:48,166 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 15:53:48,166 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-07-08 15:53:48,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:53:48 BoogieIcfgContainer [2020-07-08 15:53:48,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 15:53:48,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 15:53:48,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 15:53:48,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 15:53:48,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 03:53:46" (1/3) ... [2020-07-08 15:53:48,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18755b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:53:48, skipping insertion in model container [2020-07-08 15:53:48,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:53:46" (2/3) ... [2020-07-08 15:53:48,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18755b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:53:48, skipping insertion in model container [2020-07-08 15:53:48,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:53:48" (3/3) ... [2020-07-08 15:53:48,184 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1131a.c [2020-07-08 15:53:48,195 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 15:53:48,204 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 15:53:48,220 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 15:53:48,244 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 15:53:48,244 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 15:53:48,245 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 15:53:48,245 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 15:53:48,245 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 15:53:48,245 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 15:53:48,246 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 15:53:48,246 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 15:53:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2020-07-08 15:53:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-08 15:53:48,298 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:53:48,299 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] [2020-07-08 15:53:48,299 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:53:48,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:53:48,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1076720203, now seen corresponding path program 1 times [2020-07-08 15:53:48,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:53:48,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [692484189] [2020-07-08 15:53:48,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:53:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:48,567 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#(and (= ~one_fmod~0 |old(~one_fmod~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#Zero_fmod~0.base| |old(~#Zero_fmod~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#Zero_fmod~0.offset| |old(~#Zero_fmod~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {219#true} is VALID [2020-07-08 15:53:48,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {219#true} #valid := #valid[0 := 0]; {219#true} is VALID [2020-07-08 15:53:48,568 INFO L280 TraceCheckUtils]: 2: Hoare triple {219#true} assume 0 < #StackHeapBarrier; {219#true} is VALID [2020-07-08 15:53:48,569 INFO L280 TraceCheckUtils]: 3: Hoare triple {219#true} ~one_fmod~0 := 1.0; {219#true} is VALID [2020-07-08 15:53:48,569 INFO L280 TraceCheckUtils]: 4: Hoare triple {219#true} SUMMARY for call ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := #Ultimate.allocOnStack(16); srcloc: L18-1 {219#true} is VALID [2020-07-08 15:53:48,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {219#true} SUMMARY for call write~init~real(0.0, ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 8); srcloc: L18-2 {219#true} is VALID [2020-07-08 15:53:48,570 INFO L280 TraceCheckUtils]: 6: Hoare triple {219#true} SUMMARY for call write~init~real(~someUnaryDOUBLEoperation(0.0), ~#Zero_fmod~0.base, 8 + ~#Zero_fmod~0.offset, 8); srcloc: L18-3 {219#true} is VALID [2020-07-08 15:53:48,570 INFO L280 TraceCheckUtils]: 7: Hoare triple {219#true} assume true; {219#true} is VALID [2020-07-08 15:53:48,571 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {219#true} {219#true} #431#return; {219#true} is VALID [2020-07-08 15:53:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:48,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {259#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {219#true} is VALID [2020-07-08 15:53:48,605 INFO L280 TraceCheckUtils]: 1: Hoare triple {219#true} havoc ~hx~1; {219#true} is VALID [2020-07-08 15:53:48,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {219#true} assume !true; {220#false} is VALID [2020-07-08 15:53:48,608 INFO L280 TraceCheckUtils]: 3: Hoare triple {220#false} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {220#false} is VALID [2020-07-08 15:53:48,609 INFO L280 TraceCheckUtils]: 4: Hoare triple {220#false} assume true; {220#false} is VALID [2020-07-08 15:53:48,609 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {220#false} {219#true} #427#return; {220#false} is VALID [2020-07-08 15:53:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 15:53:48,635 INFO L280 TraceCheckUtils]: 0: Hoare triple {259#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {219#true} is VALID [2020-07-08 15:53:48,635 INFO L280 TraceCheckUtils]: 1: Hoare triple {219#true} ~y := #in~y; {219#true} is VALID [2020-07-08 15:53:48,635 INFO L280 TraceCheckUtils]: 2: Hoare triple {219#true} havoc ~n~0; {219#true} is VALID [2020-07-08 15:53:48,636 INFO L280 TraceCheckUtils]: 3: Hoare triple {219#true} havoc ~hx~0; {219#true} is VALID [2020-07-08 15:53:48,637 INFO L280 TraceCheckUtils]: 4: Hoare triple {219#true} havoc ~hy~0; {219#true} is VALID [2020-07-08 15:53:48,637 INFO L280 TraceCheckUtils]: 5: Hoare triple {219#true} havoc ~hz~0; {219#true} is VALID [2020-07-08 15:53:48,638 INFO L280 TraceCheckUtils]: 6: Hoare triple {219#true} havoc ~ix~0; {219#true} is VALID [2020-07-08 15:53:48,639 INFO L280 TraceCheckUtils]: 7: Hoare triple {219#true} havoc ~iy~0; {219#true} is VALID [2020-07-08 15:53:48,639 INFO L280 TraceCheckUtils]: 8: Hoare triple {219#true} havoc ~sx~0; {219#true} is VALID [2020-07-08 15:53:48,639 INFO L280 TraceCheckUtils]: 9: Hoare triple {219#true} havoc ~i~0; {219#true} is VALID [2020-07-08 15:53:48,640 INFO L280 TraceCheckUtils]: 10: Hoare triple {219#true} havoc ~lx~0; {219#true} is VALID [2020-07-08 15:53:48,640 INFO L280 TraceCheckUtils]: 11: Hoare triple {219#true} havoc ~ly~0; {219#true} is VALID [2020-07-08 15:53:48,640 INFO L280 TraceCheckUtils]: 12: Hoare triple {219#true} havoc ~lz~0; {219#true} is VALID [2020-07-08 15:53:48,642 INFO L280 TraceCheckUtils]: 13: Hoare triple {219#true} assume !true; {220#false} is VALID [2020-07-08 15:53:48,642 INFO L280 TraceCheckUtils]: 14: Hoare triple {220#false} assume !true; {220#false} is VALID [2020-07-08 15:53:48,643 INFO L280 TraceCheckUtils]: 15: Hoare triple {220#false} ~sx~0 := (if ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); {220#false} is VALID [2020-07-08 15:53:48,643 INFO L280 TraceCheckUtils]: 16: Hoare triple {220#false} ~hx~0 := ~bitwiseXor(~hx~0, ~sx~0); {220#false} is VALID [2020-07-08 15:53:48,644 INFO L280 TraceCheckUtils]: 17: Hoare triple {220#false} ~hy~0 := ~bitwiseAnd(~hy~0, 2147483647); {220#false} is VALID [2020-07-08 15:53:48,644 INFO L280 TraceCheckUtils]: 18: Hoare triple {220#false} assume (0 == ~bitwiseOr(~hy~0, ~ly~0) % 4294967296 || ~hx~0 >= 2146435072) || ~bitwiseOr(~hy~0, ~bitwiseOr(~ly~0, -~ly~0) / 2147483648) % 4294967296 > 2146435072; {220#false} is VALID [2020-07-08 15:53:48,646 INFO L280 TraceCheckUtils]: 19: Hoare triple {220#false} #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~y), ~someBinaryArithmeticDOUBLEoperation(~x, ~y)); {220#false} is VALID [2020-07-08 15:53:48,646 INFO L280 TraceCheckUtils]: 20: Hoare triple {220#false} assume true; {220#false} is VALID [2020-07-08 15:53:48,647 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {220#false} {220#false} #429#return; {220#false} is VALID [2020-07-08 15:53:48,656 INFO L263 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {258#(and (= ~one_fmod~0 |old(~one_fmod~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#Zero_fmod~0.base| |old(~#Zero_fmod~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#Zero_fmod~0.offset| |old(~#Zero_fmod~0.offset)|))} is VALID [2020-07-08 15:53:48,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {258#(and (= ~one_fmod~0 |old(~one_fmod~0)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |~#Zero_fmod~0.base| |old(~#Zero_fmod~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|) (= |~#Zero_fmod~0.offset| |old(~#Zero_fmod~0.offset)|))} #NULL.base, #NULL.offset := 0, 0; {219#true} is VALID [2020-07-08 15:53:48,657 INFO L280 TraceCheckUtils]: 2: Hoare triple {219#true} #valid := #valid[0 := 0]; {219#true} is VALID [2020-07-08 15:53:48,658 INFO L280 TraceCheckUtils]: 3: Hoare triple {219#true} assume 0 < #StackHeapBarrier; {219#true} is VALID [2020-07-08 15:53:48,658 INFO L280 TraceCheckUtils]: 4: Hoare triple {219#true} ~one_fmod~0 := 1.0; {219#true} is VALID [2020-07-08 15:53:48,658 INFO L280 TraceCheckUtils]: 5: Hoare triple {219#true} SUMMARY for call ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := #Ultimate.allocOnStack(16); srcloc: L18-1 {219#true} is VALID [2020-07-08 15:53:48,659 INFO L280 TraceCheckUtils]: 6: Hoare triple {219#true} SUMMARY for call write~init~real(0.0, ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 8); srcloc: L18-2 {219#true} is VALID [2020-07-08 15:53:48,659 INFO L280 TraceCheckUtils]: 7: Hoare triple {219#true} SUMMARY for call write~init~real(~someUnaryDOUBLEoperation(0.0), ~#Zero_fmod~0.base, 8 + ~#Zero_fmod~0.offset, 8); srcloc: L18-3 {219#true} is VALID [2020-07-08 15:53:48,659 INFO L280 TraceCheckUtils]: 8: Hoare triple {219#true} assume true; {219#true} is VALID [2020-07-08 15:53:48,660 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {219#true} {219#true} #431#return; {219#true} is VALID [2020-07-08 15:53:48,660 INFO L263 TraceCheckUtils]: 10: Hoare triple {219#true} call #t~ret21 := main(); {219#true} is VALID [2020-07-08 15:53:48,660 INFO L280 TraceCheckUtils]: 11: Hoare triple {219#true} ~y~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); {219#true} is VALID [2020-07-08 15:53:48,661 INFO L280 TraceCheckUtils]: 12: Hoare triple {219#true} ~x~0 := #t~nondet18; {219#true} is VALID [2020-07-08 15:53:48,665 INFO L280 TraceCheckUtils]: 13: Hoare triple {219#true} havoc #t~nondet18; {219#true} is VALID [2020-07-08 15:53:48,668 INFO L263 TraceCheckUtils]: 14: Hoare triple {219#true} call #t~ret19 := isfinite_double(~x~0); {259#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:48,668 INFO L280 TraceCheckUtils]: 15: Hoare triple {259#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {219#true} is VALID [2020-07-08 15:53:48,669 INFO L280 TraceCheckUtils]: 16: Hoare triple {219#true} havoc ~hx~1; {219#true} is VALID [2020-07-08 15:53:48,670 INFO L280 TraceCheckUtils]: 17: Hoare triple {219#true} assume !true; {220#false} is VALID [2020-07-08 15:53:48,670 INFO L280 TraceCheckUtils]: 18: Hoare triple {220#false} #res := (if (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {220#false} is VALID [2020-07-08 15:53:48,670 INFO L280 TraceCheckUtils]: 19: Hoare triple {220#false} assume true; {220#false} is VALID [2020-07-08 15:53:48,671 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {220#false} {219#true} #427#return; {220#false} is VALID [2020-07-08 15:53:48,671 INFO L280 TraceCheckUtils]: 21: Hoare triple {220#false} assume -2147483648 <= #t~ret19 && #t~ret19 <= 2147483647; {220#false} is VALID [2020-07-08 15:53:48,671 INFO L280 TraceCheckUtils]: 22: Hoare triple {220#false} assume 0 != #t~ret19; {220#false} is VALID [2020-07-08 15:53:48,672 INFO L280 TraceCheckUtils]: 23: Hoare triple {220#false} havoc #t~ret19; {220#false} is VALID [2020-07-08 15:53:48,672 INFO L263 TraceCheckUtils]: 24: Hoare triple {220#false} call #t~ret20 := fmod_double(~x~0, ~y~0); {259#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-08 15:53:48,673 INFO L280 TraceCheckUtils]: 25: Hoare triple {259#(and (= |#memory_real| |old(#memory_real)|) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~x := #in~x; {219#true} is VALID [2020-07-08 15:53:48,673 INFO L280 TraceCheckUtils]: 26: Hoare triple {219#true} ~y := #in~y; {219#true} is VALID [2020-07-08 15:53:48,674 INFO L280 TraceCheckUtils]: 27: Hoare triple {219#true} havoc ~n~0; {219#true} is VALID [2020-07-08 15:53:48,674 INFO L280 TraceCheckUtils]: 28: Hoare triple {219#true} havoc ~hx~0; {219#true} is VALID [2020-07-08 15:53:48,674 INFO L280 TraceCheckUtils]: 29: Hoare triple {219#true} havoc ~hy~0; {219#true} is VALID [2020-07-08 15:53:48,675 INFO L280 TraceCheckUtils]: 30: Hoare triple {219#true} havoc ~hz~0; {219#true} is VALID [2020-07-08 15:53:48,675 INFO L280 TraceCheckUtils]: 31: Hoare triple {219#true} havoc ~ix~0; {219#true} is VALID [2020-07-08 15:53:48,676 INFO L280 TraceCheckUtils]: 32: Hoare triple {219#true} havoc ~iy~0; {219#true} is VALID [2020-07-08 15:53:48,676 INFO L280 TraceCheckUtils]: 33: Hoare triple {219#true} havoc ~sx~0; {219#true} is VALID [2020-07-08 15:53:48,676 INFO L280 TraceCheckUtils]: 34: Hoare triple {219#true} havoc ~i~0; {219#true} is VALID [2020-07-08 15:53:48,676 INFO L280 TraceCheckUtils]: 35: Hoare triple {219#true} havoc ~lx~0; {219#true} is VALID [2020-07-08 15:53:48,677 INFO L280 TraceCheckUtils]: 36: Hoare triple {219#true} havoc ~ly~0; {219#true} is VALID [2020-07-08 15:53:48,677 INFO L280 TraceCheckUtils]: 37: Hoare triple {219#true} havoc ~lz~0; {219#true} is VALID [2020-07-08 15:53:48,679 INFO L280 TraceCheckUtils]: 38: Hoare triple {219#true} assume !true; {220#false} is VALID [2020-07-08 15:53:48,679 INFO L280 TraceCheckUtils]: 39: Hoare triple {220#false} assume !true; {220#false} is VALID [2020-07-08 15:53:48,679 INFO L280 TraceCheckUtils]: 40: Hoare triple {220#false} ~sx~0 := (if ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~hx~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); {220#false} is VALID [2020-07-08 15:53:48,680 INFO L280 TraceCheckUtils]: 41: Hoare triple {220#false} ~hx~0 := ~bitwiseXor(~hx~0, ~sx~0); {220#false} is VALID [2020-07-08 15:53:48,680 INFO L280 TraceCheckUtils]: 42: Hoare triple {220#false} ~hy~0 := ~bitwiseAnd(~hy~0, 2147483647); {220#false} is VALID [2020-07-08 15:53:48,680 INFO L280 TraceCheckUtils]: 43: Hoare triple {220#false} assume (0 == ~bitwiseOr(~hy~0, ~ly~0) % 4294967296 || ~hx~0 >= 2146435072) || ~bitwiseOr(~hy~0, ~bitwiseOr(~ly~0, -~ly~0) / 2147483648) % 4294967296 > 2146435072; {220#false} is VALID [2020-07-08 15:53:48,681 INFO L280 TraceCheckUtils]: 44: Hoare triple {220#false} #res := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x, ~y), ~someBinaryArithmeticDOUBLEoperation(~x, ~y)); {220#false} is VALID [2020-07-08 15:53:48,681 INFO L280 TraceCheckUtils]: 45: Hoare triple {220#false} assume true; {220#false} is VALID [2020-07-08 15:53:48,681 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {220#false} {220#false} #429#return; {220#false} is VALID [2020-07-08 15:53:48,682 INFO L280 TraceCheckUtils]: 47: Hoare triple {220#false} ~res~0 := #t~ret20; {220#false} is VALID [2020-07-08 15:53:48,682 INFO L280 TraceCheckUtils]: 48: Hoare triple {220#false} havoc #t~ret20; {220#false} is VALID [2020-07-08 15:53:48,683 INFO L280 TraceCheckUtils]: 49: Hoare triple {220#false} assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); {220#false} is VALID [2020-07-08 15:53:48,683 INFO L280 TraceCheckUtils]: 50: Hoare triple {220#false} assume !false; {220#false} is VALID [2020-07-08 15:53:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 15:53:48,691 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 15:53:48,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [692484189] [2020-07-08 15:53:48,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 15:53:48,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 15:53:48,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328981121] [2020-07-08 15:53:48,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-07-08 15:53:48,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 15:53:48,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 15:53:48,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:48,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 15:53:48,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 15:53:48,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 15:53:48,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 15:53:48,838 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 4 states. [2020-07-08 15:53:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:50,356 INFO L93 Difference]: Finished difference Result 414 states and 503 transitions. [2020-07-08 15:53:50,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 15:53:50,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-07-08 15:53:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 15:53:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 15:53:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2020-07-08 15:53:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 15:53:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2020-07-08 15:53:50,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 503 transitions. [2020-07-08 15:53:50,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 503 edges. 503 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:50,970 INFO L225 Difference]: With dead ends: 414 [2020-07-08 15:53:50,970 INFO L226 Difference]: Without dead ends: 209 [2020-07-08 15:53:50,976 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-08 15:53:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-07-08 15:53:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-07-08 15:53:51,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 15:53:51,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 209 states. [2020-07-08 15:53:51,170 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 209 states. [2020-07-08 15:53:51,170 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 209 states. [2020-07-08 15:53:51,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:51,191 INFO L93 Difference]: Finished difference Result 209 states and 235 transitions. [2020-07-08 15:53:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 235 transitions. [2020-07-08 15:53:51,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:53:51,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:53:51,194 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 209 states. [2020-07-08 15:53:51,194 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 209 states. [2020-07-08 15:53:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 15:53:51,213 INFO L93 Difference]: Finished difference Result 209 states and 235 transitions. [2020-07-08 15:53:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 235 transitions. [2020-07-08 15:53:51,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 15:53:51,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 15:53:51,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 15:53:51,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 15:53:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-07-08 15:53:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 235 transitions. [2020-07-08 15:53:51,234 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 235 transitions. Word has length 51 [2020-07-08 15:53:51,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 15:53:51,234 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 235 transitions. [2020-07-08 15:53:51,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 15:53:51,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 209 states and 235 transitions. [2020-07-08 15:53:51,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 15:53:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 235 transitions. [2020-07-08 15:53:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-07-08 15:53:51,505 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 15:53:51,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 15:53:51,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 15:53:51,506 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 15:53:51,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 15:53:51,507 INFO L82 PathProgramCache]: Analyzing trace with hash -484158952, now seen corresponding path program 1 times [2020-07-08 15:53:51,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 15:53:51,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1750932173] [2020-07-08 15:53:51,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 15:53:51,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 15:53:51,660 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1012) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1159) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:214) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:96) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:100) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolantsCraigNested(Interpolator.java:146) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.Interpolator.generateInterpolants(Interpolator.java:102) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:266) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-08 15:53:51,667 INFO L168 Benchmark]: Toolchain (without parser) took 5218.09 ms. Allocated memory was 141.6 MB in the beginning and 290.5 MB in the end (delta: 148.9 MB). Free memory was 98.9 MB in the beginning and 232.2 MB in the end (delta: -133.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:51,668 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.6 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 15:53:51,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.84 ms. Allocated memory was 141.6 MB in the beginning and 200.8 MB in the end (delta: 59.2 MB). Free memory was 98.7 MB in the beginning and 175.1 MB in the end (delta: -76.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:51,670 INFO L168 Benchmark]: Boogie Preprocessor took 83.17 ms. Allocated memory is still 200.8 MB. Free memory was 174.4 MB in the beginning and 171.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:51,671 INFO L168 Benchmark]: RCFGBuilder took 1101.38 ms. Allocated memory is still 200.8 MB. Free memory was 171.1 MB in the beginning and 86.4 MB in the end (delta: 84.8 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. [2020-07-08 15:53:51,671 INFO L168 Benchmark]: TraceAbstraction took 3488.73 ms. Allocated memory was 200.8 MB in the beginning and 290.5 MB in the end (delta: 89.7 MB). Free memory was 85.6 MB in the beginning and 232.2 MB in the end (delta: -146.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 15:53:51,676 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.22 ms. Allocated memory is still 141.6 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 538.84 ms. Allocated memory was 141.6 MB in the beginning and 200.8 MB in the end (delta: 59.2 MB). Free memory was 98.7 MB in the beginning and 175.1 MB in the end (delta: -76.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.17 ms. Allocated memory is still 200.8 MB. Free memory was 174.4 MB in the beginning and 171.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1101.38 ms. Allocated memory is still 200.8 MB. Free memory was 171.1 MB in the beginning and 86.4 MB in the end (delta: 84.8 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3488.73 ms. Allocated memory was 200.8 MB in the beginning and 290.5 MB in the end (delta: 89.7 MB). Free memory was 85.6 MB in the beginning and 232.2 MB in the end (delta: -146.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...