java -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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/float-benchs/interpolation2.c.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:35:06,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:35:06,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:35:06,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:35:06,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:35:06,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:35:06,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:35:06,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:35:06,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:35:06,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:35:06,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:35:06,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:35:06,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:35:06,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:35:06,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:35:06,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:35:06,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:35:06,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:35:06,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:35:06,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:35:06,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:35:06,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:35:06,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:35:06,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:35:06,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:35:06,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:35:06,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:35:06,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:35:06,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:35:06,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:35:06,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:35:06,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:35:06,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:35:06,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:35:06,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:35:06,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:35:06,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:35:06,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:35:06,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:35:06,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:35:06,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:35:06,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 01:35:06,149 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:35:06,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:35:06,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:35:06,151 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:35:06,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:35:06,152 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:35:06,152 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:35:06,153 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:35:06,153 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:35:06,153 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:35:06,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:35:06,154 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:35:06,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:35:06,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:35:06,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:35:06,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:35:06,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:35:06,156 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:35:06,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:35:06,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:35:06,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:35:06,157 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:35:06,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:35:06,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:35:06,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:35:06,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:35:06,158 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:35:06,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:35:06,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:35:06,159 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:35:06,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:35:06,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:35:06,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:35:06,203 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:35:06,203 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:35:06,204 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/interpolation2.c.p+cfa-reducer.c [2019-09-10 01:35:06,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9476b78/fdf7d29416514304a1c6fafe6858dbd9/FLAGc784c8d0b [2019-09-10 01:35:06,750 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:35:06,750 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/interpolation2.c.p+cfa-reducer.c [2019-09-10 01:35:06,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9476b78/fdf7d29416514304a1c6fafe6858dbd9/FLAGc784c8d0b [2019-09-10 01:35:07,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9476b78/fdf7d29416514304a1c6fafe6858dbd9 [2019-09-10 01:35:07,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:35:07,100 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:35:07,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:35:07,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:35:07,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:35:07,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:35:07" (1/1) ... [2019-09-10 01:35:07,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b231241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:07, skipping insertion in model container [2019-09-10 01:35:07,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:35:07" (1/1) ... [2019-09-10 01:35:07,115 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:35:07,134 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:35:07,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:35:07,345 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:35:07,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:35:07,479 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:35:07,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:07 WrapperNode [2019-09-10 01:35:07,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:35:07,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:35:07,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:35:07,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:35:07,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:07" (1/1) ... [2019-09-10 01:35:07,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:07" (1/1) ... [2019-09-10 01:35:07,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:07" (1/1) ... [2019-09-10 01:35:07,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:07" (1/1) ... [2019-09-10 01:35:07,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:07" (1/1) ... [2019-09-10 01:35:07,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:07" (1/1) ... [2019-09-10 01:35:07,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:07" (1/1) ... [2019-09-10 01:35:07,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:35:07,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:35:07,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:35:07,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:35:07,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:07" (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 [2019-09-10 01:35:07,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:35:07,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:35:07,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:35:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:35:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2019-09-10 01:35:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 01:35:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:35:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:35:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 01:35:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-09-10 01:35:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-09-10 01:35:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 01:35:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:35:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:35:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-09-10 01:35:07,937 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:35:07,937 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 01:35:07,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:35:07 BoogieIcfgContainer [2019-09-10 01:35:07,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:35:07,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:35:07,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:35:07,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:35:07,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:35:07" (1/3) ... [2019-09-10 01:35:07,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d962ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:35:07, skipping insertion in model container [2019-09-10 01:35:07,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:07" (2/3) ... [2019-09-10 01:35:07,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d962ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:35:07, skipping insertion in model container [2019-09-10 01:35:07,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:35:07" (3/3) ... [2019-09-10 01:35:07,946 INFO L109 eAbstractionObserver]: Analyzing ICFG interpolation2.c.p+cfa-reducer.c [2019-09-10 01:35:07,954 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:35:07,960 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:35:07,975 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:35:07,999 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:35:07,999 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:35:07,999 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:35:07,999 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:35:08,000 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:35:08,000 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:35:08,000 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:35:08,000 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:35:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-10 01:35:08,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 01:35:08,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:08,020 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:35:08,022 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:08,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:08,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1066142193, now seen corresponding path program 1 times [2019-09-10 01:35:08,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:08,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:08,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:08,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:08,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:35:08,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:08,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 01:35:08,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:08,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:35:08,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:35:08,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:35:08,226 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-09-10 01:35:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:08,269 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-09-10 01:35:08,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:35:08,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-10 01:35:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:08,284 INFO L225 Difference]: With dead ends: 27 [2019-09-10 01:35:08,284 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 01:35:08,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 01:35:08,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 01:35:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-10 01:35:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 01:35:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-09-10 01:35:08,322 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 16 [2019-09-10 01:35:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:08,323 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-09-10 01:35:08,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:35:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-09-10 01:35:08,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 01:35:08,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:08,324 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:35:08,325 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:08,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:08,325 INFO L82 PathProgramCache]: Analyzing trace with hash 474733396, now seen corresponding path program 1 times [2019-09-10 01:35:08,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:08,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:08,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:08,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:08,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:08,362 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:08,362 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:08,362 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:35:08,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:08,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:35:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:08,410 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:08,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:35:08,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:08,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:35:08,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:08,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:35:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:08,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 01:35:08,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:35:08,527 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:08,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:35:08,558 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:08,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-09-10 01:35:08,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:08,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:35:08,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:35:08,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:35:08,563 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 4 states. [2019-09-10 01:35:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:08,593 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-09-10 01:35:08,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:35:08,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-10 01:35:08,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:08,595 INFO L225 Difference]: With dead ends: 21 [2019-09-10 01:35:08,595 INFO L226 Difference]: Without dead ends: 19 [2019-09-10 01:35:08,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 01:35:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-10 01:35:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-10 01:35:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-10 01:35:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-09-10 01:35:08,602 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2019-09-10 01:35:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:08,602 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-09-10 01:35:08,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:35:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-09-10 01:35:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-10 01:35:08,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:08,605 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:35:08,607 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash 489837433, now seen corresponding path program 1 times [2019-09-10 01:35:08,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:08,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:08,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:08,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:08,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:08,628 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:08,628 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:08,629 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:35:08,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:08,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:35:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:08,682 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:08,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:35:08,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:08,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:35:08,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:08,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:35:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:08,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 01:35:08,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:35:08,770 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:35:08,793 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:08,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-09-10 01:35:08,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:08,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 01:35:08,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 01:35:08,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:35:08,795 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2019-09-10 01:35:08,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:08,823 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-09-10 01:35:08,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 01:35:08,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-10 01:35:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:08,827 INFO L225 Difference]: With dead ends: 22 [2019-09-10 01:35:08,827 INFO L226 Difference]: Without dead ends: 22 [2019-09-10 01:35:08,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:35:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-10 01:35:08,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-09-10 01:35:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-10 01:35:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-09-10 01:35:08,835 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2019-09-10 01:35:08,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:08,836 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-09-10 01:35:08,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 01:35:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-09-10 01:35:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:35:08,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:08,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:35:08,838 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:08,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:08,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1570839537, now seen corresponding path program 1 times [2019-09-10 01:35:08,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:08,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:08,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:08,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:08,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:08,861 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:08,861 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:08,861 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 01:35:08,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:08,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:35:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:08,905 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:08,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:35:08,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:08,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:35:08,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:08,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:35:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:08,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 01:35:08,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:09,193 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:35:09,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 85 [2019-09-10 01:35:09,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,208 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-10 01:35:09,283 INFO L567 ElimStorePlain]: treesize reduction 18, result has 79.3 percent of original size [2019-09-10 01:35:09,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-09-10 01:35:09,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:127 [2019-09-10 01:35:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:35:09,350 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:09,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_8 Real)) (or (not (<= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0))))) (/ (* (+ c_main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0))) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0)) .cse1))))) v_main_~main__z~0_8)) (<= 0.0 (+ v_main_~main__z~0_8 10.0)))) is different from false [2019-09-10 01:35:09,368 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_8 Real)) (or (not (<= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0))))) (/ (* (+ c_main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0))) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0)) .cse1))))) v_main_~main__z~0_8)) (<= 0.0 (+ v_main_~main__z~0_8 10.0)))) is different from true [2019-09-10 01:35:09,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_8 Real)) (or (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) |c_main_~#main__org~0.offset|) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) |c_main_~#main__min~0.offset|)))) (/ (* (+ c_main_~main__t~0 .cse0) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) |c_main_~#main__slope~0.offset|)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) |c_main_~#main__max~0.offset|) .cse0)))) v_main_~main__z~0_8)) (<= 0.0 (+ v_main_~main__z~0_8 10.0)))) is different from false [2019-09-10 01:35:09,380 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_8 Real)) (or (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) |c_main_~#main__org~0.offset|) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) |c_main_~#main__min~0.offset|)))) (/ (* (+ c_main_~main__t~0 .cse0) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) |c_main_~#main__slope~0.offset|)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) |c_main_~#main__max~0.offset|) .cse0)))) v_main_~main__z~0_8)) (<= 0.0 (+ v_main_~main__z~0_8 10.0)))) is different from true [2019-09-10 01:35:09,387 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_8 Real)) (or (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) |c_main_~#main__org~0.offset|) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) |c_main_~#main__min~0.offset|)))) (/ (* (+ main_~main__t~0 .cse0) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) |c_main_~#main__slope~0.offset|)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) |c_main_~#main__max~0.offset|) .cse0)))) v_main_~main__z~0_8)) (< main_~main__t~0 |c_main_#t~mem1|) (<= 0.0 (+ v_main_~main__z~0_8 10.0)))) is different from false [2019-09-10 01:35:09,389 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_8 Real)) (or (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) |c_main_~#main__org~0.offset|) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) |c_main_~#main__min~0.offset|)))) (/ (* (+ main_~main__t~0 .cse0) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) |c_main_~#main__slope~0.offset|)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) |c_main_~#main__max~0.offset|) .cse0)))) v_main_~main__z~0_8)) (< main_~main__t~0 |c_main_#t~mem1|) (<= 0.0 (+ v_main_~main__z~0_8 10.0)))) is different from true [2019-09-10 01:35:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:35:09,412 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:09,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-09-10 01:35:09,413 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:09,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:35:09,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:35:09,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=29, Unknown=6, NotChecked=36, Total=90 [2019-09-10 01:35:09,414 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2019-09-10 01:35:09,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:09,581 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-09-10 01:35:09,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:35:09,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-10 01:35:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:09,582 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:35:09,582 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 01:35:09,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=47, Unknown=6, NotChecked=48, Total=132 [2019-09-10 01:35:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 01:35:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2019-09-10 01:35:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 01:35:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-10 01:35:09,587 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2019-09-10 01:35:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:09,587 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-10 01:35:09,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:35:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-10 01:35:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:35:09,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:09,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:35:09,589 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:09,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:09,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1911033608, now seen corresponding path program 1 times [2019-09-10 01:35:09,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:09,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:09,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:09,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:09,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:09,603 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:09,604 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:09,604 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 01:35:09,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:09,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:35:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:09,643 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:09,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 01:35:09,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:09,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:35:09,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:09,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:35:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:09,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 01:35:09,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:09,868 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:35:09,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 85 [2019-09-10 01:35:09,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:09,883 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-10 01:35:09,940 INFO L567 ElimStorePlain]: treesize reduction 33, result has 62.1 percent of original size [2019-09-10 01:35:09,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-10 01:35:09,942 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:30 [2019-09-10 01:35:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:35:09,969 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:09,989 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_10 Real)) (or (not (>= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0))))) (/ (* (+ c_main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0))) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0)) .cse1))))) v_main_~main__z~0_10)) (<= v_main_~main__z~0_10 30.0))) is different from false [2019-09-10 01:35:09,992 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_10 Real)) (or (not (>= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0))))) (/ (* (+ c_main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0))) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0)) .cse1))))) v_main_~main__z~0_10)) (<= v_main_~main__z~0_10 30.0))) is different from true [2019-09-10 01:35:09,999 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_10 Real)) (or (not (>= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0))))) (/ (* (+ main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0))) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0)) .cse1))))) v_main_~main__z~0_10)) (< |c_main_#t~mem3| main_~main__t~0) (<= v_main_~main__z~0_10 30.0))) is different from false [2019-09-10 01:35:10,002 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_10 Real)) (or (not (>= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0))))) (/ (* (+ main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0))) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0)) .cse1))))) v_main_~main__z~0_10)) (< |c_main_#t~mem3| main_~main__t~0) (<= v_main_~main__z~0_10 30.0))) is different from true [2019-09-10 01:35:10,010 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_10 Real)) (let ((.cse0 (* 4 c_main_~main__i~0))) (let ((.cse2 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0)))) (or (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0))))) (/ (* (+ main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0))) (+ .cse2 .cse1)))) v_main_~main__z~0_10)) (< .cse2 main_~main__t~0) (<= v_main_~main__z~0_10 30.0))))) is different from false [2019-09-10 01:35:10,013 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_10 Real)) (let ((.cse0 (* 4 c_main_~main__i~0))) (let ((.cse2 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0)))) (or (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0))))) (/ (* (+ main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0))) (+ .cse2 .cse1)))) v_main_~main__z~0_10)) (< .cse2 main_~main__t~0) (<= v_main_~main__z~0_10 30.0))))) is different from true [2019-09-10 01:35:10,020 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_10 Real)) (let ((.cse1 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) |c_main_~#main__max~0.offset|))) (or (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) |c_main_~#main__org~0.offset|) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) |c_main_~#main__min~0.offset|)))) (/ (* (+ main_~main__t~0 .cse0) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) |c_main_~#main__slope~0.offset|)) (+ .cse1 .cse0)))) v_main_~main__z~0_10)) (< .cse1 main_~main__t~0) (<= v_main_~main__z~0_10 30.0)))) is different from false [2019-09-10 01:35:10,022 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_10 Real)) (let ((.cse1 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) |c_main_~#main__max~0.offset|))) (or (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) |c_main_~#main__org~0.offset|) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) |c_main_~#main__min~0.offset|)))) (/ (* (+ main_~main__t~0 .cse0) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) |c_main_~#main__slope~0.offset|)) (+ .cse1 .cse0)))) v_main_~main__z~0_10)) (< .cse1 main_~main__t~0) (<= v_main_~main__z~0_10 30.0)))) is different from true [2019-09-10 01:35:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 01:35:10,059 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:10,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-09-10 01:35:10,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:10,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:35:10,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:35:10,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=37, Unknown=8, NotChecked=60, Total=132 [2019-09-10 01:35:10,060 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 7 states. [2019-09-10 01:35:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:10,199 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-09-10 01:35:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:35:10,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-10 01:35:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:10,201 INFO L225 Difference]: With dead ends: 29 [2019-09-10 01:35:10,201 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 01:35:10,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=58, Unknown=8, NotChecked=76, Total=182 [2019-09-10 01:35:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 01:35:10,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2019-09-10 01:35:10,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 01:35:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-10 01:35:10,207 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2019-09-10 01:35:10,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:10,207 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-10 01:35:10,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:35:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-10 01:35:10,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:35:10,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:10,208 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:35:10,208 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:10,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1625546753, now seen corresponding path program 1 times [2019-09-10 01:35:10,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:10,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:10,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:10,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:10,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:10,243 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:10,244 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:10,244 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:35:10,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:10,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:35:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:10,282 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2019-09-10 01:35:10,284 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [15], [19], [24], [32], [35], [36], [41], [43], [45], [47], [57], [58], [59] [2019-09-10 01:35:10,340 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:35:10,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:35:10,426 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 01:35:10,427 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 18 root evaluator evaluations with a maximum evaluation depth of 0. Performed 18 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 38 variables. [2019-09-10 01:35:10,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:10,431 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 01:35:10,473 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-09-10 01:35:10,473 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 01:35:10,475 INFO L420 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2019-09-10 01:35:10,475 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 01:35:10,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:10,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 01:35:10,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:10,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 01:35:10,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 01:35:10,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:35:10,477 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 2 states. [2019-09-10 01:35:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:10,481 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-09-10 01:35:10,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 01:35:10,482 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-09-10 01:35:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:10,483 INFO L225 Difference]: With dead ends: 6 [2019-09-10 01:35:10,483 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:35:10,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:35:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:35:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:35:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:35:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:35:10,485 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-09-10 01:35:10,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:10,485 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:35:10,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 01:35:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:35:10,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:35:10,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:35:10 BoogieIcfgContainer [2019-09-10 01:35:10,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:35:10,494 INFO L168 Benchmark]: Toolchain (without parser) took 3392.95 ms. Allocated memory was 135.3 MB in the beginning and 252.2 MB in the end (delta: 116.9 MB). Free memory was 90.8 MB in the beginning and 189.7 MB in the end (delta: -98.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. [2019-09-10 01:35:10,496 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 135.3 MB. Free memory was 109.9 MB in the beginning and 109.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-10 01:35:10,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.09 ms. Allocated memory was 135.3 MB in the beginning and 201.3 MB in the end (delta: 66.1 MB). Free memory was 90.3 MB in the beginning and 176.5 MB in the end (delta: -86.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2019-09-10 01:35:10,503 INFO L168 Benchmark]: Boogie Preprocessor took 40.01 ms. Allocated memory is still 201.3 MB. Free memory was 176.5 MB in the beginning and 174.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-10 01:35:10,504 INFO L168 Benchmark]: RCFGBuilder took 417.72 ms. Allocated memory is still 201.3 MB. Free memory was 174.7 MB in the beginning and 157.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. [2019-09-10 01:35:10,505 INFO L168 Benchmark]: TraceAbstraction took 2552.33 ms. Allocated memory was 201.3 MB in the beginning and 252.2 MB in the end (delta: 50.9 MB). Free memory was 157.3 MB in the beginning and 189.7 MB in the end (delta: -32.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2019-09-10 01:35:10,517 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 135.3 MB. Free memory was 109.9 MB in the beginning and 109.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 379.09 ms. Allocated memory was 135.3 MB in the beginning and 201.3 MB in the end (delta: 66.1 MB). Free memory was 90.3 MB in the beginning and 176.5 MB in the end (delta: -86.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.01 ms. Allocated memory is still 201.3 MB. Free memory was 176.5 MB in the beginning and 174.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 417.72 ms. Allocated memory is still 201.3 MB. Free memory was 174.7 MB in the beginning and 157.3 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2552.33 ms. Allocated memory was 201.3 MB in the beginning and 252.2 MB in the end (delta: 50.9 MB). Free memory was 157.3 MB in the beginning and 189.7 MB in the end (delta: -32.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 101 SDtfs, 64 SDslu, 155 SDs, 0 SdLazy, 77 SolverSat, 7 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.8725490196078431 AbsIntWeakeningRatio, 1.7647058823529411 AbsIntAvgWeakeningVarsNumRemoved, 0.6470588235294118 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 141 ConstructedInterpolants, 15 QuantifiedInterpolants, 25273 SizeOfPredicates, 32 NumberOfNonLiveVariables, 500 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...