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.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:35:20,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:35:20,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:35:20,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:35:20,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:35:20,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:35:20,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:35:20,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:35:20,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:35:20,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:35:20,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:35:20,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:35:20,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:35:20,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:35:20,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:35:20,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:35:20,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:35:20,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:35:20,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:35:20,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:35:20,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:35:20,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:35:20,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:35:20,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:35:20,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:35:20,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:35:20,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:35:20,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:35:20,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:35:20,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:35:20,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:35:20,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:35:20,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:35:20,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:35:20,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:35:20,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:35:20,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:35:20,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:35:20,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:35:20,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:35:20,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:35:20,231 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:20,254 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:35:20,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:35:20,255 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:35:20,256 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:35:20,256 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:35:20,256 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:35:20,257 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:35:20,257 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:35:20,257 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:35:20,257 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:35:20,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:35:20,259 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:35:20,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:35:20,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:35:20,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:35:20,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:35:20,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:35:20,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:35:20,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:35:20,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:35:20,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:35:20,262 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:35:20,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:35:20,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:35:20,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:35:20,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:35:20,263 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:35:20,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:35:20,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:35:20,263 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:35:20,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:35:20,328 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:35:20,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:35:20,334 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:35:20,334 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:35:20,335 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/interpolation2.c.v+nlh-reducer.c [2019-09-10 01:35:20,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3a676a5/3fd8c1d98820437fac5bb8d0ffef44be/FLAG1c3c87349 [2019-09-10 01:35:20,836 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:35:20,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/interpolation2.c.v+nlh-reducer.c [2019-09-10 01:35:20,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3a676a5/3fd8c1d98820437fac5bb8d0ffef44be/FLAG1c3c87349 [2019-09-10 01:35:21,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3a676a5/3fd8c1d98820437fac5bb8d0ffef44be [2019-09-10 01:35:21,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:35:21,243 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:35:21,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:35:21,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:35:21,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:35:21,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:35:21" (1/1) ... [2019-09-10 01:35:21,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398d81ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:21, skipping insertion in model container [2019-09-10 01:35:21,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:35:21" (1/1) ... [2019-09-10 01:35:21,257 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:35:21,278 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:35:21,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:35:21,455 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:35:21,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:35:21,601 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:35:21,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:21 WrapperNode [2019-09-10 01:35:21,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:35:21,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:35:21,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:35:21,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:35:21,612 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:21" (1/1) ... [2019-09-10 01:35:21,612 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:21" (1/1) ... [2019-09-10 01:35:21,621 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:21" (1/1) ... [2019-09-10 01:35:21,622 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:21" (1/1) ... [2019-09-10 01:35:21,636 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:21" (1/1) ... [2019-09-10 01:35:21,639 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:21" (1/1) ... [2019-09-10 01:35:21,642 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:21" (1/1) ... [2019-09-10 01:35:21,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:35:21,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:35:21,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:35:21,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:35:21,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:21" (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:21,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:35:21,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:35:21,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:35:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:35:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2019-09-10 01:35:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 01:35:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:35:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:35:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 01:35:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-09-10 01:35:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-09-10 01:35:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 01:35:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:35:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:35:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-09-10 01:35:22,046 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:35:22,047 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 01:35:22,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:35:22 BoogieIcfgContainer [2019-09-10 01:35:22,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:35:22,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:35:22,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:35:22,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:35:22,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:35:21" (1/3) ... [2019-09-10 01:35:22,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5790600b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:35:22, skipping insertion in model container [2019-09-10 01:35:22,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:35:21" (2/3) ... [2019-09-10 01:35:22,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5790600b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:35:22, skipping insertion in model container [2019-09-10 01:35:22,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:35:22" (3/3) ... [2019-09-10 01:35:22,056 INFO L109 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+nlh-reducer.c [2019-09-10 01:35:22,079 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:35:22,093 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:35:22,118 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:35:22,140 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:35:22,140 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:35:22,140 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:35:22,140 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:35:22,140 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:35:22,140 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:35:22,140 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:35:22,141 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:35:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-09-10 01:35:22,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:35:22,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:22,162 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:22,164 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:22,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:22,169 INFO L82 PathProgramCache]: Analyzing trace with hash -938213152, now seen corresponding path program 1 times [2019-09-10 01:35:22,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:22,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:22,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:22,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:22,282 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:22,282 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:22,282 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:22,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:22,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:35:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:22,334 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:22,336 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:22,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:22,336 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:22,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:22,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:35:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:22,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 01:35:22,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:22,468 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:22,469 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:22,499 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:22,504 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:22,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-09-10 01:35:22,504 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:22,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:35:22,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:35:22,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:35:22,526 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2019-09-10 01:35:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:22,585 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2019-09-10 01:35:22,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:35:22,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-10 01:35:22,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:22,598 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:35:22,598 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 01:35:22,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 01:35:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-10 01:35:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:35:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-09-10 01:35:22,637 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2019-09-10 01:35:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:22,638 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-09-10 01:35:22,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:35:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-09-10 01:35:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:35:22,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:22,639 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:22,640 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:22,641 INFO L82 PathProgramCache]: Analyzing trace with hash -923109115, now seen corresponding path program 1 times [2019-09-10 01:35:22,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:22,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:22,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:22,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:22,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:22,676 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:22,676 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:22,676 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:22,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:22,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:35:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:22,722 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:22,722 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:22,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:22,723 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) [2019-09-10 01:35:22,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:22,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:35:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:22,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 01:35:22,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:23,034 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:35:23,035 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:23,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,060 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:23,156 INFO L567 ElimStorePlain]: treesize reduction 18, result has 79.3 percent of original size [2019-09-10 01:35:23,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,172 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:23,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:127 [2019-09-10 01:35:23,243 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:23,243 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:23,262 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_7 Real)) (or (<= 0.0 (+ v_main_~main__z~0_7 10.0)) (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_7)))) is different from false [2019-09-10 01:35:23,264 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_7 Real)) (or (<= 0.0 (+ v_main_~main__z~0_7 10.0)) (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_7)))) is different from true [2019-09-10 01:35:23,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_7 Real)) (or (<= 0.0 (+ v_main_~main__z~0_7 10.0)) (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_7)))) is different from false [2019-09-10 01:35:23,276 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_7 Real)) (or (<= 0.0 (+ v_main_~main__z~0_7 10.0)) (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_7)))) is different from true [2019-09-10 01:35:23,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_7 Real) (main_~main__t~0 Real)) (or (<= 0.0 (+ v_main_~main__z~0_7 10.0)) (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_7)) (< main_~main__t~0 |c_main_#t~mem1|))) is different from false [2019-09-10 01:35:23,285 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_7 Real) (main_~main__t~0 Real)) (or (<= 0.0 (+ v_main_~main__z~0_7 10.0)) (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_7)) (< main_~main__t~0 |c_main_#t~mem1|))) is different from true [2019-09-10 01:35:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 01:35:23,306 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:23,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-09-10 01:35:23,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:23,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:35:23,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:35:23,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=29, Unknown=6, NotChecked=36, Total=90 [2019-09-10 01:35:23,308 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 6 states. [2019-09-10 01:35:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:23,540 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-09-10 01:35:23,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:35:23,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-10 01:35:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:23,542 INFO L225 Difference]: With dead ends: 39 [2019-09-10 01:35:23,543 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 01:35:23,544 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:23,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 01:35:23,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-09-10 01:35:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:35:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-09-10 01:35:23,549 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 17 [2019-09-10 01:35:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:23,550 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-09-10 01:35:23,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:35:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-09-10 01:35:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:35:23,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:23,551 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:23,552 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:23,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:23,552 INFO L82 PathProgramCache]: Analyzing trace with hash 988740288, now seen corresponding path program 1 times [2019-09-10 01:35:23,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:23,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:23,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:23,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:23,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:23,580 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:23,580 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:23,581 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:23,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:23,599 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:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:23,614 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:23,614 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:23,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:23,614 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:35:23,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:23,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:35:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:23,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 01:35:23,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:23,840 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:35:23,841 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:23,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:23,851 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:23,905 INFO L567 ElimStorePlain]: treesize reduction 33, result has 62.1 percent of original size [2019-09-10 01:35:23,907 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:23,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:30 [2019-09-10 01:35:23,932 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:23,932 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:23,952 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_9 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_9)) (<= v_main_~main__z~0_9 30.0))) is different from false [2019-09-10 01:35:23,954 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_9 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_9)) (<= v_main_~main__z~0_9 30.0))) is different from true [2019-09-10 01:35:23,959 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_9 Real)) (or (< |c_main_#t~mem3| main_~main__t~0) (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_9)) (<= v_main_~main__z~0_9 30.0))) is different from false [2019-09-10 01:35:23,961 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_9 Real)) (or (< |c_main_#t~mem3| main_~main__t~0) (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_9)) (<= v_main_~main__z~0_9 30.0))) is different from true [2019-09-10 01:35:23,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_9 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_9)) (< .cse2 main_~main__t~0) (<= v_main_~main__z~0_9 30.0))))) is different from false [2019-09-10 01:35:23,970 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_9 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_9)) (< .cse2 main_~main__t~0) (<= v_main_~main__z~0_9 30.0))))) is different from true [2019-09-10 01:35:23,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_9 Real)) (let ((.cse0 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) |c_main_~#main__max~0.offset|))) (or (< .cse0 main_~main__t~0) (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) |c_main_~#main__org~0.offset|) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) |c_main_~#main__min~0.offset|)))) (/ (* (+ main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) |c_main_~#main__slope~0.offset|)) (+ .cse0 .cse1)))) v_main_~main__z~0_9)) (<= v_main_~main__z~0_9 30.0)))) is different from false [2019-09-10 01:35:23,979 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_9 Real)) (let ((.cse0 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) |c_main_~#main__max~0.offset|))) (or (< .cse0 main_~main__t~0) (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) |c_main_~#main__org~0.offset|) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) |c_main_~#main__min~0.offset|)))) (/ (* (+ main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) |c_main_~#main__slope~0.offset|)) (+ .cse0 .cse1)))) v_main_~main__z~0_9)) (<= v_main_~main__z~0_9 30.0)))) is different from true [2019-09-10 01:35:23,997 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:24,003 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:24,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-09-10 01:35:24,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:24,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:35:24,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:35:24,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=37, Unknown=8, NotChecked=60, Total=132 [2019-09-10 01:35:24,005 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 7 states. [2019-09-10 01:35:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:24,226 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-10 01:35:24,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:35:24,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-10 01:35:24,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:24,227 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:35:24,228 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 01:35:24,228 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:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 01:35:24,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-09-10 01:35:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:35:24,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-10 01:35:24,232 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 18 [2019-09-10 01:35:24,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:24,232 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-10 01:35:24,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:35:24,233 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-10 01:35:24,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 01:35:24,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:24,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:35:24,234 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:24,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash 240100127, now seen corresponding path program 1 times [2019-09-10 01:35:24,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:24,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:24,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:24,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:24,251 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:24,252 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:24,252 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:35:24,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:24,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:35:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:24,286 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:24,286 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:24,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:24,287 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:35:24,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:24,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:35:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:24,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-10 01:35:24,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:24,543 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:35:24,543 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:24,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:24,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:24,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:24,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:24,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:24,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:24,560 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:24,618 INFO L567 ElimStorePlain]: treesize reduction 23, result has 73.6 percent of original size [2019-09-10 01:35:24,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:24,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:24,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-09-10 01:35:24,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:95 [2019-09-10 01:35:24,670 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:24,670 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:24,686 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_11 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_11)) (<= 0.0 (+ v_main_~main__z~0_11 10.0)))) is different from false [2019-09-10 01:35:24,688 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_11 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_11)) (<= 0.0 (+ v_main_~main__z~0_11 10.0)))) is different from true [2019-09-10 01:35:24,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_11 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_11)) (< |c_main_#t~mem9| main_~main__t~0) (<= 0.0 (+ v_main_~main__z~0_11 10.0)))) is different from false [2019-09-10 01:35:24,695 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_11 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_11)) (< |c_main_#t~mem9| main_~main__t~0) (<= 0.0 (+ v_main_~main__z~0_11 10.0)))) is different from true [2019-09-10 01:35:24,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_11 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_11)) (< .cse2 main_~main__t~0) (<= 0.0 (+ v_main_~main__z~0_11 10.0)))))) is different from false [2019-09-10 01:35:24,703 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_11 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_11)) (< .cse2 main_~main__t~0) (<= 0.0 (+ v_main_~main__z~0_11 10.0)))))) is different from true [2019-09-10 01:35:24,709 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_11 Real)) (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1 4)))) (or (< .cse0 main_~main__t~0) (not (<= (+ (let ((.cse2 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse1 4)) (+ main_~main__t~0 .cse2)) (+ .cse0 .cse2))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse1 4))) v_main_~main__z~0_11)) (<= 0.0 (+ v_main_~main__z~0_11 10.0)))))) is different from false [2019-09-10 01:35:24,711 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_11 Real)) (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1 4)))) (or (< .cse0 main_~main__t~0) (not (<= (+ (let ((.cse2 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse1 4)) (+ main_~main__t~0 .cse2)) (+ .cse0 .cse2))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse1 4))) v_main_~main__z~0_11)) (<= 0.0 (+ v_main_~main__z~0_11 10.0)))))) is different from true [2019-09-10 01:35:24,719 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_11 Real)) (let ((.cse0 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| 4)))) (or (< .cse0 main_~main__t~0) (<= 0.0 (+ v_main_~main__z~0_11 10.0)) (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 4)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 4))))) (/ (* (+ .cse1 main_~main__t~0) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 4))) (+ .cse1 .cse0)))) v_main_~main__z~0_11))))) is different from false [2019-09-10 01:35:24,721 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_11 Real)) (let ((.cse0 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| 4)))) (or (< .cse0 main_~main__t~0) (<= 0.0 (+ v_main_~main__z~0_11 10.0)) (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 4)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 4))))) (/ (* (+ .cse1 main_~main__t~0) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 4))) (+ .cse1 .cse0)))) v_main_~main__z~0_11))))) is different from true [2019-09-10 01:35:24,737 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:24,741 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:24,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-09-10 01:35:24,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:24,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:35:24,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:35:24,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=49, Unknown=10, NotChecked=90, Total=182 [2019-09-10 01:35:24,743 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 8 states. [2019-09-10 01:35:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:24,922 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-09-10 01:35:24,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:35:24,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-09-10 01:35:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:24,923 INFO L225 Difference]: With dead ends: 39 [2019-09-10 01:35:24,924 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 01:35:24,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=74, Unknown=10, NotChecked=110, Total=240 [2019-09-10 01:35:24,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 01:35:24,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-09-10 01:35:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:35:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-10 01:35:24,928 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2019-09-10 01:35:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:24,929 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-10 01:35:24,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:35:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-10 01:35:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:35:24,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:24,930 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:35:24,930 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:24,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:24,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1606478874, now seen corresponding path program 1 times [2019-09-10 01:35:24,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:24,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:24,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:24,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:24,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:24,946 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:24,947 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:24,947 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) [2019-09-10 01:35:24,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:24,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:35:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:24,976 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:24,977 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:24,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:24,977 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:35:25,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:25,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:35:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:25,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 01:35:25,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:25,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:35:25,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 89 [2019-09-10 01:35:25,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,222 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:25,267 INFO L567 ElimStorePlain]: treesize reduction 28, result has 67.8 percent of original size [2019-09-10 01:35:25,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-09-10 01:35:25,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:85, output treesize:63 [2019-09-10 01:35:25,315 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:25,315 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:25,331 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_13 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_13)) (<= v_main_~main__z~0_13 30.0))) is different from false [2019-09-10 01:35:25,333 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_13 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_13)) (<= v_main_~main__z~0_13 30.0))) is different from true [2019-09-10 01:35:25,340 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_13 Real)) (or (not (>= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 4)) (+ main_~main__t~0 .cse1)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 4)) .cse1))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 4)))) v_main_~main__z~0_13)) (<= v_main_~main__z~0_13 30.0) (<= main_~main__t~0 |c_main_#t~mem3|))) is different from false [2019-09-10 01:35:25,342 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_13 Real)) (or (not (>= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 4)) (+ main_~main__t~0 .cse1)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 4)) .cse1))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 4)))) v_main_~main__z~0_13)) (<= v_main_~main__z~0_13 30.0) (<= main_~main__t~0 |c_main_#t~mem3|))) is different from true [2019-09-10 01:35:25,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_13 Real)) (let ((.cse0 (select |c_#memory_real| |c_main_~#main__max~0.base|)) (.cse1 (* 4 c_main_~main__i~0))) (or (<= main_~main__t~0 (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1))) (not (>= (+ (let ((.cse2 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse1 4)) (+ main_~main__t~0 .cse2)) (+ (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1 4)) .cse2))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse1 4))) v_main_~main__z~0_13)) (<= v_main_~main__z~0_13 30.0)))) is different from false [2019-09-10 01:35:25,349 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_13 Real)) (let ((.cse0 (select |c_#memory_real| |c_main_~#main__max~0.base|)) (.cse1 (* 4 c_main_~main__i~0))) (or (<= main_~main__t~0 (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1))) (not (>= (+ (let ((.cse2 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse1 4)) (+ main_~main__t~0 .cse2)) (+ (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1 4)) .cse2))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse1 4))) v_main_~main__z~0_13)) (<= v_main_~main__z~0_13 30.0)))) is different from true [2019-09-10 01:35:25,355 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_13 Real)) (let ((.cse0 (select |c_#memory_real| |c_main_~#main__max~0.base|))) (or (<= v_main_~main__z~0_13 30.0) (<= main_~main__t~0 (select .cse0 |c_main_~#main__max~0.offset|)) (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 4)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 4))))) (/ (* (+ .cse1 main_~main__t~0) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 4))) (+ .cse1 (select .cse0 (+ |c_main_~#main__max~0.offset| 4)))))) v_main_~main__z~0_13))))) is different from false [2019-09-10 01:35:25,357 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_13 Real)) (let ((.cse0 (select |c_#memory_real| |c_main_~#main__max~0.base|))) (or (<= v_main_~main__z~0_13 30.0) (<= main_~main__t~0 (select .cse0 |c_main_~#main__max~0.offset|)) (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 4)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 4))))) (/ (* (+ .cse1 main_~main__t~0) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 4))) (+ .cse1 (select .cse0 (+ |c_main_~#main__max~0.offset| 4)))))) v_main_~main__z~0_13))))) is different from true [2019-09-10 01:35:25,371 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:25,375 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:25,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-09-10 01:35:25,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:25,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:35:25,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:35:25,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=38, Unknown=8, NotChecked=60, Total=132 [2019-09-10 01:35:25,377 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2019-09-10 01:35:25,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:25,552 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-10 01:35:25,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:35:25,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-09-10 01:35:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:25,553 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:35:25,554 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 01:35:25,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=60, Unknown=8, NotChecked=76, Total=182 [2019-09-10 01:35:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 01:35:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-09-10 01:35:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:35:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-09-10 01:35:25,558 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2019-09-10 01:35:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:25,558 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-09-10 01:35:25,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:35:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-09-10 01:35:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:35:25,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:25,559 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:35:25,559 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:25,560 INFO L82 PathProgramCache]: Analyzing trace with hash 262198436, now seen corresponding path program 1 times [2019-09-10 01:35:25,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:25,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:25,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:25,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:25,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:25,577 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:25,577 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:25,577 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:35:25,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:25,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:35:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:25,619 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:25,620 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:25,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:25,620 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:35:25,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:25,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:35:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:25,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-10 01:35:25,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:25,869 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:35:25,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 89 [2019-09-10 01:35:25,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,876 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:25,935 INFO L567 ElimStorePlain]: treesize reduction 18, result has 79.3 percent of original size [2019-09-10 01:35:25,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:25,942 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:25,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:85, output treesize:127 [2019-09-10 01:35:26,013 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:26,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:26,029 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_15 Real)) (or (<= 0.0 (+ v_main_~main__z~0_15 10.0)) (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_15)))) is different from false [2019-09-10 01:35:26,030 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_15 Real)) (or (<= 0.0 (+ v_main_~main__z~0_15 10.0)) (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_15)))) is different from true [2019-09-10 01:35:26,038 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_15 Real)) (or (not (<= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 4)) (+ main_~main__t~0 .cse1)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 4)) .cse1))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 4)))) v_main_~main__z~0_15)) (<= 0.0 (+ v_main_~main__z~0_15 10.0)) (<= main_~main__t~0 |c_main_#t~mem9|))) is different from false [2019-09-10 01:35:26,040 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_15 Real)) (or (not (<= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 4)) (+ main_~main__t~0 .cse1)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 4)) .cse1))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 4)))) v_main_~main__z~0_15)) (<= 0.0 (+ v_main_~main__z~0_15 10.0)) (<= main_~main__t~0 |c_main_#t~mem9|))) is different from true [2019-09-10 01:35:26,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_15 Real)) (let ((.cse0 (select |c_#memory_real| |c_main_~#main__max~0.base|)) (.cse1 (* 4 c_main_~main__i~0))) (or (<= main_~main__t~0 (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1))) (not (<= (+ (let ((.cse2 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse1 4)) (+ main_~main__t~0 .cse2)) (+ (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1 4)) .cse2))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse1 4))) v_main_~main__z~0_15)) (<= 0.0 (+ v_main_~main__z~0_15 10.0))))) is different from false [2019-09-10 01:35:26,046 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_15 Real)) (let ((.cse0 (select |c_#memory_real| |c_main_~#main__max~0.base|)) (.cse1 (* 4 c_main_~main__i~0))) (or (<= main_~main__t~0 (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1))) (not (<= (+ (let ((.cse2 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse1 4)) (+ main_~main__t~0 .cse2)) (+ (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1 4)) .cse2))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse1 4))) v_main_~main__z~0_15)) (<= 0.0 (+ v_main_~main__z~0_15 10.0))))) is different from true [2019-09-10 01:35:26,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_15 Real)) (let ((.cse2 (select |c_#memory_real| |c_main_~#main__max~0.base|)) (.cse0 (* 4 c_main_~main__i~0))) (or (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 8)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 8))))) (/ (* (+ main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 8))) (+ (select .cse2 (+ |c_main_~#main__max~0.offset| .cse0 8)) .cse1)))) v_main_~main__z~0_15)) (<= 0.0 (+ v_main_~main__z~0_15 10.0)) (<= main_~main__t~0 (select .cse2 (+ |c_main_~#main__max~0.offset| .cse0 4)))))) is different from false [2019-09-10 01:35:26,053 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_15 Real)) (let ((.cse2 (select |c_#memory_real| |c_main_~#main__max~0.base|)) (.cse0 (* 4 c_main_~main__i~0))) (or (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 8)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 8))))) (/ (* (+ main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 8))) (+ (select .cse2 (+ |c_main_~#main__max~0.offset| .cse0 8)) .cse1)))) v_main_~main__z~0_15)) (<= 0.0 (+ v_main_~main__z~0_15 10.0)) (<= main_~main__t~0 (select .cse2 (+ |c_main_~#main__max~0.offset| .cse0 4)))))) is different from true [2019-09-10 01:35:26,059 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_15 Real)) (let ((.cse1 (select |c_#memory_real| |c_main_~#main__max~0.base|))) (or (not (<= (+ (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 8))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 8)) (+ .cse0 main_~main__t~0)) (+ .cse0 (select .cse1 (+ |c_main_~#main__max~0.offset| 8))))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 8))) v_main_~main__z~0_15)) (<= main_~main__t~0 (select .cse1 (+ |c_main_~#main__max~0.offset| 4))) (<= 0.0 (+ v_main_~main__z~0_15 10.0))))) is different from false [2019-09-10 01:35:26,061 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_15 Real)) (let ((.cse1 (select |c_#memory_real| |c_main_~#main__max~0.base|))) (or (not (<= (+ (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 8))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 8)) (+ .cse0 main_~main__t~0)) (+ .cse0 (select .cse1 (+ |c_main_~#main__max~0.offset| 8))))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 8))) v_main_~main__z~0_15)) (<= main_~main__t~0 (select .cse1 (+ |c_main_~#main__max~0.offset| 4))) (<= 0.0 (+ v_main_~main__z~0_15 10.0))))) is different from true [2019-09-10 01:35:26,073 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:26,077 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:26,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-09-10 01:35:26,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:26,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:35:26,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:35:26,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=51, Unknown=10, NotChecked=90, Total=182 [2019-09-10 01:35:26,081 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 8 states. [2019-09-10 01:35:26,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:26,323 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-09-10 01:35:26,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:35:26,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-09-10 01:35:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:26,324 INFO L225 Difference]: With dead ends: 40 [2019-09-10 01:35:26,325 INFO L226 Difference]: Without dead ends: 40 [2019-09-10 01:35:26,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=77, Unknown=10, NotChecked=110, Total=240 [2019-09-10 01:35:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-10 01:35:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-09-10 01:35:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:35:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-09-10 01:35:26,329 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 21 [2019-09-10 01:35:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:26,329 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-09-10 01:35:26,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:35:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-09-10 01:35:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:35:26,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:26,330 INFO L399 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] [2019-09-10 01:35:26,330 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:26,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:26,331 INFO L82 PathProgramCache]: Analyzing trace with hash -921431295, now seen corresponding path program 1 times [2019-09-10 01:35:26,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:26,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:26,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:26,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:26,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:26,345 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:26,346 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:26,346 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:35:26,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:26,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:35:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:26,383 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:26,384 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:26,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:26,384 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:35:26,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:26,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:35:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:26,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 01:35:26,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:26,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:35:26,617 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:26,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:26,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:26,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:26,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:26,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:26,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:26,622 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:26,671 INFO L567 ElimStorePlain]: treesize reduction 33, result has 62.1 percent of original size [2019-09-10 01:35:26,672 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:26,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:30 [2019-09-10 01:35:26,710 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:26,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:26,730 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_17 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_17)) (<= v_main_~main__z~0_17 30.0))) is different from false [2019-09-10 01:35:26,732 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_17 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_17)) (<= v_main_~main__z~0_17 30.0))) is different from true [2019-09-10 01:35:26,736 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 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_17)) (< |c_main_#t~mem10| main_~main__t~0) (<= v_main_~main__z~0_17 30.0))) is different from false [2019-09-10 01:35:26,738 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 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_17)) (< |c_main_#t~mem10| main_~main__t~0) (<= v_main_~main__z~0_17 30.0))) is different from true [2019-09-10 01:35:26,743 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 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_17)) (< .cse2 main_~main__t~0) (<= v_main_~main__z~0_17 30.0))))) is different from false [2019-09-10 01:35:26,745 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 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_17)) (< .cse2 main_~main__t~0) (<= v_main_~main__z~0_17 30.0))))) is different from true [2019-09-10 01:35:26,749 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 Real)) (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1 4)))) (or (< .cse0 main_~main__t~0) (not (>= (+ (let ((.cse2 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse1 4)) (+ main_~main__t~0 .cse2)) (+ .cse0 .cse2))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse1 4))) v_main_~main__z~0_17)) (<= v_main_~main__z~0_17 30.0))))) is different from false [2019-09-10 01:35:26,751 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 Real)) (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1 4)))) (or (< .cse0 main_~main__t~0) (not (>= (+ (let ((.cse2 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse1 4)) (+ main_~main__t~0 .cse2)) (+ .cse0 .cse2))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse1 4))) v_main_~main__z~0_17)) (<= v_main_~main__z~0_17 30.0))))) is different from true [2019-09-10 01:35:26,759 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 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 8)))) (or (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 8)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 8))))) (/ (* (+ main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 8))) (+ .cse2 .cse1)))) v_main_~main__z~0_17)) (< .cse2 main_~main__t~0) (<= v_main_~main__z~0_17 30.0))))) is different from false [2019-09-10 01:35:26,761 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 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 8)))) (or (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 8)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 8))))) (/ (* (+ main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 8))) (+ .cse2 .cse1)))) v_main_~main__z~0_17)) (< .cse2 main_~main__t~0) (<= v_main_~main__z~0_17 30.0))))) is different from true [2019-09-10 01:35:26,766 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 Real)) (let ((.cse1 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| 8)))) (or (not (>= (+ (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 8))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 8)) (+ .cse0 main_~main__t~0)) (+ .cse0 .cse1))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 8))) v_main_~main__z~0_17)) (<= v_main_~main__z~0_17 30.0) (< .cse1 main_~main__t~0)))) is different from false [2019-09-10 01:35:26,768 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 Real)) (let ((.cse1 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| 8)))) (or (not (>= (+ (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 8))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 8)) (+ .cse0 main_~main__t~0)) (+ .cse0 .cse1))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 8))) v_main_~main__z~0_17)) (<= v_main_~main__z~0_17 30.0) (< .cse1 main_~main__t~0)))) is different from true [2019-09-10 01:35:26,780 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:26,784 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:26,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-09-10 01:35:26,784 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:26,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:35:26,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:35:26,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=64, Unknown=12, NotChecked=126, Total=240 [2019-09-10 01:35:26,786 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 9 states. [2019-09-10 01:35:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:26,984 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-09-10 01:35:26,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 01:35:26,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-10 01:35:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:26,989 INFO L225 Difference]: With dead ends: 35 [2019-09-10 01:35:26,989 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 01:35:26,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=93, Unknown=12, NotChecked=150, Total=306 [2019-09-10 01:35:26,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 01:35:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-09-10 01:35:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:35:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-10 01:35:26,993 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2019-09-10 01:35:26,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:26,993 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-10 01:35:26,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:35:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-10 01:35:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 01:35:26,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:26,994 INFO L399 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] [2019-09-10 01:35:26,994 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:26,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1121242992, now seen corresponding path program 1 times [2019-09-10 01:35:26,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:26,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:26,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:26,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:26,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:27,009 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:27,010 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:27,010 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 01:35:27,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:27,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:35:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:27,048 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:27,048 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:27,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:27,048 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:35:27,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:27,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:35:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:27,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 01:35:27,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:27,159 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:27,159 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:27,243 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:27,248 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:27,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-09-10 01:35:27,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:27,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:35:27,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:35:27,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:35:27,249 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2019-09-10 01:35:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:27,302 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-10 01:35:27,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:35:27,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-10 01:35:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:27,306 INFO L225 Difference]: With dead ends: 31 [2019-09-10 01:35:27,306 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 01:35:27,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:35:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 01:35:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-09-10 01:35:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:35:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-10 01:35:27,309 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-09-10 01:35:27,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:27,310 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-10 01:35:27,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:35:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-10 01:35:27,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 01:35:27,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:27,311 INFO L399 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] [2019-09-10 01:35:27,311 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:27,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:27,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1027553552, now seen corresponding path program 1 times [2019-09-10 01:35:27,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:27,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:27,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:27,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:27,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:27,328 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:27,328 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:27,328 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:35:27,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:27,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:35:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:27,378 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:27,378 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:27,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:27,379 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:35:27,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:27,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:35:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:27,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 01:35:27,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:27,740 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:35:27,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 89 [2019-09-10 01:35:27,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:27,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:27,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:27,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:27,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:27,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:27,751 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:27,815 INFO L567 ElimStorePlain]: treesize reduction 23, result has 73.6 percent of original size [2019-09-10 01:35:27,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:27,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:27,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-09-10 01:35:27,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:85, output treesize:90 [2019-09-10 01:35:27,862 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:27,862 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:27,874 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_20 Real)) (or (<= 0.0 (+ v_main_~main__z~0_20 10.0)) (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_20)))) is different from false [2019-09-10 01:35:27,875 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_20 Real)) (or (<= 0.0 (+ v_main_~main__z~0_20 10.0)) (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_20)))) is different from true [2019-09-10 01:35:27,881 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_20 Real)) (or (not (<= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 4)) (+ c_main_~main__t~0 .cse1)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 4)) .cse1))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 4)))) v_main_~main__z~0_20)) (<= 0.0 (+ v_main_~main__z~0_20 10.0)))) is different from false [2019-09-10 01:35:27,883 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_20 Real)) (or (not (<= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 4)) (+ c_main_~main__t~0 .cse1)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 4)) .cse1))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 4)))) v_main_~main__z~0_20)) (<= 0.0 (+ v_main_~main__z~0_20 10.0)))) is different from true [2019-09-10 01:35:27,894 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_20 Real)) (or (<= 0.0 (+ v_main_~main__z~0_20 10.0)) (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 8)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 8))))) (/ (* (+ c_main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 8))) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 8)) .cse1))))) v_main_~main__z~0_20)))) is different from false [2019-09-10 01:35:27,900 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_20 Real)) (or (<= 0.0 (+ v_main_~main__z~0_20 10.0)) (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 8)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 8))))) (/ (* (+ c_main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 8))) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 8)) .cse1))))) v_main_~main__z~0_20)))) is different from true [2019-09-10 01:35:27,906 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_20 Real)) (or (<= 0.0 (+ v_main_~main__z~0_20 10.0)) (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 12)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 12))))) (/ (* (+ c_main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 12))) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 12)) .cse1))))) v_main_~main__z~0_20)))) is different from false [2019-09-10 01:35:27,911 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_20 Real)) (or (<= 0.0 (+ v_main_~main__z~0_20 10.0)) (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 12)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 12))))) (/ (* (+ c_main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 12))) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 12)) .cse1))))) v_main_~main__z~0_20)))) is different from true [2019-09-10 01:35:27,917 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_20 Real)) (or (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 12)) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 12))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 12)) (+ c_main_~main__t~0 .cse0)) (+ .cse0 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| 12)))))) v_main_~main__z~0_20)) (<= 0.0 (+ v_main_~main__z~0_20 10.0)))) is different from false [2019-09-10 01:35:27,918 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_20 Real)) (or (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 12)) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 12))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 12)) (+ c_main_~main__t~0 .cse0)) (+ .cse0 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| 12)))))) v_main_~main__z~0_20)) (<= 0.0 (+ v_main_~main__z~0_20 10.0)))) is different from true [2019-09-10 01:35:27,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_20 Real)) (or (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 12)) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 12))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 12)) (+ main_~main__t~0 .cse0)) (+ .cse0 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| 12)))))) v_main_~main__z~0_20)) (<= 0.0 (+ v_main_~main__z~0_20 10.0)) (< |c_main_#t~mem2| main_~main__t~0))) is different from false [2019-09-10 01:35:27,923 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_20 Real)) (or (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 12)) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 12))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 12)) (+ main_~main__t~0 .cse0)) (+ .cse0 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| 12)))))) v_main_~main__z~0_20)) (<= 0.0 (+ v_main_~main__z~0_20 10.0)) (< |c_main_#t~mem2| main_~main__t~0))) is different from true [2019-09-10 01:35:27,931 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_20 Real)) (let ((.cse1 (select |c_#memory_real| |c_main_~#main__max~0.base|))) (or (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 12)) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 12))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 12)) (+ main_~main__t~0 .cse0)) (+ .cse0 (select .cse1 (+ |c_main_~#main__max~0.offset| 12)))))) v_main_~main__z~0_20)) (<= 0.0 (+ v_main_~main__z~0_20 10.0)) (< (select .cse1 (+ |c_main_~#main__max~0.offset| 16)) main_~main__t~0)))) is different from false [2019-09-10 01:35:27,933 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_20 Real)) (let ((.cse1 (select |c_#memory_real| |c_main_~#main__max~0.base|))) (or (not (<= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 12)) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 12))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 12)) (+ main_~main__t~0 .cse0)) (+ .cse0 (select .cse1 (+ |c_main_~#main__max~0.offset| 12)))))) v_main_~main__z~0_20)) (<= 0.0 (+ v_main_~main__z~0_20 10.0)) (< (select .cse1 (+ |c_main_~#main__max~0.offset| 16)) main_~main__t~0)))) is different from true [2019-09-10 01:35:27,944 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:27,949 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:27,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 18 [2019-09-10 01:35:27,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:27,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 01:35:27,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 01:35:27,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=80, Unknown=14, NotChecked=168, Total=306 [2019-09-10 01:35:27,951 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 10 states. [2019-09-10 01:35:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:28,221 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-09-10 01:35:28,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:35:28,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-10 01:35:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:28,222 INFO L225 Difference]: With dead ends: 43 [2019-09-10 01:35:28,222 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 01:35:28,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=113, Unknown=14, NotChecked=196, Total=380 [2019-09-10 01:35:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 01:35:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-09-10 01:35:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 01:35:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-10 01:35:28,226 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 24 [2019-09-10 01:35:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:28,226 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-10 01:35:28,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 01:35:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-10 01:35:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 01:35:28,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:28,228 INFO L399 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] [2019-09-10 01:35:28,228 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:28,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1329740821, now seen corresponding path program 1 times [2019-09-10 01:35:28,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:28,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:28,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:28,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:28,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:28,240 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:28,241 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:28,241 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-10 01:35:28,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:28,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:35:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:28,292 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:35:28,293 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:28,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:35:28,293 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:35:28,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:28,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:35:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:28,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 01:35:28,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:35:28,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:35:28,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 89 [2019-09-10 01:35:28,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:28,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:28,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:28,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:28,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:28,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:28,623 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:28,688 INFO L567 ElimStorePlain]: treesize reduction 23, result has 73.6 percent of original size [2019-09-10 01:35:28,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:28,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 01:35:28,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-09-10 01:35:28,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:85, output treesize:90 [2019-09-10 01:35:28,747 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:28,748 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:35:28,768 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_22 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_22)) (<= v_main_~main__z~0_22 30.0))) is different from false [2019-09-10 01:35:28,770 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_22 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_22)) (<= v_main_~main__z~0_22 30.0))) is different from true [2019-09-10 01:35:28,775 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_22 Real)) (or (not (>= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 4)) (+ c_main_~main__t~0 .cse1)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 4)) .cse1))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 4)))) v_main_~main__z~0_22)) (<= v_main_~main__z~0_22 30.0))) is different from false [2019-09-10 01:35:28,777 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_22 Real)) (or (not (>= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 4)) (+ c_main_~main__t~0 .cse1)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 4)) .cse1))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 4)))) v_main_~main__z~0_22)) (<= v_main_~main__z~0_22 30.0))) is different from true [2019-09-10 01:35:28,781 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (or (not (>= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 4)) (+ main_~main__t~0 .cse1)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 4)) .cse1))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 4)))) v_main_~main__z~0_22)) (<= v_main_~main__z~0_22 30.0) (<= main_~main__t~0 |c_main_#t~mem10|))) is different from false [2019-09-10 01:35:28,783 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (or (not (>= (let ((.cse0 (* 4 c_main_~main__i~0))) (+ (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 4)) (+ main_~main__t~0 .cse1)) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse0 4)) .cse1))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 4)))) v_main_~main__z~0_22)) (<= v_main_~main__z~0_22 30.0) (<= main_~main__t~0 |c_main_#t~mem10|))) is different from true [2019-09-10 01:35:28,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (let ((.cse0 (select |c_#memory_real| |c_main_~#main__max~0.base|)) (.cse1 (* 4 c_main_~main__i~0))) (or (<= main_~main__t~0 (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1))) (not (>= (+ (let ((.cse2 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse1 4)) (+ main_~main__t~0 .cse2)) (+ (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1 4)) .cse2))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse1 4))) v_main_~main__z~0_22)) (<= v_main_~main__z~0_22 30.0)))) is different from false [2019-09-10 01:35:28,794 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (let ((.cse0 (select |c_#memory_real| |c_main_~#main__max~0.base|)) (.cse1 (* 4 c_main_~main__i~0))) (or (<= main_~main__t~0 (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1))) (not (>= (+ (let ((.cse2 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse1 4)) (+ main_~main__t~0 .cse2)) (+ (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1 4)) .cse2))) (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse1 4))) v_main_~main__z~0_22)) (<= v_main_~main__z~0_22 30.0)))) is different from true [2019-09-10 01:35:28,799 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (let ((.cse2 (select |c_#memory_real| |c_main_~#main__max~0.base|)) (.cse0 (* 4 c_main_~main__i~0))) (or (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 8)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 8))))) (/ (* (+ main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 8))) (+ (select .cse2 (+ |c_main_~#main__max~0.offset| .cse0 8)) .cse1)))) v_main_~main__z~0_22)) (<= v_main_~main__z~0_22 30.0) (<= main_~main__t~0 (select .cse2 (+ |c_main_~#main__max~0.offset| .cse0 4)))))) is different from false [2019-09-10 01:35:28,801 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (let ((.cse2 (select |c_#memory_real| |c_main_~#main__max~0.base|)) (.cse0 (* 4 c_main_~main__i~0))) (or (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse0 8)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse0 8))))) (/ (* (+ main_~main__t~0 .cse1) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse0 8))) (+ (select .cse2 (+ |c_main_~#main__max~0.offset| .cse0 8)) .cse1)))) v_main_~main__z~0_22)) (<= v_main_~main__z~0_22 30.0) (<= main_~main__t~0 (select .cse2 (+ |c_main_~#main__max~0.offset| .cse0 4)))))) is different from true [2019-09-10 01:35:28,807 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (let ((.cse0 (select |c_#memory_real| |c_main_~#main__max~0.base|)) (.cse1 (* 4 c_main_~main__i~0))) (or (<= main_~main__t~0 (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1 8))) (<= v_main_~main__z~0_22 30.0) (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse1 12)) (let ((.cse2 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 12))))) (/ (* (+ main_~main__t~0 .cse2) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse1 12))) (+ (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1 12)) .cse2)))) v_main_~main__z~0_22))))) is different from false [2019-09-10 01:35:28,809 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (let ((.cse0 (select |c_#memory_real| |c_main_~#main__max~0.base|)) (.cse1 (* 4 c_main_~main__i~0))) (or (<= main_~main__t~0 (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1 8))) (<= v_main_~main__z~0_22 30.0) (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| .cse1 12)) (let ((.cse2 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 12))))) (/ (* (+ main_~main__t~0 .cse2) (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| .cse1 12))) (+ (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1 12)) .cse2)))) v_main_~main__z~0_22))))) is different from true [2019-09-10 01:35:28,815 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (let ((.cse0 (select |c_#memory_real| |c_main_~#main__max~0.base|))) (or (<= main_~main__t~0 (select .cse0 (+ |c_main_~#main__max~0.offset| 8))) (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 12)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 12))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 12)) (+ main_~main__t~0 .cse1)) (+ .cse1 (select .cse0 (+ |c_main_~#main__max~0.offset| 12)))))) v_main_~main__z~0_22)) (<= v_main_~main__z~0_22 30.0)))) is different from false [2019-09-10 01:35:28,817 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (let ((.cse0 (select |c_#memory_real| |c_main_~#main__max~0.base|))) (or (<= main_~main__t~0 (select .cse0 (+ |c_main_~#main__max~0.offset| 8))) (not (>= (+ (select (select |c_#memory_real| |c_main_~#main__org~0.base|) (+ |c_main_~#main__org~0.offset| 12)) (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 12))))) (/ (* (select (select |c_#memory_real| |c_main_~#main__slope~0.base|) (+ |c_main_~#main__slope~0.offset| 12)) (+ main_~main__t~0 .cse1)) (+ .cse1 (select .cse0 (+ |c_main_~#main__max~0.offset| 12)))))) v_main_~main__z~0_22)) (<= v_main_~main__z~0_22 30.0)))) is different from true [2019-09-10 01:35:28,840 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:28,844 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:28,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 18 [2019-09-10 01:35:28,844 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:28,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 01:35:28,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 01:35:28,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=82, Unknown=14, NotChecked=168, Total=306 [2019-09-10 01:35:28,846 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 10 states. [2019-09-10 01:35:29,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:29,131 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-09-10 01:35:29,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:35:29,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-09-10 01:35:29,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:29,132 INFO L225 Difference]: With dead ends: 38 [2019-09-10 01:35:29,132 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 01:35:29,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=116, Unknown=14, NotChecked=196, Total=380 [2019-09-10 01:35:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 01:35:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-09-10 01:35:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 01:35:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-09-10 01:35:29,136 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2019-09-10 01:35:29,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:29,136 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-09-10 01:35:29,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 01:35:29,136 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-09-10 01:35:29,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:35:29,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:35:29,137 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 01:35:29,137 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:35:29,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:29,138 INFO L82 PathProgramCache]: Analyzing trace with hash -54384132, now seen corresponding path program 1 times [2019-09-10 01:35:29,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:35:29,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:29,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:29,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:35:29,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:35:29,152 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:35:29,152 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:35:29,152 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:35:29,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:35:29,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:35:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:35:29,186 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2019-09-10 01:35:29,188 INFO L207 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [22], [30], [33], [34], [39], [41], [43], [46], [51], [54], [59], [61], [64], [69], [71], [80], [81], [82] [2019-09-10 01:35:29,225 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:35:29,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:35:29,280 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 01:35:29,284 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 21 root evaluator evaluations with a maximum evaluation depth of 0. Performed 21 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 43 variables. [2019-09-10 01:35:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:35:29,289 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 01:35:29,319 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-09-10 01:35:29,319 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 01:35:29,321 INFO L420 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2019-09-10 01:35:29,321 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 01:35:29,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:35:29,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 01:35:29,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:35:29,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 01:35:29,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 01:35:29,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:35:29,323 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 2 states. [2019-09-10 01:35:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:35:29,324 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-09-10 01:35:29,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 01:35:29,324 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2019-09-10 01:35:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:35:29,324 INFO L225 Difference]: With dead ends: 6 [2019-09-10 01:35:29,324 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:35:29,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 25 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:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:35:29,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:35:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:35:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:35:29,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-09-10 01:35:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:35:29,326 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:35:29,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 01:35:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:35:29,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:35:29,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:35:29 BoogieIcfgContainer [2019-09-10 01:35:29,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:35:29,333 INFO L168 Benchmark]: Toolchain (without parser) took 8090.15 ms. Allocated memory was 134.7 MB in the beginning and 322.4 MB in the end (delta: 187.7 MB). Free memory was 90.5 MB in the beginning and 240.5 MB in the end (delta: -150.0 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. [2019-09-10 01:35:29,334 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-10 01:35:29,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.32 ms. Allocated memory was 134.7 MB in the beginning and 200.8 MB in the end (delta: 66.1 MB). Free memory was 90.1 MB in the beginning and 176.2 MB in the end (delta: -86.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-09-10 01:35:29,335 INFO L168 Benchmark]: Boogie Preprocessor took 42.61 ms. Allocated memory is still 200.8 MB. Free memory was 176.2 MB in the beginning and 173.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-10 01:35:29,336 INFO L168 Benchmark]: RCFGBuilder took 403.47 ms. Allocated memory is still 200.8 MB. Free memory was 173.6 MB in the beginning and 153.6 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2019-09-10 01:35:29,337 INFO L168 Benchmark]: TraceAbstraction took 7282.07 ms. Allocated memory was 200.8 MB in the beginning and 322.4 MB in the end (delta: 121.6 MB). Free memory was 152.8 MB in the beginning and 240.5 MB in the end (delta: -87.8 MB). Peak memory consumption was 33.9 MB. Max. memory is 7.1 GB. [2019-09-10 01:35:29,343 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.21 ms. Allocated memory is still 134.7 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 358.32 ms. Allocated memory was 134.7 MB in the beginning and 200.8 MB in the end (delta: 66.1 MB). Free memory was 90.1 MB in the beginning and 176.2 MB in the end (delta: -86.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.61 ms. Allocated memory is still 200.8 MB. Free memory was 176.2 MB in the beginning and 173.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 403.47 ms. Allocated memory is still 200.8 MB. Free memory was 173.6 MB in the beginning and 153.6 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7282.07 ms. Allocated memory was 200.8 MB in the beginning and 322.4 MB in the end (delta: 121.6 MB). Free memory was 152.8 MB in the beginning and 240.5 MB in the end (delta: -87.8 MB). Peak memory consumption was 33.9 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, 30 locations, 1 error locations. SAFE Result, 7.1s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 203 SDtfs, 321 SDslu, 588 SDs, 0 SdLazy, 638 SolverSat, 40 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 317 SyntacticMatches, 2 SemanticMatches, 125 ConstructedPredicates, 41 IntricatePredicates, 2 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=9, 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.935 AbsIntWeakeningRatio, 1.36 AbsIntAvgWeakeningVarsNumRemoved, 0.64 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 71 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 438 NumberOfCodeBlocks, 438 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 392 ConstructedInterpolants, 86 QuantifiedInterpolants, 214491 SizeOfPredicates, 116 NumberOfNonLiveVariables, 1452 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...