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/interpolation.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 01:34:37,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 01:34:37,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 01:34:37,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 01:34:37,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 01:34:37,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 01:34:37,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 01:34:37,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 01:34:37,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 01:34:37,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 01:34:37,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 01:34:37,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 01:34:37,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 01:34:37,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 01:34:37,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 01:34:37,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 01:34:37,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 01:34:37,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 01:34:37,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 01:34:37,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 01:34:37,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 01:34:37,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 01:34:37,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 01:34:37,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 01:34:37,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 01:34:37,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 01:34:37,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 01:34:37,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 01:34:37,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 01:34:37,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 01:34:37,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 01:34:37,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 01:34:37,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 01:34:37,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 01:34:37,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 01:34:37,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 01:34:37,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 01:34:37,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 01:34:37,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 01:34:37,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 01:34:37,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 01:34:37,688 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:34:37,706 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 01:34:37,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 01:34:37,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 01:34:37,707 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 01:34:37,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 01:34:37,710 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 01:34:37,710 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 01:34:37,710 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 01:34:37,710 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 01:34:37,711 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 01:34:37,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 01:34:37,711 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 01:34:37,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 01:34:37,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 01:34:37,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 01:34:37,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 01:34:37,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 01:34:37,712 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 01:34:37,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 01:34:37,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 01:34:37,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 01:34:37,714 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 01:34:37,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 01:34:37,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 01:34:37,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 01:34:37,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 01:34:37,716 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 01:34:37,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 01:34:37,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 01:34:37,716 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 01:34:37,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 01:34:37,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 01:34:37,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 01:34:37,785 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 01:34:37,786 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 01:34:37,786 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/interpolation.c.v+nlh-reducer.c [2019-09-10 01:34:37,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbc5c4bde/16139ab8e94e42de9a49c2cf4c8695e4/FLAG89f9a8598 [2019-09-10 01:34:38,355 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 01:34:38,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/interpolation.c.v+nlh-reducer.c [2019-09-10 01:34:38,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbc5c4bde/16139ab8e94e42de9a49c2cf4c8695e4/FLAG89f9a8598 [2019-09-10 01:34:38,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbc5c4bde/16139ab8e94e42de9a49c2cf4c8695e4 [2019-09-10 01:34:38,738 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 01:34:38,739 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 01:34:38,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 01:34:38,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 01:34:38,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 01:34:38,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:34:38" (1/1) ... [2019-09-10 01:34:38,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1679e9be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:34:38, skipping insertion in model container [2019-09-10 01:34:38,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:34:38" (1/1) ... [2019-09-10 01:34:38,758 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 01:34:38,779 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 01:34:39,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:34:39,150 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 01:34:39,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 01:34:39,244 INFO L192 MainTranslator]: Completed translation [2019-09-10 01:34:39,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:34:39 WrapperNode [2019-09-10 01:34:39,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 01:34:39,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 01:34:39,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 01:34:39,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 01:34:39,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:34:39" (1/1) ... [2019-09-10 01:34:39,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:34:39" (1/1) ... [2019-09-10 01:34:39,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:34:39" (1/1) ... [2019-09-10 01:34:39,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:34:39" (1/1) ... [2019-09-10 01:34:39,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:34:39" (1/1) ... [2019-09-10 01:34:39,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:34:39" (1/1) ... [2019-09-10 01:34:39,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:34:39" (1/1) ... [2019-09-10 01:34:39,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 01:34:39,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 01:34:39,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 01:34:39,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 01:34:39,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:34:39" (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:34:39,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 01:34:39,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 01:34:39,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 01:34:39,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 01:34:39,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2019-09-10 01:34:39,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 01:34:39,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-10 01:34:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 01:34:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 01:34:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-09-10 01:34:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-09-10 01:34:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 01:34:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 01:34:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 01:34:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-09-10 01:34:39,665 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 01:34:39,666 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 01:34:39,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:34:39 BoogieIcfgContainer [2019-09-10 01:34:39,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 01:34:39,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 01:34:39,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 01:34:39,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 01:34:39,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:34:38" (1/3) ... [2019-09-10 01:34:39,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630da33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:34:39, skipping insertion in model container [2019-09-10 01:34:39,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:34:39" (2/3) ... [2019-09-10 01:34:39,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630da33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:34:39, skipping insertion in model container [2019-09-10 01:34:39,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:34:39" (3/3) ... [2019-09-10 01:34:39,676 INFO L109 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+nlh-reducer.c [2019-09-10 01:34:39,687 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 01:34:39,695 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 01:34:39,712 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 01:34:39,740 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 01:34:39,740 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 01:34:39,740 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 01:34:39,740 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 01:34:39,740 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 01:34:39,740 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 01:34:39,741 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 01:34:39,741 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 01:34:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-09-10 01:34:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:34:39,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:34:39,778 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:34:39,780 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:34:39,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:34:39,785 INFO L82 PathProgramCache]: Analyzing trace with hash -938213152, now seen corresponding path program 1 times [2019-09-10 01:34:39,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:34:39,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:39,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:39,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:39,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:34:39,902 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:34:39,902 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:34:39,903 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:34:39,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:39,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:34:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:39,964 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:34:39,968 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:34:39,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:34:39,970 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:34:39,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:39,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:34:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:40,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 01:34:40,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:34:40,117 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:34:40,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:34:40,145 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 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 01:34:40,151 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:34:40,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-09-10 01:34:40,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:34:40,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 01:34:40,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 01:34:40,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 01:34:40,173 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2019-09-10 01:34:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:34:40,231 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2019-09-10 01:34:40,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 01:34:40,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-10 01:34:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:34:40,244 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:34:40,245 INFO L226 Difference]: Without dead ends: 26 [2019-09-10 01:34:40,247 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:34:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-10 01:34:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-10 01:34:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:34:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-09-10 01:34:40,286 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2019-09-10 01:34:40,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:34:40,286 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-09-10 01:34:40,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 01:34:40,287 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-09-10 01:34:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-10 01:34:40,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:34:40,288 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:34:40,288 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:34:40,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:34:40,289 INFO L82 PathProgramCache]: Analyzing trace with hash -923109115, now seen corresponding path program 1 times [2019-09-10 01:34:40,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:34:40,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:40,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:40,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:40,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:34:40,309 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:34:40,310 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:34:40,310 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) [2019-09-10 01:34:40,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:40,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:34:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:40,363 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:34:40,364 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:34:40,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:34:40,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:34:40,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:40,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:34:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:40,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 01:34:40,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:34:40,566 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:34:40,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2019-09-10 01:34:40,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-10 01:34:40,599 INFO L567 ElimStorePlain]: treesize reduction 6, result has 80.6 percent of original size [2019-09-10 01:34:40,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-10 01:34:40,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:21 [2019-09-10 01:34:40,628 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:34:40,629 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:34:41,042 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_7 Real)) (or (not (<= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1))))) (/ (+ c_main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1)) .cse0)))) v_main_~main__z~0_7)) (<= 0.0 v_main_~main__z~0_7))) is different from false [2019-09-10 01:34:41,054 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_7 Real)) (or (<= 0.0 v_main_~main__z~0_7) (not (<= (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__max~0.base|) |c_main_~#main__max~0.offset|) .cse0))) v_main_~main__z~0_7)))) is different from false [2019-09-10 01:34:41,496 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) (not (<= (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__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:34:41,533 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:34:41,537 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:34:41,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-09-10 01:34:41,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:34:41,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:34:41,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:34:41,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=31, Unknown=3, NotChecked=36, Total=90 [2019-09-10 01:34:41,540 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 6 states. [2019-09-10 01:34:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:34:41,772 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-09-10 01:34:41,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 01:34:41,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-10 01:34:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:34:41,775 INFO L225 Difference]: With dead ends: 39 [2019-09-10 01:34:41,775 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 01:34:41,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=32, Invalid=49, Unknown=3, NotChecked=48, Total=132 [2019-09-10 01:34:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 01:34:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-09-10 01:34:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:34:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-09-10 01:34:41,788 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 17 [2019-09-10 01:34:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:34:41,789 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-09-10 01:34:41,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:34:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-09-10 01:34:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-10 01:34:41,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:34:41,791 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:34:41,792 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:34:41,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:34:41,792 INFO L82 PathProgramCache]: Analyzing trace with hash 988740288, now seen corresponding path program 1 times [2019-09-10 01:34:41,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:34:41,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:41,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:41,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:41,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:34:41,834 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:34:41,834 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:34:41,835 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:34:41,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:41,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:34:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:41,875 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:34:41,875 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:34:41,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:34:41,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 01:34:41,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:41,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:34:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:41,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 01:34:41,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:34:42,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:34:42,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2019-09-10 01:34:42,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-10 01:34:42,034 INFO L567 ElimStorePlain]: treesize reduction 6, result has 80.6 percent of original size [2019-09-10 01:34:42,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-10 01:34:42,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:21 [2019-09-10 01:34:42,055 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:34:42,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:34:42,072 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_9 Real)) (or (not (>= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1))))) (/ (+ c_main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1)) .cse0)))) v_main_~main__z~0_9)) (<= v_main_~main__z~0_9 1.0))) is different from false [2019-09-10 01:34:42,080 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 ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1))))) (/ (+ main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1)) .cse0)))) v_main_~main__z~0_9)) (<= v_main_~main__z~0_9 1.0))) is different from false [2019-09-10 01:34:42,089 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_9 Real)) (let ((.cse2 (* 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| .cse2)))) (or (< .cse0 main_~main__t~0) (not (>= (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse2))))) (/ (+ main_~main__t~0 .cse1) (+ .cse0 .cse1))) v_main_~main__z~0_9)) (<= v_main_~main__z~0_9 1.0))))) is different from false [2019-09-10 01:34:43,456 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:34:43,460 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:34:43,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-09-10 01:34:43,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:34:43,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:34:43,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:34:43,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=43, Unknown=9, NotChecked=48, Total=132 [2019-09-10 01:34:43,462 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 7 states. [2019-09-10 01:34:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:34:44,157 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-10 01:34:44,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:34:44,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-09-10 01:34:44,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:34:44,160 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:34:44,160 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 01:34:44,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=47, Invalid=64, Unknown=11, NotChecked=60, Total=182 [2019-09-10 01:34:44,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 01:34:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-09-10 01:34:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:34:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-10 01:34:44,166 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 18 [2019-09-10 01:34:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:34:44,166 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-10 01:34:44,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:34:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-10 01:34:44,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-10 01:34:44,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:34:44,167 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:34:44,167 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:34:44,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:34:44,168 INFO L82 PathProgramCache]: Analyzing trace with hash 240100127, now seen corresponding path program 1 times [2019-09-10 01:34:44,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:34:44,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:44,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:44,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:44,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:34:44,185 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:34:44,185 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:34:44,185 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:34:44,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:44,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:34:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:44,217 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:34:44,218 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:34:44,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:34:44,218 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:34:44,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:44,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:34:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:44,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 01:34:44,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:34:44,384 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:34:44,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 37 [2019-09-10 01:34:44,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-10 01:34:44,400 INFO L567 ElimStorePlain]: treesize reduction 6, result has 80.6 percent of original size [2019-09-10 01:34:44,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-10 01:34:44,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2019-09-10 01:34:44,418 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:34:44,419 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:34:44,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_11 Real)) (or (<= 0.0 v_main_~main__z~0_11) (not (<= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1))))) (/ (+ c_main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1)) .cse0)))) v_main_~main__z~0_11)))) is different from false [2019-09-10 01:34:44,445 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_11 Real)) (or (not (<= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (+ main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1 4)) .cse0)))) v_main_~main__z~0_11)) (<= 0.0 v_main_~main__z~0_11) (<= main_~main__t~0 |c_main_#t~mem3|))) is different from false [2019-09-10 01:34:44,453 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_11 Real)) (let ((.cse1 (select |c_#memory_real| |c_main_~#main__max~0.base|)) (.cse2 (* 4 c_main_~main__i~0))) (or (not (<= (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse2 4))))) (/ (+ main_~main__t~0 .cse0) (+ (select .cse1 (+ |c_main_~#main__max~0.offset| .cse2 4)) .cse0))) v_main_~main__z~0_11)) (<= main_~main__t~0 (select .cse1 (+ |c_main_~#main__max~0.offset| .cse2))) (<= 0.0 v_main_~main__z~0_11)))) is different from false [2019-09-10 01:34:44,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_11 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| 4))))) (/ (+ .cse0 main_~main__t~0) (+ .cse0 (select .cse1 (+ |c_main_~#main__max~0.offset| 4))))) v_main_~main__z~0_11)) (<= 0.0 v_main_~main__z~0_11) (<= main_~main__t~0 (select .cse1 |c_main_~#main__max~0.offset|))))) is different from false [2019-09-10 01:34:44,475 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:34:44,483 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:34:44,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-09-10 01:34:44,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:34:44,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 01:34:44,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 01:34:44,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=42, Unknown=4, NotChecked=60, Total=132 [2019-09-10 01:34:44,486 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 7 states. [2019-09-10 01:34:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:34:44,681 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-09-10 01:34:44,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 01:34:44,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-10 01:34:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:34:44,683 INFO L225 Difference]: With dead ends: 39 [2019-09-10 01:34:44,684 INFO L226 Difference]: Without dead ends: 39 [2019-09-10 01:34:44,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=64, Unknown=4, NotChecked=76, Total=182 [2019-09-10 01:34:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-10 01:34:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-09-10 01:34:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:34:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-10 01:34:44,688 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2019-09-10 01:34:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:34:44,689 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-10 01:34:44,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 01:34:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-10 01:34:44,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-10 01:34:44,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:34:44,690 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:34:44,690 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:34:44,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:34:44,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1606478874, now seen corresponding path program 1 times [2019-09-10 01:34:44,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:34:44,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:44,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:44,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:44,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:34:44,717 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:34:44,718 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:34:44,718 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:34:44,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:44,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:34:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:44,747 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:34:44,748 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:34:44,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:34:44,748 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:34:44,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:44,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:34:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:44,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 01:34:44,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:34:44,903 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:34:44,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2019-09-10 01:34:44,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-10 01:34:44,918 INFO L567 ElimStorePlain]: treesize reduction 6, result has 80.6 percent of original size [2019-09-10 01:34:44,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-10 01:34:44,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:21 [2019-09-10 01:34:44,936 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:34:44,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:34:44,951 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_13 Real)) (or (not (>= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1))))) (/ (+ c_main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1)) .cse0)))) v_main_~main__z~0_13)) (<= v_main_~main__z~0_13 1.0))) is different from false [2019-09-10 01:34:45,412 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_13 Real)) (or (not (>= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1))))) (/ (+ main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1)) .cse0)))) v_main_~main__z~0_13)) (< |c_main_#t~mem7| main_~main__t~0) (<= v_main_~main__z~0_13 1.0))) is different from false [2019-09-10 01:34:45,842 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_13 Real)) (let ((.cse2 (* 4 c_main_~main__i~0))) (let ((.cse1 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse2)))) (or (not (>= (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse2))))) (/ (+ main_~main__t~0 .cse0) (+ .cse1 .cse0))) v_main_~main__z~0_13)) (< .cse1 main_~main__t~0) (<= v_main_~main__z~0_13 1.0))))) is different from false [2019-09-10 01:34:46,281 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_13 Real)) (let ((.cse2 (* 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| .cse2 4)))) (or (< .cse0 main_~main__t~0) (<= v_main_~main__z~0_13 1.0) (not (>= (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse2 4))))) (/ (+ main_~main__t~0 .cse1) (+ .cse0 .cse1))) v_main_~main__z~0_13)))))) is different from false [2019-09-10 01:34:46,739 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_13 Real)) (let ((.cse1 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| 4)))) (or (not (>= (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 4))))) (/ (+ .cse0 main_~main__t~0) (+ .cse0 .cse1))) v_main_~main__z~0_13)) (< .cse1 main_~main__t~0) (<= v_main_~main__z~0_13 1.0)))) is different from false [2019-09-10 01:34:46,756 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:34:46,760 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:34:46,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-09-10 01:34:46,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:34:46,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:34:46,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:34:46,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=54, Unknown=5, NotChecked=90, Total=182 [2019-09-10 01:34:46,762 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 8 states. [2019-09-10 01:34:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:34:46,929 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-10 01:34:46,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:34:46,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-10 01:34:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:34:46,931 INFO L225 Difference]: With dead ends: 34 [2019-09-10 01:34:46,931 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 01:34:46,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=46, Invalid=79, Unknown=5, NotChecked=110, Total=240 [2019-09-10 01:34:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 01:34:46,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-09-10 01:34:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:34:46,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-09-10 01:34:46,938 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2019-09-10 01:34:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:34:46,938 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-09-10 01:34:46,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:34:46,938 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-09-10 01:34:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 01:34:46,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:34:46,940 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:34:46,940 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:34:46,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:34:46,941 INFO L82 PathProgramCache]: Analyzing trace with hash 262198436, now seen corresponding path program 1 times [2019-09-10 01:34:46,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:34:46,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:46,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:46,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:46,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:34:46,982 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:34:46,983 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:34:46,983 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:34:46,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:46,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:34:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:47,009 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:34:47,010 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:34:47,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:34:47,010 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:34:47,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:47,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:34:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:47,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 01:34:47,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:34:47,174 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:34:47,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 37 [2019-09-10 01:34:47,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-10 01:34:47,188 INFO L567 ElimStorePlain]: treesize reduction 6, result has 80.6 percent of original size [2019-09-10 01:34:47,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-10 01:34:47,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2019-09-10 01:34:47,205 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:34:47,206 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:34:47,591 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_15 Real)) (or (not (<= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1))))) (/ (+ c_main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1)) .cse0)))) v_main_~main__z~0_15)) (<= 0.0 v_main_~main__z~0_15))) is different from false [2019-09-10 01:34:47,599 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_15 Real)) (or (<= main_~main__t~0 |c_main_#t~mem7|) (not (<= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (+ main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1 4)) .cse0)))) v_main_~main__z~0_15)) (<= 0.0 v_main_~main__z~0_15))) is different from false [2019-09-10 01:34:47,612 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))))) (/ (+ main_~main__t~0 .cse2) (+ (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1 4)) .cse2))) v_main_~main__z~0_15)) (<= 0.0 v_main_~main__z~0_15)))) is different from false [2019-09-10 01:34:47,622 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|)) (.cse2 (* 4 c_main_~main__i~0))) (or (<= 0.0 v_main_~main__z~0_15) (not (<= (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse2 8))))) (/ (+ main_~main__t~0 .cse0) (+ (select .cse1 (+ |c_main_~#main__max~0.offset| .cse2 8)) .cse0))) v_main_~main__z~0_15)) (<= main_~main__t~0 (select .cse1 (+ |c_main_~#main__max~0.offset| .cse2 4)))))) is different from false [2019-09-10 01:34:48,073 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|))) (or (<= main_~main__t~0 (select .cse0 (+ |c_main_~#main__max~0.offset| 4))) (<= 0.0 v_main_~main__z~0_15) (not (<= (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 8))))) (/ (+ .cse1 main_~main__t~0) (+ .cse1 (select .cse0 (+ |c_main_~#main__max~0.offset| 8))))) v_main_~main__z~0_15))))) is different from false [2019-09-10 01:34:48,084 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:34:48,088 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:34:48,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-09-10 01:34:48,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:34:48,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 01:34:48,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 01:34:48,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=56, Unknown=5, NotChecked=90, Total=182 [2019-09-10 01:34:48,089 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 8 states. [2019-09-10 01:34:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:34:48,259 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-09-10 01:34:48,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 01:34:48,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-09-10 01:34:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:34:48,261 INFO L225 Difference]: With dead ends: 40 [2019-09-10 01:34:48,261 INFO L226 Difference]: Without dead ends: 40 [2019-09-10 01:34:48,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=43, Invalid=82, Unknown=5, NotChecked=110, Total=240 [2019-09-10 01:34:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-10 01:34:48,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-09-10 01:34:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:34:48,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-09-10 01:34:48,265 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 21 [2019-09-10 01:34:48,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:34:48,266 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-09-10 01:34:48,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 01:34:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-09-10 01:34:48,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 01:34:48,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:34:48,267 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:34:48,267 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:34:48,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:34:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash -921431295, now seen corresponding path program 1 times [2019-09-10 01:34:48,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:34:48,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:48,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:48,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:48,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:34:48,280 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:34:48,281 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:34:48,281 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:34:48,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:48,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:34:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:48,309 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:34:48,309 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:34:48,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:34:48,309 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:34:48,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:48,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:34:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:48,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 01:34:48,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:34:48,480 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:34:48,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2019-09-10 01:34:48,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-10 01:34:48,497 INFO L567 ElimStorePlain]: treesize reduction 6, result has 80.6 percent of original size [2019-09-10 01:34:48,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-10 01:34:48,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:21 [2019-09-10 01:34:48,521 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:34:48,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:34:48,933 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_17 Real)) (or (<= v_main_~main__z~0_17 1.0) (not (>= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1))))) (/ (+ c_main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1)) .cse0)))) v_main_~main__z~0_17)))) is different from false [2019-09-10 01:34:49,351 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 Real)) (or (<= v_main_~main__z~0_17 1.0) (< |c_main_#t~mem8| main_~main__t~0) (not (>= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1))))) (/ (+ main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1)) .cse0)))) v_main_~main__z~0_17)))) is different from false [2019-09-10 01:34:49,359 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 Real)) (let ((.cse2 (* 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| .cse2)))) (or (< .cse0 main_~main__t~0) (<= v_main_~main__z~0_17 1.0) (not (>= (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse2))))) (/ (+ main_~main__t~0 .cse1) (+ .cse0 .cse1))) v_main_~main__z~0_17)))))) is different from false [2019-09-10 01:34:49,788 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 Real)) (let ((.cse2 (* 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| .cse2 4)))) (or (< .cse0 main_~main__t~0) (not (>= (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse2 4))))) (/ (+ main_~main__t~0 .cse1) (+ .cse0 .cse1))) v_main_~main__z~0_17)) (<= v_main_~main__z~0_17 1.0))))) is different from false [2019-09-10 01:34:49,796 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_17 Real)) (let ((.cse2 (* 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| .cse2 8)))) (or (<= v_main_~main__z~0_17 1.0) (< .cse0 main_~main__t~0) (not (>= (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse2 8))))) (/ (+ main_~main__t~0 .cse1) (+ .cse0 .cse1))) v_main_~main__z~0_17)))))) is different from false [2019-09-10 01:34:50,218 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))))) (/ (+ .cse0 main_~main__t~0) (+ .cse0 .cse1))) v_main_~main__z~0_17)) (<= v_main_~main__z~0_17 1.0) (< .cse1 main_~main__t~0)))) is different from false [2019-09-10 01:34:50,246 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:34:50,250 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:34:50,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-09-10 01:34:50,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:34:50,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 01:34:50,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 01:34:50,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=70, Unknown=6, NotChecked=126, Total=240 [2019-09-10 01:34:50,252 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 9 states. [2019-09-10 01:34:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:34:50,409 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-09-10 01:34:50,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 01:34:50,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-10 01:34:50,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:34:50,410 INFO L225 Difference]: With dead ends: 35 [2019-09-10 01:34:50,410 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 01:34:50,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=51, Invalid=99, Unknown=6, NotChecked=150, Total=306 [2019-09-10 01:34:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 01:34:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-09-10 01:34:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-10 01:34:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-09-10 01:34:50,413 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2019-09-10 01:34:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:34:50,414 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-09-10 01:34:50,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 01:34:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-09-10 01:34:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-10 01:34:50,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:34:50,415 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:34:50,415 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:34:50,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:34:50,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1121242992, now seen corresponding path program 1 times [2019-09-10 01:34:50,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:34:50,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:50,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:50,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:50,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:34:50,438 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:34:50,438 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:34:50,438 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:34:50,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:50,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:34:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:50,468 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:34:50,469 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:34:50,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:34:50,469 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:34:50,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:50,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:34:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:50,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-10 01:34:50,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:34:50,524 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:34:50,524 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:34:50,562 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:34:50,565 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:34:50,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-09-10 01:34:50,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:34:50,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 01:34:50,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 01:34:50,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:34:50,567 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2019-09-10 01:34:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:34:50,606 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-10 01:34:50,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 01:34:50,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-10 01:34:50,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:34:50,607 INFO L225 Difference]: With dead ends: 31 [2019-09-10 01:34:50,607 INFO L226 Difference]: Without dead ends: 31 [2019-09-10 01:34:50,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-09-10 01:34:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-10 01:34:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-09-10 01:34:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 01:34:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-10 01:34:50,611 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-09-10 01:34:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:34:50,611 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-10 01:34:50,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 01:34:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-10 01:34:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-10 01:34:50,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:34:50,613 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:34:50,613 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:34:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:34:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1027553552, now seen corresponding path program 1 times [2019-09-10 01:34:50,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:34:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:50,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:50,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:34:50,626 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:34:50,626 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:34:50,626 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) [2019-09-10 01:34:50,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:50,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:34:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:50,671 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:34:50,671 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:34:50,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:34:50,671 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:34:50,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:50,690 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:34:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:50,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-10 01:34:50,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:34:50,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:34:50,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 37 [2019-09-10 01:34:50,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-10 01:34:50,892 INFO L567 ElimStorePlain]: treesize reduction 6, result has 80.6 percent of original size [2019-09-10 01:34:50,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-10 01:34:50,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:21 [2019-09-10 01:34:50,913 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:34:50,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:34:51,299 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_20 Real)) (or (not (<= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1))))) (/ (+ c_main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1)) .cse0)))) v_main_~main__z~0_20)) (<= 0.0 v_main_~main__z~0_20))) is different from false [2019-09-10 01:34:51,304 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_20 Real)) (or (not (<= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (+ c_main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1 4)) .cse0)))) v_main_~main__z~0_20)) (<= 0.0 v_main_~main__z~0_20))) is different from false [2019-09-10 01:34:51,320 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_20 Real)) (or (<= main_~main__t~0 |c_main_#t~mem8|) (not (<= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1 4))))) (/ (+ main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1 4)) .cse0)))) v_main_~main__z~0_20)) (<= 0.0 v_main_~main__z~0_20))) is different from false [2019-09-10 01:34:51,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_20 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))))) (/ (+ main_~main__t~0 .cse2) (+ (select .cse0 (+ |c_main_~#main__max~0.offset| .cse1 4)) .cse2))) v_main_~main__z~0_20)) (<= 0.0 v_main_~main__z~0_20)))) is different from false [2019-09-10 01:34:52,194 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|)) (.cse2 (* 4 c_main_~main__i~0))) (or (not (<= (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse2 8))))) (/ (+ main_~main__t~0 .cse0) (+ (select .cse1 (+ |c_main_~#main__max~0.offset| .cse2 8)) .cse0))) v_main_~main__z~0_20)) (<= 0.0 v_main_~main__z~0_20) (<= main_~main__t~0 (select .cse1 (+ |c_main_~#main__max~0.offset| .cse2 4)))))) is different from false [2019-09-10 01:34:52,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_20 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))) (not (<= (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 .cse0 (+ |c_main_~#main__max~0.offset| .cse1 12)) .cse2))) v_main_~main__z~0_20)) (<= 0.0 v_main_~main__z~0_20)))) is different from false [2019-09-10 01:34:53,069 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_20 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 (<= (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 12))))) (/ (+ main_~main__t~0 .cse1) (+ .cse1 (select .cse0 (+ |c_main_~#main__max~0.offset| 12))))) v_main_~main__z~0_20)) (<= 0.0 v_main_~main__z~0_20)))) is different from false [2019-09-10 01:34:53,099 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 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 01:34:53,108 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:34:53,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 18 [2019-09-10 01:34:53,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:34:53,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 01:34:53,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 01:34:53,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=89, Unknown=7, NotChecked=168, Total=306 [2019-09-10 01:34:53,111 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 10 states. [2019-09-10 01:34:53,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:34:53,341 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-09-10 01:34:53,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:34:53,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-10 01:34:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:34:53,342 INFO L225 Difference]: With dead ends: 43 [2019-09-10 01:34:53,342 INFO L226 Difference]: Without dead ends: 43 [2019-09-10 01:34:53,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=54, Invalid=123, Unknown=7, NotChecked=196, Total=380 [2019-09-10 01:34:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-10 01:34:53,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-09-10 01:34:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-10 01:34:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-09-10 01:34:53,348 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 24 [2019-09-10 01:34:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:34:53,348 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-09-10 01:34:53,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 01:34:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-09-10 01:34:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-10 01:34:53,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:34:53,350 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:34:53,350 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:34:53,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:34:53,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1329740821, now seen corresponding path program 1 times [2019-09-10 01:34:53,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:34:53,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:53,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:53,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:53,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:34:53,366 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:34:53,366 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:34:53,366 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) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-10 01:34:53,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:53,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:34:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:53,406 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-10 01:34:53,406 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:34:53,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 01:34:53,407 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) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 01:34:53,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:53,428 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 01:34:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:53,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 01:34:53,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 01:34:53,604 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-10 01:34:53,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2019-09-10 01:34:53,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-10 01:34:53,627 INFO L567 ElimStorePlain]: treesize reduction 6, result has 80.6 percent of original size [2019-09-10 01:34:53,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-10 01:34:53,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:21 [2019-09-10 01:34:53,646 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:34:53,646 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 01:34:53,661 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~main__z~0_22 Real)) (or (not (>= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1))))) (/ (+ c_main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1)) .cse0)))) v_main_~main__z~0_22)) (<= v_main_~main__z~0_22 1.0))) is different from false [2019-09-10 01:34:53,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (or (not (>= (let ((.cse1 (* 4 c_main_~main__i~0))) (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse1))))) (/ (+ main_~main__t~0 .cse0) (+ (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse1)) .cse0)))) v_main_~main__z~0_22)) (< |c_main_#t~mem9| main_~main__t~0) (<= v_main_~main__z~0_22 1.0))) is different from false [2019-09-10 01:34:54,092 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (let ((.cse2 (* 4 c_main_~main__i~0))) (let ((.cse1 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| .cse2)))) (or (not (>= (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse2))))) (/ (+ main_~main__t~0 .cse0) (+ .cse1 .cse0))) v_main_~main__z~0_22)) (< .cse1 main_~main__t~0) (<= v_main_~main__z~0_22 1.0))))) is different from false [2019-09-10 01:34:54,520 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (let ((.cse2 (* 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| .cse2 4)))) (or (< .cse0 main_~main__t~0) (<= v_main_~main__z~0_22 1.0) (not (>= (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse2 4))))) (/ (+ main_~main__t~0 .cse1) (+ .cse0 .cse1))) v_main_~main__z~0_22)))))) is different from false [2019-09-10 01:34:54,540 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (let ((.cse2 (* 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| .cse2 8)))) (or (< .cse0 main_~main__t~0) (<= v_main_~main__z~0_22 1.0) (not (>= (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse2 8))))) (/ (+ main_~main__t~0 .cse1) (+ .cse0 .cse1))) v_main_~main__z~0_22)))))) is different from false [2019-09-10 01:34:54,972 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (let ((.cse2 (* 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| .cse2 12)))) (or (< .cse0 main_~main__t~0) (not (>= (let ((.cse1 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| .cse2 12))))) (/ (+ main_~main__t~0 .cse1) (+ .cse0 .cse1))) v_main_~main__z~0_22)) (<= v_main_~main__z~0_22 1.0))))) is different from false [2019-09-10 01:34:55,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~main__t~0 Real) (v_main_~main__z~0_22 Real)) (let ((.cse1 (select (select |c_#memory_real| |c_main_~#main__max~0.base|) (+ |c_main_~#main__max~0.offset| 12)))) (or (<= v_main_~main__z~0_22 1.0) (not (>= (let ((.cse0 (* (- 1.0) (select (select |c_#memory_real| |c_main_~#main__min~0.base|) (+ |c_main_~#main__min~0.offset| 12))))) (/ (+ main_~main__t~0 .cse0) (+ .cse0 .cse1))) v_main_~main__z~0_22)) (< .cse1 main_~main__t~0)))) is different from false [2019-09-10 01:34:55,413 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:34:55,417 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:34:55,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 18 [2019-09-10 01:34:55,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:34:55,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 01:34:55,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 01:34:55,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=88, Unknown=7, NotChecked=168, Total=306 [2019-09-10 01:34:55,419 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 10 states. [2019-09-10 01:34:55,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:34:55,580 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-09-10 01:34:55,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 01:34:55,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-09-10 01:34:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:34:55,581 INFO L225 Difference]: With dead ends: 38 [2019-09-10 01:34:55,582 INFO L226 Difference]: Without dead ends: 35 [2019-09-10 01:34:55,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=56, Invalid=121, Unknown=7, NotChecked=196, Total=380 [2019-09-10 01:34:55,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-10 01:34:55,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-09-10 01:34:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-10 01:34:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-09-10 01:34:55,586 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2019-09-10 01:34:55,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:34:55,586 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-09-10 01:34:55,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 01:34:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-09-10 01:34:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 01:34:55,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 01:34:55,588 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:34:55,588 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 01:34:55,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:34:55,588 INFO L82 PathProgramCache]: Analyzing trace with hash -54384132, now seen corresponding path program 1 times [2019-09-10 01:34:55,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 01:34:55,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:55,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:55,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 01:34:55,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 01:34:55,600 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-10 01:34:55,600 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-10 01:34:55,601 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:34:55,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 01:34:55,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-10 01:34:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 01:34:55,630 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2019-09-10 01:34:55,632 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:34:55,663 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 01:34:55,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 01:34:55,717 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 01:34:55,718 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 37 variables. [2019-09-10 01:34:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 01:34:55,721 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 01:34:55,750 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-09-10 01:34:55,751 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 01:34:55,752 INFO L420 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2019-09-10 01:34:55,753 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 01:34:55,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 01:34:55,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 01:34:55,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 01:34:55,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 01:34:55,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 01:34:55,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 01:34:55,755 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 2 states. [2019-09-10 01:34:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 01:34:55,756 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2019-09-10 01:34:55,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 01:34:55,756 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2019-09-10 01:34:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 01:34:55,756 INFO L225 Difference]: With dead ends: 6 [2019-09-10 01:34:55,756 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 01:34:55,757 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:34:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 01:34:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 01:34:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 01:34:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 01:34:55,757 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-09-10 01:34:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 01:34:55,758 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 01:34:55,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 01:34:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 01:34:55,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 01:34:55,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:34:55 BoogieIcfgContainer [2019-09-10 01:34:55,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 01:34:55,765 INFO L168 Benchmark]: Toolchain (without parser) took 17025.52 ms. Allocated memory was 135.8 MB in the beginning and 275.3 MB in the end (delta: 139.5 MB). Free memory was 89.7 MB in the beginning and 117.9 MB in the end (delta: -28.2 MB). Peak memory consumption was 111.3 MB. Max. memory is 7.1 GB. [2019-09-10 01:34:55,766 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 135.8 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-09-10 01:34:55,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 501.76 ms. Allocated memory was 135.8 MB in the beginning and 202.4 MB in the end (delta: 66.6 MB). Free memory was 89.5 MB in the beginning and 177.7 MB in the end (delta: -88.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-09-10 01:34:55,767 INFO L168 Benchmark]: Boogie Preprocessor took 61.96 ms. Allocated memory is still 202.4 MB. Free memory was 177.7 MB in the beginning and 175.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-10 01:34:55,768 INFO L168 Benchmark]: RCFGBuilder took 359.85 ms. Allocated memory is still 202.4 MB. Free memory was 175.5 MB in the beginning and 157.1 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2019-09-10 01:34:55,769 INFO L168 Benchmark]: TraceAbstraction took 16095.01 ms. Allocated memory was 202.4 MB in the beginning and 275.3 MB in the end (delta: 72.9 MB). Free memory was 156.5 MB in the beginning and 117.9 MB in the end (delta: 38.6 MB). Peak memory consumption was 111.5 MB. Max. memory is 7.1 GB. [2019-09-10 01:34:55,772 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.18 ms. Allocated memory is still 135.8 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 501.76 ms. Allocated memory was 135.8 MB in the beginning and 202.4 MB in the end (delta: 66.6 MB). Free memory was 89.5 MB in the beginning and 177.7 MB in the end (delta: -88.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.96 ms. Allocated memory is still 202.4 MB. Free memory was 177.7 MB in the beginning and 175.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.85 ms. Allocated memory is still 202.4 MB. Free memory was 175.5 MB in the beginning and 157.1 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16095.01 ms. Allocated memory was 202.4 MB in the beginning and 275.3 MB in the end (delta: 72.9 MB). Free memory was 156.5 MB in the beginning and 117.9 MB in the end (delta: 38.6 MB). Peak memory consumption was 111.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: 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, 16.0s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 205 SDtfs, 304 SDslu, 580 SDs, 0 SdLazy, 640 SolverSat, 39 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 317 SyntacticMatches, 2 SemanticMatches, 125 ConstructedPredicates, 40 IntricatePredicates, 5 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 12.4s 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.0s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.955 AbsIntWeakeningRatio, 1.12 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, 12.2s InterpolantComputationTime, 438 NumberOfCodeBlocks, 438 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 392 ConstructedInterpolants, 86 QuantifiedInterpolants, 140488 SizeOfPredicates, 84 NumberOfNonLiveVariables, 1132 ConjunctsInSsa, 152 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...