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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_reverse_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 10:21:13,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 10:21:13,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 10:21:13,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 10:21:13,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 10:21:13,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 10:21:13,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 10:21:13,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 10:21:13,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 10:21:13,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 10:21:13,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 10:21:13,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 10:21:13,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 10:21:13,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 10:21:13,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 10:21:13,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 10:21:13,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 10:21:13,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 10:21:13,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 10:21:13,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 10:21:13,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 10:21:13,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 10:21:13,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 10:21:13,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 10:21:13,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 10:21:13,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 10:21:13,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 10:21:13,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 10:21:13,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 10:21:13,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 10:21:13,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 10:21:13,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 10:21:13,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 10:21:13,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 10:21:13,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 10:21:13,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 10:21:13,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 10:21:13,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 10:21:13,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 10:21:13,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 10:21:13,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 10:21:13,557 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 10:21:13,571 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 10:21:13,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 10:21:13,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 10:21:13,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 10:21:13,573 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 10:21:13,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 10:21:13,574 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 10:21:13,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 10:21:13,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 10:21:13,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 10:21:13,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 10:21:13,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 10:21:13,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 10:21:13,575 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 10:21:13,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 10:21:13,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 10:21:13,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 10:21:13,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 10:21:13,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 10:21:13,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 10:21:13,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 10:21:13,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 10:21:13,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 10:21:13,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 10:21:13,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 10:21:13,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 10:21:13,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 10:21:13,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 10:21:13,578 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 10:21:13,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 10:21:13,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 10:21:13,623 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 10:21:13,624 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 10:21:13,624 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 10:21:13,625 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_reverse_ground.i [2019-09-07 10:21:13,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57629512b/f03871d345c445d2a81973a1b7adaea2/FLAG04c704e10 [2019-09-07 10:21:14,164 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 10:21:14,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_reverse_ground.i [2019-09-07 10:21:14,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57629512b/f03871d345c445d2a81973a1b7adaea2/FLAG04c704e10 [2019-09-07 10:21:14,513 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57629512b/f03871d345c445d2a81973a1b7adaea2 [2019-09-07 10:21:14,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 10:21:14,530 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 10:21:14,533 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 10:21:14,533 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 10:21:14,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 10:21:14,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:21:14" (1/1) ... [2019-09-07 10:21:14,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6852ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:21:14, skipping insertion in model container [2019-09-07 10:21:14,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:21:14" (1/1) ... [2019-09-07 10:21:14,548 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 10:21:14,567 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 10:21:14,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:21:14,793 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 10:21:14,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 10:21:14,848 INFO L192 MainTranslator]: Completed translation [2019-09-07 10:21:14,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:21:14 WrapperNode [2019-09-07 10:21:14,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 10:21:14,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 10:21:14,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 10:21:14,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 10:21:15,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:21:14" (1/1) ... [2019-09-07 10:21:15,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:21:14" (1/1) ... [2019-09-07 10:21:15,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:21:14" (1/1) ... [2019-09-07 10:21:15,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:21:14" (1/1) ... [2019-09-07 10:21:15,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:21:14" (1/1) ... [2019-09-07 10:21:15,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:21:14" (1/1) ... [2019-09-07 10:21:15,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:21:14" (1/1) ... [2019-09-07 10:21:15,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 10:21:15,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 10:21:15,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 10:21:15,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 10:21:15,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:21:14" (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-07 10:21:15,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 10:21:15,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 10:21:15,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 10:21:15,115 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 10:21:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 10:21:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 10:21:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 10:21:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 10:21:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 10:21:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 10:21:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 10:21:15,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 10:21:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 10:21:15,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 10:21:15,396 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 10:21:15,397 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 10:21:15,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:21:15 BoogieIcfgContainer [2019-09-07 10:21:15,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 10:21:15,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 10:21:15,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 10:21:15,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 10:21:15,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:21:14" (1/3) ... [2019-09-07 10:21:15,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231e1499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:21:15, skipping insertion in model container [2019-09-07 10:21:15,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:21:14" (2/3) ... [2019-09-07 10:21:15,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231e1499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:21:15, skipping insertion in model container [2019-09-07 10:21:15,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:21:15" (3/3) ... [2019-09-07 10:21:15,419 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_reverse_ground.i [2019-09-07 10:21:15,442 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 10:21:15,459 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 10:21:15,476 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 10:21:15,508 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 10:21:15,508 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 10:21:15,509 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 10:21:15,509 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 10:21:15,509 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 10:21:15,509 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 10:21:15,509 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 10:21:15,509 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 10:21:15,510 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 10:21:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-07 10:21:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:21:15,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:15,536 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:15,538 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:15,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:15,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2019-09-07 10:21:15,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:15,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:15,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:15,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:21:15,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:15,678 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-07 10:21:15,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:21:15,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 10:21:15,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 10:21:15,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 10:21:15,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 10:21:15,697 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-07 10:21:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:15,720 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-09-07 10:21:15,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 10:21:15,721 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 10:21:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:15,729 INFO L225 Difference]: With dead ends: 46 [2019-09-07 10:21:15,730 INFO L226 Difference]: Without dead ends: 22 [2019-09-07 10:21:15,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-07 10:21:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-07 10:21:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-07 10:21:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-07 10:21:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-07 10:21:15,771 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-09-07 10:21:15,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:15,772 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-07 10:21:15,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 10:21:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-07 10:21:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 10:21:15,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:15,773 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:15,774 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:15,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2019-09-07 10:21:15,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:15,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:15,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:15,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:21:15,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:15,836 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-07 10:21:15,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 10:21:15,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 10:21:15,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 10:21:15,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 10:21:15,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:21:15,840 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-09-07 10:21:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:15,872 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-09-07 10:21:15,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 10:21:15,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 10:21:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:15,873 INFO L225 Difference]: With dead ends: 40 [2019-09-07 10:21:15,874 INFO L226 Difference]: Without dead ends: 26 [2019-09-07 10:21:15,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 10:21:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-07 10:21:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-09-07 10:21:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 10:21:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-09-07 10:21:15,881 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2019-09-07 10:21:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:15,881 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-09-07 10:21:15,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 10:21:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-09-07 10:21:15,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 10:21:15,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:15,883 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-07 10:21:15,883 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:15,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:15,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2019-09-07 10:21:15,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:15,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:15,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:21:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:21:15,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:15,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:15,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:21:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:16,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 10:21:16,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 10:21:16,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:16,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 10:21:16,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 10:21:16,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 10:21:16,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:21:16,071 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-09-07 10:21:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:16,141 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-09-07 10:21:16,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 10:21:16,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-07 10:21:16,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:16,143 INFO L225 Difference]: With dead ends: 45 [2019-09-07 10:21:16,143 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 10:21:16,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 10:21:16,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 10:21:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-09-07 10:21:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 10:21:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-09-07 10:21:16,151 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2019-09-07 10:21:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:16,152 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-09-07 10:21:16,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 10:21:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-09-07 10:21:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 10:21:16,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:16,155 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:16,156 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:16,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 2 times [2019-09-07 10:21:16,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:16,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:16,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:16,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:21:16,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 10:21:16,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:16,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-07 10:21:16,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:21:16,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:21:16,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:16,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 10:21:16,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 10:21:16,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:16,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 10:21:16,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 10:21:16,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 10:21:16,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:21:16,326 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2019-09-07 10:21:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:16,396 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-09-07 10:21:16,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 10:21:16,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-09-07 10:21:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:16,398 INFO L225 Difference]: With dead ends: 51 [2019-09-07 10:21:16,398 INFO L226 Difference]: Without dead ends: 34 [2019-09-07 10:21:16,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 10:21:16,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-07 10:21:16,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-07 10:21:16,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 10:21:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-09-07 10:21:16,406 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2019-09-07 10:21:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:16,406 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-09-07 10:21:16,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 10:21:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-09-07 10:21:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 10:21:16,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:16,408 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:16,408 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:16,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:16,409 INFO L82 PathProgramCache]: Analyzing trace with hash -657216102, now seen corresponding path program 3 times [2019-09-07 10:21:16,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:16,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:16,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:16,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:16,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 10:21:16,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:16,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:21:16,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:16,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 10:21:16,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:16,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:21:16,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:16,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:21:16,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:21:16,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:21:16,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:21:16,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:21:16,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-09-07 10:21:16,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:21:16,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:21:16,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:21:16,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-09-07 10:21:16,781 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:21:16,782 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:21:16,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2019-09-07 10:21:16,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:21:16,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:21:16,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:21:16,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2019-09-07 10:21:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-07 10:21:16,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 10:21:16,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2019-09-07 10:21:16,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:21:16,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:21:16,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:21:16,855 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 14 states. [2019-09-07 10:21:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:17,499 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2019-09-07 10:21:17,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 10:21:17,502 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-09-07 10:21:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:17,503 INFO L225 Difference]: With dead ends: 65 [2019-09-07 10:21:17,503 INFO L226 Difference]: Without dead ends: 46 [2019-09-07 10:21:17,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:21:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-07 10:21:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-09-07 10:21:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 10:21:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-09-07 10:21:17,522 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 27 [2019-09-07 10:21:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:17,522 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-09-07 10:21:17,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:21:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-09-07 10:21:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 10:21:17,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:17,528 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:17,528 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:17,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:17,531 INFO L82 PathProgramCache]: Analyzing trace with hash 395701069, now seen corresponding path program 1 times [2019-09-07 10:21:17,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:17,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:17,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:17,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:17,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 10:21:17,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:17,639 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:21:17,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:17,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 10:21:17,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-07 10:21:17,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:17,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 10:21:17,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 10:21:17,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 10:21:17,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:21:17,719 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 8 states. [2019-09-07 10:21:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:17,804 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-09-07 10:21:17,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 10:21:17,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-09-07 10:21:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:17,810 INFO L225 Difference]: With dead ends: 75 [2019-09-07 10:21:17,810 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 10:21:17,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 10:21:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 10:21:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-07 10:21:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 10:21:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-09-07 10:21:17,820 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 39 [2019-09-07 10:21:17,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:17,820 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-09-07 10:21:17,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 10:21:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-09-07 10:21:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 10:21:17,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:17,822 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:17,823 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:17,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:17,823 INFO L82 PathProgramCache]: Analyzing trace with hash 885326793, now seen corresponding path program 2 times [2019-09-07 10:21:17,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:17,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:17,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:21:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-07 10:21:17,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:17,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:17,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:21:17,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:21:17,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:17,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 10:21:17,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-07 10:21:17,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:17,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 10:21:17,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 10:21:17,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 10:21:17,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:21:17,970 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 9 states. [2019-09-07 10:21:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:18,040 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2019-09-07 10:21:18,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 10:21:18,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-09-07 10:21:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:18,044 INFO L225 Difference]: With dead ends: 81 [2019-09-07 10:21:18,044 INFO L226 Difference]: Without dead ends: 52 [2019-09-07 10:21:18,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 10:21:18,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-07 10:21:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-09-07 10:21:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-07 10:21:18,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-09-07 10:21:18,055 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 43 [2019-09-07 10:21:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:18,055 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-09-07 10:21:18,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 10:21:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-09-07 10:21:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 10:21:18,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:18,057 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:18,057 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1113297339, now seen corresponding path program 3 times [2019-09-07 10:21:18,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:18,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:18,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:18,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:18,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 10:21:18,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:18,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:18,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:21:18,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 10:21:18,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:18,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:21:18,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:18,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:21:18,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:21:18,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:21:18,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:21:18,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-09-07 10:21:18,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-09-07 10:21:18,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:21:18,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:21:18,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:21:18,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-09-07 10:21:18,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:18,340 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-09-07 10:21:18,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 51 [2019-09-07 10:21:18,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:21:18,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:21:18,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:21:18,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-07 10:21:20,537 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_26 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|)) (.cse3 (* (- 4) v_main_~i~0_26)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|)) (.cse1 (* 4 v_main_~i~0_26))) (and (< v_main_~i~0_26 100000) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)) (<= 99999 v_main_~i~0_26) (= (select .cse0 (+ .cse1 |v_main_~#b~0.offset_BEFORE_CALL_1| (- 4))) (select .cse2 (+ .cse3 400000))) (= (select .cse2 (+ .cse3 399996)) (select .cse0 (+ .cse1 |v_main_~#b~0.offset_BEFORE_CALL_1|)))))) is different from true [2019-09-07 10:21:22,570 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-09-07 10:21:24,605 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 36 [2019-09-07 10:21:24,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:24,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:24,736 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:21:24,758 INFO L341 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2019-09-07 10:21:24,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 42 [2019-09-07 10:21:24,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-07 10:21:24,774 INFO L567 ElimStorePlain]: treesize reduction 12, result has 53.8 percent of original size [2019-09-07 10:21:24,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:21:24,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:66, output treesize:3 [2019-09-07 10:21:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 1 not checked. [2019-09-07 10:21:26,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:26,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 23 [2019-09-07 10:21:26,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:21:26,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:21:26,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=388, Unknown=2, NotChecked=40, Total=506 [2019-09-07 10:21:26,876 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 23 states. [2019-09-07 10:21:33,978 WARN L188 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-07 10:21:38,032 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-07 10:21:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:40,309 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-09-07 10:21:40,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:21:40,310 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2019-09-07 10:21:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:40,311 INFO L225 Difference]: With dead ends: 97 [2019-09-07 10:21:40,312 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 10:21:40,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=440, Invalid=2011, Unknown=3, NotChecked=96, Total=2550 [2019-09-07 10:21:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 10:21:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2019-09-07 10:21:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-07 10:21:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-09-07 10:21:40,333 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 47 [2019-09-07 10:21:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:40,333 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-09-07 10:21:40,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:21:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-09-07 10:21:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 10:21:40,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:40,334 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:40,334 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:40,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:40,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1452772088, now seen corresponding path program 4 times [2019-09-07 10:21:40,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:40,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:40,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:40,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:40,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-07 10:21:40,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:40,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:40,498 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:21:40,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:21:40,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:40,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 10:21:40,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-07 10:21:40,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:40,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 10:21:40,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 10:21:40,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 10:21:40,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:21:40,571 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 11 states. [2019-09-07 10:21:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:40,668 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-09-07 10:21:40,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 10:21:40,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-09-07 10:21:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:40,670 INFO L225 Difference]: With dead ends: 109 [2019-09-07 10:21:40,671 INFO L226 Difference]: Without dead ends: 68 [2019-09-07 10:21:40,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 10:21:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-07 10:21:40,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-09-07 10:21:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-09-07 10:21:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-09-07 10:21:40,692 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 59 [2019-09-07 10:21:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:40,692 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-09-07 10:21:40,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 10:21:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-09-07 10:21:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 10:21:40,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:40,695 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:40,695 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:40,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:40,695 INFO L82 PathProgramCache]: Analyzing trace with hash -709862028, now seen corresponding path program 5 times [2019-09-07 10:21:40,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:40,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:40,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:40,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:40,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 64 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-07 10:21:40,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:40,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-07 10:21:40,832 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:21:41,335 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-09-07 10:21:41,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:41,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 10:21:41,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 10:21:41,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:41,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 10:21:41,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 10:21:41,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 10:21:41,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:21:41,368 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 12 states. [2019-09-07 10:21:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:41,465 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2019-09-07 10:21:41,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 10:21:41,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-09-07 10:21:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:41,467 INFO L225 Difference]: With dead ends: 115 [2019-09-07 10:21:41,467 INFO L226 Difference]: Without dead ends: 72 [2019-09-07 10:21:41,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 10:21:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-07 10:21:41,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-09-07 10:21:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-07 10:21:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-09-07 10:21:41,483 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2019-09-07 10:21:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:41,483 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-09-07 10:21:41,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 10:21:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-09-07 10:21:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 10:21:41,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:41,487 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:41,488 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:41,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:41,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1364688400, now seen corresponding path program 6 times [2019-09-07 10:21:41,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:41,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:41,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:41,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:41,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 4 proven. 81 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-07 10:21:41,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:41,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:41,636 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:21:42,033 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-07 10:21:42,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:42,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:21:42,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 10:21:42,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:42,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 10:21:42,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 10:21:42,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 10:21:42,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:21:42,070 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 13 states. [2019-09-07 10:21:42,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:42,163 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-09-07 10:21:42,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 10:21:42,163 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-09-07 10:21:42,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:42,164 INFO L225 Difference]: With dead ends: 121 [2019-09-07 10:21:42,165 INFO L226 Difference]: Without dead ends: 76 [2019-09-07 10:21:42,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 10:21:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-07 10:21:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-09-07 10:21:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-07 10:21:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-09-07 10:21:42,176 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 67 [2019-09-07 10:21:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:42,176 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-09-07 10:21:42,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 10:21:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-09-07 10:21:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 10:21:42,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:42,177 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:42,178 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:42,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2146764692, now seen corresponding path program 7 times [2019-09-07 10:21:42,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:42,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:42,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 4 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-07 10:21:42,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:42,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-07 10:21:42,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:21:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:42,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 10:21:42,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-07 10:21:42,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:42,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 10:21:42,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 10:21:42,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 10:21:42,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:21:42,391 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 14 states. [2019-09-07 10:21:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:42,482 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2019-09-07 10:21:42,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 10:21:42,483 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-09-07 10:21:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:42,484 INFO L225 Difference]: With dead ends: 127 [2019-09-07 10:21:42,484 INFO L226 Difference]: Without dead ends: 80 [2019-09-07 10:21:42,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 10:21:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-07 10:21:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-09-07 10:21:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-07 10:21:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-09-07 10:21:42,494 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 71 [2019-09-07 10:21:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:42,494 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-09-07 10:21:42,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 10:21:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-09-07 10:21:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-07 10:21:42,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:42,495 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:42,496 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:42,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:42,496 INFO L82 PathProgramCache]: Analyzing trace with hash 434290920, now seen corresponding path program 8 times [2019-09-07 10:21:42,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:42,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:42,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:42,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:21:42,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 4 proven. 121 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-09-07 10:21:42,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:42,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:21:42,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:21:42,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:21:42,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:42,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 10:21:42,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-09-07 10:21:42,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:42,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 10:21:42,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 10:21:42,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 10:21:42,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:21:42,711 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 15 states. [2019-09-07 10:21:42,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:21:42,832 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-09-07 10:21:42,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 10:21:42,832 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2019-09-07 10:21:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:21:42,833 INFO L225 Difference]: With dead ends: 133 [2019-09-07 10:21:42,833 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 10:21:42,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 10:21:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 10:21:42,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-09-07 10:21:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-07 10:21:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-09-07 10:21:42,845 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 75 [2019-09-07 10:21:42,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:21:42,845 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-09-07 10:21:42,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 10:21:42,845 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-09-07 10:21:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 10:21:42,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:21:42,846 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:21:42,846 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:21:42,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:21:42,847 INFO L82 PathProgramCache]: Analyzing trace with hash -38085788, now seen corresponding path program 9 times [2019-09-07 10:21:42,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:21:42,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:21:42,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:42,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:21:42,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:21:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:21:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 4 proven. 144 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-09-07 10:21:42,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:21:42,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-07 10:21:43,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:21:43,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-07 10:21:43,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:21:43,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 10:21:43,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:21:43,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:21:43,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:21:43,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:21:43,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:21:43,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:21:43,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-09-07 10:21:43,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:21:43,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:21:43,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:21:43,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 10:21:43,206 INFO L341 Elim1Store]: treesize reduction 58, result has 17.1 percent of original size [2019-09-07 10:21:43,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2019-09-07 10:21:43,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:21:43,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:21:43,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:21:43,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-07 10:21:43,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:43,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:43,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:43,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:43,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:43,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:43,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 78 [2019-09-07 10:21:43,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:21:43,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:21:43,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:21:43,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:76 [2019-09-07 10:21:45,616 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_74 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|)) (.cse3 (* (- 4) v_main_~i~0_74)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|)) (.cse1 (* 4 v_main_~i~0_74))) (and (<= 99999 v_main_~i~0_74) (= (select .cse0 .cse1) (select .cse2 (+ .cse3 399996))) (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select .cse2 (+ .cse3 400004)) (select .cse0 (+ .cse1 (- 8)))) (= (select .cse2 (+ .cse3 400000)) (select .cse0 (+ .cse1 (- 4)))) (< v_main_~i~0_74 100000)))) is different from true [2019-09-07 10:21:47,748 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_main_~i~0_74 Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|)) (.cse1 (* (- 4) v_main_~i~0_74)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|)) (.cse3 (* 4 v_main_~i~0_74))) (and (<= 99999 v_main_~i~0_74) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (< v_main_~i~0_74 100000)))) is different from true [2019-09-07 10:21:49,801 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2019-09-07 10:21:51,836 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 41 [2019-09-07 10:21:51,979 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:21:51,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:51,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:51,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:51,982 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:21:51,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:51,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:51,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:21:51,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 16 [2019-09-07 10:21:51,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:21:51,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:21:51,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:21:51,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:80, output treesize:3 [2019-09-07 10:21:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 61 proven. 11 refuted. 0 times theorem prover too weak. 225 trivial. 7 not checked. [2019-09-07 10:21:54,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:21:54,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2019-09-07 10:21:54,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:21:54,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:21:54,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=773, Unknown=3, NotChecked=118, Total=1056 [2019-09-07 10:21:54,113 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 33 states. [2019-09-07 10:22:02,604 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-09-07 10:22:06,670 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-09-07 10:22:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:22:13,322 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2019-09-07 10:22:13,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 10:22:13,322 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 79 [2019-09-07 10:22:13,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:22:13,324 INFO L225 Difference]: With dead ends: 149 [2019-09-07 10:22:13,324 INFO L226 Difference]: Without dead ends: 98 [2019-09-07 10:22:13,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=1166, Invalid=5000, Unknown=4, NotChecked=310, Total=6480 [2019-09-07 10:22:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-07 10:22:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2019-09-07 10:22:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-07 10:22:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-09-07 10:22:13,336 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 79 [2019-09-07 10:22:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:22:13,336 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-09-07 10:22:13,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:22:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-09-07 10:22:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 10:22:13,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:22:13,338 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:22:13,338 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:22:13,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:22:13,338 INFO L82 PathProgramCache]: Analyzing trace with hash 601037079, now seen corresponding path program 10 times [2019-09-07 10:22:13,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:22:13,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:22:13,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:13,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:22:13,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 6 proven. 169 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-07 10:22:13,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:22:13,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:22:13,521 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:22:13,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:22:13,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:22:13,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 10:22:13,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:22:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-09-07 10:22:13,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:22:13,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 10:22:13,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 10:22:13,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 10:22:13,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:22:13,614 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 17 states. [2019-09-07 10:22:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:22:13,748 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2019-09-07 10:22:13,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 10:22:13,749 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 91 [2019-09-07 10:22:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:22:13,750 INFO L225 Difference]: With dead ends: 161 [2019-09-07 10:22:13,750 INFO L226 Difference]: Without dead ends: 100 [2019-09-07 10:22:13,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 10:22:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-07 10:22:13,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-09-07 10:22:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-07 10:22:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-09-07 10:22:13,771 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 91 [2019-09-07 10:22:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:22:13,771 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-09-07 10:22:13,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 10:22:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-09-07 10:22:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-07 10:22:13,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:22:13,773 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:22:13,773 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:22:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:22:13,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2027199379, now seen corresponding path program 11 times [2019-09-07 10:22:13,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:22:13,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:22:13,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:13,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:22:13,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 6 proven. 196 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-09-07 10:22:13,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:22:13,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-09-07 10:22:13,986 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:22:25,431 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-09-07 10:22:25,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:22:25,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 10:22:25,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:22:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-09-07 10:22:25,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:22:25,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 10:22:25,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 10:22:25,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 10:22:25,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:22:25,471 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 18 states. [2019-09-07 10:22:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:22:25,599 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2019-09-07 10:22:25,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 10:22:25,600 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2019-09-07 10:22:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:22:25,601 INFO L225 Difference]: With dead ends: 167 [2019-09-07 10:22:25,601 INFO L226 Difference]: Without dead ends: 104 [2019-09-07 10:22:25,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 10:22:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-07 10:22:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2019-09-07 10:22:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-07 10:22:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-09-07 10:22:25,613 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 95 [2019-09-07 10:22:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:22:25,615 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-09-07 10:22:25,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 10:22:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-09-07 10:22:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 10:22:25,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:22:25,617 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:22:25,617 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:22:25,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:22:25,617 INFO L82 PathProgramCache]: Analyzing trace with hash -2147127281, now seen corresponding path program 12 times [2019-09-07 10:22:25,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:22:25,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:22:25,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:25,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:22:25,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 6 proven. 225 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-07 10:22:25,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:22:25,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:22:25,791 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:22:26,687 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-09-07 10:22:26,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:22:26,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:22:26,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:22:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-09-07 10:22:26,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:22:26,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 10:22:26,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 10:22:26,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 10:22:26,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:22:26,719 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 19 states. [2019-09-07 10:22:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:22:26,848 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2019-09-07 10:22:26,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 10:22:26,848 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 99 [2019-09-07 10:22:26,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:22:26,850 INFO L225 Difference]: With dead ends: 173 [2019-09-07 10:22:26,850 INFO L226 Difference]: Without dead ends: 108 [2019-09-07 10:22:26,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 10:22:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-07 10:22:26,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-09-07 10:22:26,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-07 10:22:26,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-09-07 10:22:26,860 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 99 [2019-09-07 10:22:26,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:22:26,860 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-09-07 10:22:26,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 10:22:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-09-07 10:22:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 10:22:26,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:22:26,861 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:22:26,862 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:22:26,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:22:26,862 INFO L82 PathProgramCache]: Analyzing trace with hash -974088565, now seen corresponding path program 13 times [2019-09-07 10:22:26,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:22:26,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:22:26,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:26,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:22:26,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 6 proven. 256 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-09-07 10:22:27,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:22:27,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-07 10:22:27,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:22:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:27,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 10:22:27,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:22:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-09-07 10:22:27,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:22:27,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 10:22:27,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 10:22:27,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 10:22:27,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:22:27,152 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 20 states. [2019-09-07 10:22:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:22:27,263 INFO L93 Difference]: Finished difference Result 179 states and 184 transitions. [2019-09-07 10:22:27,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 10:22:27,263 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2019-09-07 10:22:27,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:22:27,264 INFO L225 Difference]: With dead ends: 179 [2019-09-07 10:22:27,264 INFO L226 Difference]: Without dead ends: 112 [2019-09-07 10:22:27,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 10:22:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-07 10:22:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-09-07 10:22:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-07 10:22:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-09-07 10:22:27,275 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 103 [2019-09-07 10:22:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:22:27,276 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-09-07 10:22:27,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 10:22:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-09-07 10:22:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 10:22:27,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:22:27,277 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:22:27,277 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:22:27,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:22:27,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2002710777, now seen corresponding path program 14 times [2019-09-07 10:22:27,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:22:27,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:22:27,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:27,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:22:27,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 6 proven. 289 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-07 10:22:27,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:22:27,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:22:27,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:22:27,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:22:27,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:22:27,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 10:22:27,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:22:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-09-07 10:22:27,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:22:27,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 10:22:27,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 10:22:27,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 10:22:27,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:22:27,580 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 21 states. [2019-09-07 10:22:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:22:27,742 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2019-09-07 10:22:27,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 10:22:27,742 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 107 [2019-09-07 10:22:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:22:27,744 INFO L225 Difference]: With dead ends: 185 [2019-09-07 10:22:27,744 INFO L226 Difference]: Without dead ends: 116 [2019-09-07 10:22:27,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 10:22:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-07 10:22:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2019-09-07 10:22:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-07 10:22:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-09-07 10:22:27,756 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 107 [2019-09-07 10:22:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:22:27,756 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-09-07 10:22:27,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 10:22:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-09-07 10:22:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-07 10:22:27,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:22:27,757 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:22:27,758 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:22:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:22:27,758 INFO L82 PathProgramCache]: Analyzing trace with hash 933353859, now seen corresponding path program 15 times [2019-09-07 10:22:27,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:22:27,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:22:27,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:27,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:22:27,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:22:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:22:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 324 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-09-07 10:22:27,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:22:27,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:22:27,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:22:28,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 10:22:28,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:22:28,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 10:22:28,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:22:28,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:22:28,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:22:28,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:22:28,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:22:28,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:22:28,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-09-07 10:22:28,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:22:28,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:22:28,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:22:28,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 10:22:28,220 INFO L341 Elim1Store]: treesize reduction 58, result has 17.1 percent of original size [2019-09-07 10:22:28,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2019-09-07 10:22:28,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:22:28,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:22:28,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:22:28,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-07 10:22:28,335 INFO L341 Elim1Store]: treesize reduction 150, result has 14.3 percent of original size [2019-09-07 10:22:28,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 78 [2019-09-07 10:22:28,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:22:28,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:22:28,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:22:28,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2019-09-07 10:22:28,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:28,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:28,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:28,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:28,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:28,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:28,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:28,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:28,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:28,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:28,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:28,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:28,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 105 [2019-09-07 10:22:28,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:22:28,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:22:28,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:22:28,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:97 [2019-09-07 10:22:30,688 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_main_~i~0_153 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|)) (.cse3 (* 4 v_main_~i~0_153)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|)) (.cse1 (* (- 4) v_main_~i~0_153))) (and (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (not (= |v_main_~#b~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (< v_main_~i~0_153 100000) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (<= 99999 v_main_~i~0_153) (= (select .cse2 (+ .cse3 (- 8))) (select .cse0 (+ .cse1 400004)))))) is different from true [2019-09-07 10:22:32,877 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_main_~i~0_153 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|)) (.cse1 (* (- 4) v_main_~i~0_153)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|)) (.cse3 (* 4 v_main_~i~0_153))) (and (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (< v_main_~i~0_153 100000) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (<= 99999 v_main_~i~0_153) (not (= |v_main_~#b~0.base_BEFORE_CALL_5| |v_main_~#a~0.base_BEFORE_CALL_5|)) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8))))))) is different from true [2019-09-07 10:22:35,081 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_153 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|)) (.cse3 (* (- 4) v_main_~i~0_153)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|)) (.cse1 (* 4 v_main_~i~0_153))) (and (= (select .cse0 .cse1) (select .cse2 (+ .cse3 399996))) (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#a~0.base_BEFORE_CALL_6|)) (= (select .cse0 (+ .cse1 (- 4))) (select .cse2 (+ .cse3 400000))) (< v_main_~i~0_153 100000) (= (select .cse0 (+ .cse1 (- 8))) (select .cse2 (+ .cse3 400004))) (<= 99999 v_main_~i~0_153) (= (select .cse2 (+ .cse3 400008)) (select .cse0 (+ .cse1 (- 12))))))) is different from true [2019-09-07 10:22:37,146 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 47 [2019-09-07 10:22:39,194 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 48 [2019-09-07 10:22:39,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:39,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:39,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:39,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:39,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:39,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:39,375 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:22:39,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:39,377 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:22:39,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:39,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:39,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:39,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:39,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:39,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:22:39,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 13 disjoint index pairs (out of 45 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 19 [2019-09-07 10:22:39,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:22:39,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:22:39,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:22:39,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:99, output treesize:3 [2019-09-07 10:22:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 125 proven. 22 refuted. 0 times theorem prover too weak. 520 trivial. 17 not checked. [2019-09-07 10:22:41,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:22:41,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 43 [2019-09-07 10:22:41,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 10:22:41,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 10:22:41,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1281, Unknown=4, NotChecked=234, Total=1806 [2019-09-07 10:22:41,538 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 43 states. [2019-09-07 10:22:51,637 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-07 10:22:55,719 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-07 10:23:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:23:05,040 INFO L93 Difference]: Finished difference Result 201 states and 207 transitions. [2019-09-07 10:23:05,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-07 10:23:05,041 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 111 [2019-09-07 10:23:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:23:05,042 INFO L225 Difference]: With dead ends: 201 [2019-09-07 10:23:05,042 INFO L226 Difference]: Without dead ends: 130 [2019-09-07 10:23:05,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 109 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3522 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=2259, Invalid=9304, Unknown=5, NotChecked=642, Total=12210 [2019-09-07 10:23:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-07 10:23:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-09-07 10:23:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-07 10:23:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-09-07 10:23:05,057 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 111 [2019-09-07 10:23:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:23:05,058 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-09-07 10:23:05,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 10:23:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-09-07 10:23:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-07 10:23:05,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:23:05,059 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:23:05,059 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:23:05,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:23:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash -504481738, now seen corresponding path program 16 times [2019-09-07 10:23:05,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:23:05,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:23:05,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:05,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:23:05,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:23:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 361 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2019-09-07 10:23:05,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:23:05,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:23:05,303 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:23:05,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:23:05,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:23:05,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 10:23:05,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:23:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-09-07 10:23:05,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:23:05,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 10:23:05,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 10:23:05,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 10:23:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:23:05,387 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 23 states. [2019-09-07 10:23:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:23:05,551 INFO L93 Difference]: Finished difference Result 213 states and 218 transitions. [2019-09-07 10:23:05,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 10:23:05,552 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 123 [2019-09-07 10:23:05,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:23:05,553 INFO L225 Difference]: With dead ends: 213 [2019-09-07 10:23:05,553 INFO L226 Difference]: Without dead ends: 132 [2019-09-07 10:23:05,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 10:23:05,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-07 10:23:05,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-09-07 10:23:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-09-07 10:23:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2019-09-07 10:23:05,567 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 123 [2019-09-07 10:23:05,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:23:05,567 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2019-09-07 10:23:05,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 10:23:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2019-09-07 10:23:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 10:23:05,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:23:05,569 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:23:05,569 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:23:05,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:23:05,569 INFO L82 PathProgramCache]: Analyzing trace with hash -720868686, now seen corresponding path program 17 times [2019-09-07 10:23:05,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:23:05,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:23:05,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:05,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:23:05,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:23:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:23:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 8 proven. 400 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2019-09-07 10:23:05,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:23:05,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-07 10:23:05,851 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:24:20,087 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-09-07 10:24:20,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:24:20,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 10:24:20,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-09-07 10:24:20,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:24:20,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 10:24:20,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 10:24:20,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 10:24:20,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:24:20,162 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 24 states. [2019-09-07 10:24:20,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:24:20,299 INFO L93 Difference]: Finished difference Result 219 states and 224 transitions. [2019-09-07 10:24:20,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 10:24:20,300 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2019-09-07 10:24:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:24:20,301 INFO L225 Difference]: With dead ends: 219 [2019-09-07 10:24:20,301 INFO L226 Difference]: Without dead ends: 136 [2019-09-07 10:24:20,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 10:24:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-07 10:24:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-09-07 10:24:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-07 10:24:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2019-09-07 10:24:20,317 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 127 [2019-09-07 10:24:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:24:20,317 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2019-09-07 10:24:20,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 10:24:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2019-09-07 10:24:20,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-07 10:24:20,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:24:20,318 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:24:20,319 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:24:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:24:20,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1767772370, now seen corresponding path program 18 times [2019-09-07 10:24:20,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:24:20,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:24:20,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:20,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:24:20,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:24:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:24:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 8 proven. 441 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2019-09-07 10:24:20,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:24:20,697 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:24:20,722 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:24:46,567 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-09-07 10:24:46,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:24:46,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 10:24:46,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:24:46,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:24:46,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:24:46,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:24:46,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:24:46,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:24:46,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-09-07 10:24:46,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:24:46,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:24:46,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:24:46,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 10:24:46,726 INFO L341 Elim1Store]: treesize reduction 58, result has 17.1 percent of original size [2019-09-07 10:24:46,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2019-09-07 10:24:46,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:24:46,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:24:46,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:24:46,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-07 10:24:46,839 INFO L341 Elim1Store]: treesize reduction 150, result has 14.3 percent of original size [2019-09-07 10:24:46,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 78 [2019-09-07 10:24:46,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:24:46,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:24:46,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:24:46,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2019-09-07 10:24:46,992 INFO L341 Elim1Store]: treesize reduction 279, result has 11.7 percent of original size [2019-09-07 10:24:46,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 88 treesize of output 105 [2019-09-07 10:24:46,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:24:47,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:24:47,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:24:47,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:94 [2019-09-07 10:24:47,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:24:47,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 21 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 132 [2019-09-07 10:24:47,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:24:47,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:24:47,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:24:47,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:122, output treesize:118 [2019-09-07 10:24:49,496 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_197 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|)) (.cse3 (* (- 4) v_main_~i~0_197)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|)) (.cse1 (* 4 v_main_~i~0_197))) (and (= (select .cse0 (+ .cse1 (- 12))) (select .cse2 (+ .cse3 400008))) (= (select .cse2 (+ .cse3 400012)) (select .cse0 (+ .cse1 (- 16)))) (= (select .cse2 (+ .cse3 399996)) (select .cse0 .cse1)) (not (= |v_main_~#b~0.base_BEFORE_CALL_7| |v_main_~#a~0.base_BEFORE_CALL_7|)) (= (select .cse0 (+ .cse1 (- 8))) (select .cse2 (+ .cse3 400004))) (< v_main_~i~0_197 100000) (= (select .cse2 (+ .cse3 400000)) (select .cse0 (+ .cse1 (- 4)))) (<= 99999 v_main_~i~0_197)))) is different from true [2019-09-07 10:24:51,715 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_197 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|)) (.cse1 (* 4 v_main_~i~0_197)) (.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|)) (.cse3 (* (- 4) v_main_~i~0_197))) (and (= (select .cse0 (+ .cse1 (- 16))) (select .cse2 (+ .cse3 400012))) (= (select .cse2 (+ .cse3 399996)) (select .cse0 .cse1)) (< v_main_~i~0_197 100000) (= (select .cse0 (+ .cse1 (- 8))) (select .cse2 (+ .cse3 400004))) (= (select .cse0 (+ .cse1 (- 12))) (select .cse2 (+ .cse3 400008))) (not (= |v_main_~#b~0.base_BEFORE_CALL_8| |v_main_~#a~0.base_BEFORE_CALL_8|)) (<= 99999 v_main_~i~0_197) (= (select .cse0 (+ .cse1 (- 4))) (select .cse2 (+ .cse3 400000)))))) is different from true [2019-09-07 10:24:53,893 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_197 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (|v_main_~#b~0.base_BEFORE_CALL_9| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_9|)) (.cse3 (* 4 v_main_~i~0_197)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|)) (.cse1 (* (- 4) v_main_~i~0_197))) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_9| |v_main_~#a~0.base_BEFORE_CALL_9|)) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (= (select .cse2 (+ .cse3 (- 16))) (select .cse0 (+ .cse1 400012))) (< v_main_~i~0_197 100000) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (= (select .cse2 (+ .cse3 (- 12))) (select .cse0 (+ .cse1 400008))) (<= 99999 v_main_~i~0_197) (= (select .cse2 .cse3) (select .cse0 (+ .cse1 399996)))))) is different from true [2019-09-07 10:24:56,065 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_197 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|)) (.cse1 (* (- 4) v_main_~i~0_197)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_10|)) (.cse3 (* 4 v_main_~i~0_197))) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_10|)) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (= (select .cse2 (+ .cse3 (- 4))) (select .cse0 (+ .cse1 400000))) (< v_main_~i~0_197 100000) (= (select .cse0 (+ .cse1 400012)) (select .cse2 (+ .cse3 (- 16)))) (<= 99999 v_main_~i~0_197) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8))))))) is different from true [2019-09-07 10:24:58,119 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-07 10:25:00,211 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-07 10:25:00,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,418 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:25:00,419 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:25:00,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:00,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 21 disjoint index pairs (out of 66 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 22 [2019-09-07 10:25:00,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:00,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:00,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:25:00,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:118, output treesize:3 [2019-09-07 10:25:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 181 proven. 37 refuted. 0 times theorem prover too weak. 697 trivial. 31 not checked. [2019-09-07 10:25:02,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:25:02,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 50 [2019-09-07 10:25:02,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 10:25:02,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 10:25:02,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1705, Unknown=5, NotChecked=364, Total=2450 [2019-09-07 10:25:02,650 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 50 states. [2019-09-07 10:25:04,131 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 10:25:04,448 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 10:25:04,694 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 10:25:05,320 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 10:25:05,922 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 10:25:06,271 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 10:25:06,987 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 10:25:07,327 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 10:25:07,668 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 10:25:08,044 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 10:25:08,545 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 10:25:08,855 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 10:25:09,339 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-09-07 10:25:16,150 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-07 10:25:20,237 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-09-07 10:25:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:32,060 INFO L93 Difference]: Finished difference Result 235 states and 241 transitions. [2019-09-07 10:25:32,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-07 10:25:32,062 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 131 [2019-09-07 10:25:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:32,062 INFO L225 Difference]: With dead ends: 235 [2019-09-07 10:25:32,063 INFO L226 Difference]: Without dead ends: 150 [2019-09-07 10:25:32,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 127 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4901 ImplicationChecksByTransitivity, 41.9s TimeCoverageRelationStatistics Valid=2972, Invalid=12538, Unknown=6, NotChecked=996, Total=16512 [2019-09-07 10:25:32,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-07 10:25:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-09-07 10:25:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-07 10:25:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2019-09-07 10:25:32,084 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 131 [2019-09-07 10:25:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:32,085 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2019-09-07 10:25:32,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 10:25:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2019-09-07 10:25:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 10:25:32,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:32,086 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:32,086 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1213387551, now seen corresponding path program 19 times [2019-09-07 10:25:32,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:32,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:32,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:32,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:25:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 10 proven. 484 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2019-09-07 10:25:32,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:25:32,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:25:32,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:25:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:32,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 10:25:32,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:25:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2019-09-07 10:25:32,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:25:32,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 10:25:32,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 10:25:32,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 10:25:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:25:32,484 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 26 states. [2019-09-07 10:25:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:32,655 INFO L93 Difference]: Finished difference Result 247 states and 252 transitions. [2019-09-07 10:25:32,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 10:25:32,655 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 143 [2019-09-07 10:25:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:32,656 INFO L225 Difference]: With dead ends: 247 [2019-09-07 10:25:32,656 INFO L226 Difference]: Without dead ends: 152 [2019-09-07 10:25:32,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 10:25:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-07 10:25:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-09-07 10:25:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-07 10:25:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-09-07 10:25:32,672 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 143 [2019-09-07 10:25:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:32,673 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-09-07 10:25:32,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 10:25:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-09-07 10:25:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 10:25:32,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:32,674 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:32,674 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:32,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:32,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1893996893, now seen corresponding path program 20 times [2019-09-07 10:25:32,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:32,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:32,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:32,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:25:32,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 10 proven. 529 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2019-09-07 10:25:32,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:25:32,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:25:33,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 10:25:33,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:25:33,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:25:33,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 10:25:33,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:25:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2019-09-07 10:25:33,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:25:33,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 10:25:33,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 10:25:33,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 10:25:33,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:25:33,094 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 27 states. [2019-09-07 10:25:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:25:33,317 INFO L93 Difference]: Finished difference Result 253 states and 258 transitions. [2019-09-07 10:25:33,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 10:25:33,317 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 147 [2019-09-07 10:25:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:25:33,318 INFO L225 Difference]: With dead ends: 253 [2019-09-07 10:25:33,318 INFO L226 Difference]: Without dead ends: 156 [2019-09-07 10:25:33,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 10:25:33,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-07 10:25:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-09-07 10:25:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-09-07 10:25:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2019-09-07 10:25:33,337 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 147 [2019-09-07 10:25:33,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:25:33,337 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2019-09-07 10:25:33,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 10:25:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2019-09-07 10:25:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-07 10:25:33,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:25:33,339 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:25:33,339 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:25:33,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:25:33,339 INFO L82 PathProgramCache]: Analyzing trace with hash -934717479, now seen corresponding path program 21 times [2019-09-07 10:25:33,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:25:33,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:25:33,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:33,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:25:33,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:25:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:25:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 10 proven. 576 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-09-07 10:25:33,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:25:33,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:25:33,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 10:25:34,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-09-07 10:25:34,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:25:34,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 10:25:34,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:25:34,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:25:34,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:34,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:34,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:25:34,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:25:34,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-09-07 10:25:34,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:34,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:34,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:25:34,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 10:25:34,842 INFO L341 Elim1Store]: treesize reduction 58, result has 17.1 percent of original size [2019-09-07 10:25:34,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2019-09-07 10:25:34,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:34,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:34,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:25:34,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-07 10:25:34,969 INFO L341 Elim1Store]: treesize reduction 150, result has 14.3 percent of original size [2019-09-07 10:25:34,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 78 [2019-09-07 10:25:34,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:34,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:34,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:25:34,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2019-09-07 10:25:35,133 INFO L341 Elim1Store]: treesize reduction 279, result has 11.7 percent of original size [2019-09-07 10:25:35,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 88 treesize of output 105 [2019-09-07 10:25:35,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:35,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:35,152 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:25:35,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:94 [2019-09-07 10:25:35,336 INFO L341 Elim1Store]: treesize reduction 444, result has 9.9 percent of original size [2019-09-07 10:25:35,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 109 treesize of output 132 [2019-09-07 10:25:35,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:35,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:35,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:25:35,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:119, output treesize:115 [2019-09-07 10:25:35,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:35,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 31 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 159 [2019-09-07 10:25:35,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:35,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:35,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:25:35,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:143, output treesize:139 [2019-09-07 10:25:37,896 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_11| Int) (|v_main_~#b~0.base_BEFORE_CALL_11| Int) (v_main_~i~0_248 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_11|)) (.cse3 (* 4 v_main_~i~0_248)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|)) (.cse1 (* (- 4) v_main_~i~0_248))) (and (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (= (select .cse2 (+ .cse3 (- 4))) (select .cse0 (+ .cse1 400000))) (= (select .cse2 (+ .cse3 (- 12))) (select .cse0 (+ .cse1 400008))) (< v_main_~i~0_248 100000) (<= 99999 v_main_~i~0_248) (= (select .cse2 (+ .cse3 (- 16))) (select .cse0 (+ .cse1 400012))) (= (select .cse0 (+ .cse1 400016)) (select .cse2 (+ .cse3 (- 20)))) (not (= |v_main_~#a~0.base_BEFORE_CALL_11| |v_main_~#b~0.base_BEFORE_CALL_11|)) (= (select .cse2 (+ .cse3 (- 8))) (select .cse0 (+ .cse1 400004)))))) is different from true [2019-09-07 10:25:40,091 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_12| Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int) (v_main_~i~0_248 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|)) (.cse3 (* (- 4) v_main_~i~0_248)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_12|)) (.cse1 (* 4 v_main_~i~0_248))) (and (= (select .cse0 (+ .cse1 (- 20))) (select .cse2 (+ .cse3 400016))) (< v_main_~i~0_248 100000) (<= 99999 v_main_~i~0_248) (= (select .cse2 (+ .cse3 400000)) (select .cse0 (+ .cse1 (- 4)))) (= (select .cse2 (+ .cse3 400004)) (select .cse0 (+ .cse1 (- 8)))) (not (= |v_main_~#a~0.base_BEFORE_CALL_12| |v_main_~#b~0.base_BEFORE_CALL_12|)) (= (select .cse2 (+ .cse3 400008)) (select .cse0 (+ .cse1 (- 12)))) (= (select .cse0 .cse1) (select .cse2 (+ .cse3 399996))) (= (select .cse2 (+ .cse3 400012)) (select .cse0 (+ .cse1 (- 16))))))) is different from true [2019-09-07 10:25:42,286 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_13| Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int) (v_main_~i~0_248 Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_13|)) (.cse1 (* 4 v_main_~i~0_248)) (.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|)) (.cse3 (* (- 4) v_main_~i~0_248))) (and (= (select .cse0 (+ .cse1 (- 20))) (select .cse2 (+ .cse3 400016))) (not (= |v_main_~#a~0.base_BEFORE_CALL_13| |v_main_~#b~0.base_BEFORE_CALL_13|)) (< v_main_~i~0_248 100000) (<= 99999 v_main_~i~0_248) (= (select .cse2 (+ .cse3 400000)) (select .cse0 (+ .cse1 (- 4)))) (= (select .cse0 (+ .cse1 (- 16))) (select .cse2 (+ .cse3 400012))) (= (select .cse2 (+ .cse3 400008)) (select .cse0 (+ .cse1 (- 12)))) (= (select .cse2 (+ .cse3 400004)) (select .cse0 (+ .cse1 (- 8)))) (= (select .cse0 .cse1) (select .cse2 (+ .cse3 399996)))))) is different from true [2019-09-07 10:25:44,518 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_14| Int) (|v_main_~#b~0.base_BEFORE_CALL_14| Int) (v_main_~i~0_248 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_14|)) (.cse3 (* (- 4) v_main_~i~0_248)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_14|)) (.cse1 (* 4 v_main_~i~0_248))) (and (= (select .cse0 (+ .cse1 (- 4))) (select .cse2 (+ .cse3 400000))) (= (select .cse0 (+ .cse1 (- 16))) (select .cse2 (+ .cse3 400012))) (= (select .cse0 (+ .cse1 (- 8))) (select .cse2 (+ .cse3 400004))) (< v_main_~i~0_248 100000) (<= 99999 v_main_~i~0_248) (= (select .cse0 (+ .cse1 (- 12))) (select .cse2 (+ .cse3 400008))) (= (select .cse0 (+ .cse1 (- 20))) (select .cse2 (+ .cse3 400016))) (= (select .cse2 (+ .cse3 399996)) (select .cse0 .cse1)) (not (= |v_main_~#a~0.base_BEFORE_CALL_14| |v_main_~#b~0.base_BEFORE_CALL_14|))))) is different from true [2019-09-07 10:25:46,723 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_15| Int) (|v_main_~#b~0.base_BEFORE_CALL_15| Int) (v_main_~i~0_248 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_15|)) (.cse3 (* (- 4) v_main_~i~0_248)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_15|)) (.cse1 (* 4 v_main_~i~0_248))) (and (= (select .cse0 (+ .cse1 (- 4))) (select .cse2 (+ .cse3 400000))) (< v_main_~i~0_248 100000) (= (select .cse2 (+ .cse3 399996)) (select .cse0 .cse1)) (<= 99999 v_main_~i~0_248) (not (= |v_main_~#a~0.base_BEFORE_CALL_15| |v_main_~#b~0.base_BEFORE_CALL_15|)) (= (select .cse0 (+ .cse1 (- 16))) (select .cse2 (+ .cse3 400012))) (= (select .cse2 (+ .cse3 400004)) (select .cse0 (+ .cse1 (- 8)))) (= (select .cse2 (+ .cse3 400008)) (select .cse0 (+ .cse1 (- 12)))) (= (select .cse2 (+ .cse3 400016)) (select .cse0 (+ .cse1 (- 20))))))) is different from true [2019-09-07 10:25:48,795 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 61 [2019-09-07 10:25:50,870 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 62 [2019-09-07 10:25:51,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,111 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:25:51,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,137 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:25:51,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:25:51,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 31 disjoint index pairs (out of 91 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 25 [2019-09-07 10:25:51,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:25:51,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:25:51,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:25:51,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:137, output treesize:3 [2019-09-07 10:25:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 247 proven. 56 refuted. 0 times theorem prover too weak. 900 trivial. 49 not checked. [2019-09-07 10:25:53,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:25:53,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 32] total 57 [2019-09-07 10:25:53,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-07 10:25:53,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-07 10:25:53,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=2189, Unknown=6, NotChecked=520, Total=3192 [2019-09-07 10:25:53,416 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand 57 states. [2019-09-07 10:26:06,515 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-09-07 10:26:10,619 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-09-07 10:26:23,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:26:23,819 INFO L93 Difference]: Finished difference Result 269 states and 275 transitions. [2019-09-07 10:26:23,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-09-07 10:26:23,819 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 151 [2019-09-07 10:26:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:26:23,821 INFO L225 Difference]: With dead ends: 269 [2019-09-07 10:26:23,821 INFO L226 Difference]: Without dead ends: 170 [2019-09-07 10:26:23,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 117 SyntacticMatches, 10 SemanticMatches, 145 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 6507 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=3782, Invalid=16253, Unknown=7, NotChecked=1420, Total=21462 [2019-09-07 10:26:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-07 10:26:23,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2019-09-07 10:26:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-09-07 10:26:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2019-09-07 10:26:23,845 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 151 [2019-09-07 10:26:23,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:26:23,846 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2019-09-07 10:26:23,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-07 10:26:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2019-09-07 10:26:23,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-07 10:26:23,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:26:23,847 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:26:23,847 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:26:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:26:23,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2034010996, now seen corresponding path program 22 times [2019-09-07 10:26:23,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:26:23,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:26:23,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:23,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:26:23,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 12 proven. 625 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2019-09-07 10:26:24,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:26:24,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:26:24,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:26:24,292 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:26:24,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:26:24,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 10:26:24,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:26:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2019-09-07 10:26:24,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:26:24,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 10:26:24,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 10:26:24,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 10:26:24,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:26:24,320 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 29 states. [2019-09-07 10:26:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:26:24,571 INFO L93 Difference]: Finished difference Result 281 states and 286 transitions. [2019-09-07 10:26:24,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 10:26:24,572 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 163 [2019-09-07 10:26:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:26:24,573 INFO L225 Difference]: With dead ends: 281 [2019-09-07 10:26:24,573 INFO L226 Difference]: Without dead ends: 172 [2019-09-07 10:26:24,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 10:26:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-07 10:26:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-09-07 10:26:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-07 10:26:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 172 transitions. [2019-09-07 10:26:24,600 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 172 transitions. Word has length 163 [2019-09-07 10:26:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:26:24,600 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 172 transitions. [2019-09-07 10:26:24,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 10:26:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 172 transitions. [2019-09-07 10:26:24,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-07 10:26:24,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:26:24,603 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:26:24,603 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:26:24,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:26:24,603 INFO L82 PathProgramCache]: Analyzing trace with hash 21633800, now seen corresponding path program 23 times [2019-09-07 10:26:24,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:26:24,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:26:24,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:24,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:26:24,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:26:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:26:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 12 proven. 676 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-09-07 10:26:25,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:26:25,009 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:26:25,019 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 10:28:50,463 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2019-09-07 10:28:50,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:28:50,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 10:28:50,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:28:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-09-07 10:28:50,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:28:50,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 10:28:50,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 10:28:50,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 10:28:50,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:28:50,577 INFO L87 Difference]: Start difference. First operand 170 states and 172 transitions. Second operand 30 states. [2019-09-07 10:28:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:28:50,812 INFO L93 Difference]: Finished difference Result 287 states and 292 transitions. [2019-09-07 10:28:50,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 10:28:50,813 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 167 [2019-09-07 10:28:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:28:50,814 INFO L225 Difference]: With dead ends: 287 [2019-09-07 10:28:50,815 INFO L226 Difference]: Without dead ends: 176 [2019-09-07 10:28:50,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 10:28:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-07 10:28:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2019-09-07 10:28:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-07 10:28:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 176 transitions. [2019-09-07 10:28:50,863 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 176 transitions. Word has length 167 [2019-09-07 10:28:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:28:50,863 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 176 transitions. [2019-09-07 10:28:50,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 10:28:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 176 transitions. [2019-09-07 10:28:50,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-07 10:28:50,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:28:50,864 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:28:50,865 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:28:50,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:28:50,865 INFO L82 PathProgramCache]: Analyzing trace with hash -684846204, now seen corresponding path program 24 times [2019-09-07 10:28:50,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:28:50,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:28:50,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:50,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:28:50,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:28:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:28:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 12 proven. 729 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-09-07 10:28:51,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:28:51,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:28:51,354 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:29:08,321 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-09-07 10:29:08,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:08,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:29:08,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2019-09-07 10:29:08,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:08,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 10:29:08,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 10:29:08,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 10:29:08,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:29:08,374 INFO L87 Difference]: Start difference. First operand 174 states and 176 transitions. Second operand 31 states. [2019-09-07 10:29:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:08,626 INFO L93 Difference]: Finished difference Result 293 states and 298 transitions. [2019-09-07 10:29:08,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 10:29:08,628 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 171 [2019-09-07 10:29:08,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:08,629 INFO L225 Difference]: With dead ends: 293 [2019-09-07 10:29:08,629 INFO L226 Difference]: Without dead ends: 180 [2019-09-07 10:29:08,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 10:29:08,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-07 10:29:08,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-09-07 10:29:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-07 10:29:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-09-07 10:29:08,656 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 171 [2019-09-07 10:29:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:08,656 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-09-07 10:29:08,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 10:29:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-09-07 10:29:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-07 10:29:08,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:08,658 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:08,658 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:08,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:08,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1241883136, now seen corresponding path program 25 times [2019-09-07 10:29:08,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:08,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:08,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:08,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:08,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1712 backedges. 12 proven. 784 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2019-09-07 10:29:09,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:09,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:29:09,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:29:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:09,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 10:29:09,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1712 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2019-09-07 10:29:09,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:09,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-07 10:29:09,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 10:29:09,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 10:29:09,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:29:09,326 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 32 states. [2019-09-07 10:29:09,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:09,558 INFO L93 Difference]: Finished difference Result 299 states and 304 transitions. [2019-09-07 10:29:09,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 10:29:09,558 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 175 [2019-09-07 10:29:09,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:09,559 INFO L225 Difference]: With dead ends: 299 [2019-09-07 10:29:09,559 INFO L226 Difference]: Without dead ends: 184 [2019-09-07 10:29:09,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 10:29:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-09-07 10:29:09,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-09-07 10:29:09,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-07 10:29:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-09-07 10:29:09,585 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 175 [2019-09-07 10:29:09,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:09,586 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-09-07 10:29:09,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 10:29:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-09-07 10:29:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-07 10:29:09,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:09,587 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:09,587 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:09,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:09,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2092563068, now seen corresponding path program 26 times [2019-09-07 10:29:09,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:09,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:09,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:09,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 10:29:09,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 12 proven. 841 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2019-09-07 10:29:10,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:10,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:29:10,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:29:10,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 10:29:10,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:10,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 10:29:10,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2019-09-07 10:29:10,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:10,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 10:29:10,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 10:29:10,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 10:29:10,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:29:10,262 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 33 states. [2019-09-07 10:29:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:29:10,540 INFO L93 Difference]: Finished difference Result 305 states and 310 transitions. [2019-09-07 10:29:10,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 10:29:10,541 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 179 [2019-09-07 10:29:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:29:10,542 INFO L225 Difference]: With dead ends: 305 [2019-09-07 10:29:10,542 INFO L226 Difference]: Without dead ends: 188 [2019-09-07 10:29:10,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 10:29:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-07 10:29:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-09-07 10:29:10,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-07 10:29:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2019-09-07 10:29:10,585 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 179 [2019-09-07 10:29:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:29:10,585 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2019-09-07 10:29:10,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 10:29:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2019-09-07 10:29:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-07 10:29:10,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:29:10,588 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:29:10,588 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:29:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:29:10,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1141380872, now seen corresponding path program 27 times [2019-09-07 10:29:10,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:29:10,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:29:10,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:10,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:29:10,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:29:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:29:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 12 proven. 900 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2019-09-07 10:29:11,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:29:11,299 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:29:11,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:29:12,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-09-07 10:29:12,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:29:12,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 10:29:12,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:29:12,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:29:12,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:12,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:12,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:29:12,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:29:12,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-09-07 10:29:12,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:12,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:12,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:29:12,143 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 10:29:12,215 INFO L341 Elim1Store]: treesize reduction 58, result has 17.1 percent of original size [2019-09-07 10:29:12,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2019-09-07 10:29:12,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:12,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:12,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:29:12,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-07 10:29:12,335 INFO L341 Elim1Store]: treesize reduction 150, result has 14.3 percent of original size [2019-09-07 10:29:12,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 78 [2019-09-07 10:29:12,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:12,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:12,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:29:12,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2019-09-07 10:29:12,492 INFO L341 Elim1Store]: treesize reduction 279, result has 11.7 percent of original size [2019-09-07 10:29:12,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 88 treesize of output 105 [2019-09-07 10:29:12,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:12,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:12,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:29:12,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:94 [2019-09-07 10:29:12,715 INFO L341 Elim1Store]: treesize reduction 444, result has 9.9 percent of original size [2019-09-07 10:29:12,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 109 treesize of output 132 [2019-09-07 10:29:12,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:12,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:12,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:29:12,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:119, output treesize:115 [2019-09-07 10:29:12,994 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 33 [2019-09-07 10:29:12,994 INFO L341 Elim1Store]: treesize reduction 645, result has 8.6 percent of original size [2019-09-07 10:29:12,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 30 case distinctions, treesize of input 130 treesize of output 159 [2019-09-07 10:29:12,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:13,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:13,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:29:13,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:140, output treesize:136 [2019-09-07 10:29:13,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:13,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 43 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 186 [2019-09-07 10:29:13,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:13,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:13,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:29:13,282 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:164, output treesize:160 [2019-09-07 10:29:15,733 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_16| Int) (|v_main_~#a~0.base_BEFORE_CALL_16| Int) (v_main_~i~0_390 Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|)) (.cse1 (* (- 4) v_main_~i~0_390)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_16|)) (.cse3 (* 4 v_main_~i~0_390))) (and (<= 99999 v_main_~i~0_390) (not (= |v_main_~#a~0.base_BEFORE_CALL_16| |v_main_~#b~0.base_BEFORE_CALL_16|)) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (= (select .cse0 (+ .cse1 400020)) (select .cse2 (+ .cse3 (- 24)))) (= (select .cse0 (+ .cse1 400016)) (select .cse2 (+ .cse3 (- 20)))) (= (select .cse2 (+ .cse3 (- 8))) (select .cse0 (+ .cse1 400004))) (= (select .cse2 .cse3) (select .cse0 (+ .cse1 399996))) (= (select .cse0 (+ .cse1 400012)) (select .cse2 (+ .cse3 (- 16)))) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (< v_main_~i~0_390 100000)))) is different from true [2019-09-07 10:29:17,957 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int) (v_main_~i~0_390 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_17|)) (.cse3 (* 4 v_main_~i~0_390)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|)) (.cse1 (* (- 4) v_main_~i~0_390))) (and (<= 99999 v_main_~i~0_390) (= (select .cse0 (+ .cse1 400012)) (select .cse2 (+ .cse3 (- 16)))) (= (select .cse0 (+ .cse1 400020)) (select .cse2 (+ .cse3 (- 24)))) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (not (= |v_main_~#a~0.base_BEFORE_CALL_17| |v_main_~#b~0.base_BEFORE_CALL_17|)) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (= (select .cse2 (+ .cse3 (- 20))) (select .cse0 (+ .cse1 400016))) (= (select .cse2 (+ .cse3 (- 12))) (select .cse0 (+ .cse1 400008))) (= (select .cse2 (+ .cse3 (- 4))) (select .cse0 (+ .cse1 400000))) (< v_main_~i~0_390 100000)))) is different from true [2019-09-07 10:29:20,200 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_18| Int) (|v_main_~#b~0.base_BEFORE_CALL_18| Int) (v_main_~i~0_390 Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_18|)) (.cse1 (* (- 4) v_main_~i~0_390)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_18|)) (.cse3 (* 4 v_main_~i~0_390))) (and (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (= (select .cse0 (+ .cse1 400020)) (select .cse2 (+ .cse3 (- 24)))) (<= 99999 v_main_~i~0_390) (= (select .cse2 (+ .cse3 (- 8))) (select .cse0 (+ .cse1 400004))) (= (select .cse2 (+ .cse3 (- 16))) (select .cse0 (+ .cse1 400012))) (= (select .cse0 (+ .cse1 400016)) (select .cse2 (+ .cse3 (- 20)))) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (not (= |v_main_~#a~0.base_BEFORE_CALL_18| |v_main_~#b~0.base_BEFORE_CALL_18|)) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (< v_main_~i~0_390 100000)))) is different from true [2019-09-07 10:29:22,434 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| Int) (|v_main_~#b~0.base_BEFORE_CALL_19| Int) (v_main_~i~0_390 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_19|)) (.cse3 (* 4 v_main_~i~0_390)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|)) (.cse1 (* (- 4) v_main_~i~0_390))) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_19| |v_main_~#b~0.base_BEFORE_CALL_19|)) (<= 99999 v_main_~i~0_390) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (= (select .cse2 (+ .cse3 (- 12))) (select .cse0 (+ .cse1 400008))) (= (select .cse2 (+ .cse3 (- 8))) (select .cse0 (+ .cse1 400004))) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (= (select .cse2 (+ .cse3 (- 16))) (select .cse0 (+ .cse1 400012))) (= (select .cse0 (+ .cse1 400016)) (select .cse2 (+ .cse3 (- 20)))) (= (select .cse2 (+ .cse3 (- 24))) (select .cse0 (+ .cse1 400020))) (< v_main_~i~0_390 100000)))) is different from true [2019-09-07 10:29:24,697 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_390 Int) (|v_main_~#b~0.base_BEFORE_CALL_20| Int) (|v_main_~#a~0.base_BEFORE_CALL_20| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_20|)) (.cse1 (* (- 4) v_main_~i~0_390)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_20|)) (.cse3 (* 4 v_main_~i~0_390))) (and (= (select .cse0 (+ .cse1 400016)) (select .cse2 (+ .cse3 (- 20)))) (= (select .cse2 .cse3) (select .cse0 (+ .cse1 399996))) (<= 99999 v_main_~i~0_390) (= (select .cse0 (+ .cse1 400020)) (select .cse2 (+ .cse3 (- 24)))) (not (= |v_main_~#a~0.base_BEFORE_CALL_20| |v_main_~#b~0.base_BEFORE_CALL_20|)) (= (select .cse2 (+ .cse3 (- 12))) (select .cse0 (+ .cse1 400008))) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (= (select .cse0 (+ .cse1 400012)) (select .cse2 (+ .cse3 (- 16)))) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (< v_main_~i~0_390 100000)))) is different from true [2019-09-07 10:29:26,950 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_390 Int) (|v_main_~#a~0.base_BEFORE_CALL_21| Int) (|v_main_~#b~0.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_21|)) (.cse1 (* (- 4) v_main_~i~0_390)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_21|)) (.cse3 (* 4 v_main_~i~0_390))) (and (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (<= 99999 v_main_~i~0_390) (= (select .cse2 (+ .cse3 (- 16))) (select .cse0 (+ .cse1 400012))) (= (select .cse2 (+ .cse3 (- 8))) (select .cse0 (+ .cse1 400004))) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (= (select .cse2 (+ .cse3 (- 24))) (select .cse0 (+ .cse1 400020))) (= (select .cse2 (+ .cse3 (- 20))) (select .cse0 (+ .cse1 400016))) (not (= |v_main_~#a~0.base_BEFORE_CALL_21| |v_main_~#b~0.base_BEFORE_CALL_21|)) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (< v_main_~i~0_390 100000)))) is different from true [2019-09-07 10:29:29,032 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 68 [2019-09-07 10:29:31,120 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 69 [2019-09-07 10:29:31,402 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:29:31,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,450 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:29:31,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:29:31,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 43 disjoint index pairs (out of 120 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 28 [2019-09-07 10:29:31,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:29:31,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:29:31,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:29:31,464 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:156, output treesize:3 [2019-09-07 10:29:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 365 proven. 79 refuted. 0 times theorem prover too weak. 1429 trivial. 71 not checked. [2019-09-07 10:29:33,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:29:33,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 67 [2019-09-07 10:29:33,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 10:29:33,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 10:29:33,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2994, Unknown=7, NotChecked=738, Total=4422 [2019-09-07 10:29:33,860 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 67 states. [2019-09-07 10:29:50,025 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 100 DAG size of output: 68 [2019-09-07 10:29:54,161 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2019-09-07 10:30:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:12,518 INFO L93 Difference]: Finished difference Result 321 states and 327 transitions. [2019-09-07 10:30:12,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-09-07 10:30:12,518 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 183 [2019-09-07 10:30:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:12,519 INFO L225 Difference]: With dead ends: 321 [2019-09-07 10:30:12,520 INFO L226 Difference]: Without dead ends: 202 [2019-09-07 10:30:12,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 144 SyntacticMatches, 12 SemanticMatches, 175 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 9615 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=5616, Invalid=23470, Unknown=8, NotChecked=2058, Total=31152 [2019-09-07 10:30:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-07 10:30:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2019-09-07 10:30:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-07 10:30:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 200 transitions. [2019-09-07 10:30:12,554 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 200 transitions. Word has length 183 [2019-09-07 10:30:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:12,554 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 200 transitions. [2019-09-07 10:30:12,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 10:30:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 200 transitions. [2019-09-07 10:30:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-07 10:30:12,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:12,555 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:12,555 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:12,555 INFO L82 PathProgramCache]: Analyzing trace with hash 940779179, now seen corresponding path program 28 times [2019-09-07 10:30:12,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:12,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:12,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:12,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:12,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2118 backedges. 14 proven. 961 refuted. 0 times theorem prover too weak. 1143 trivial. 0 not checked. [2019-09-07 10:30:13,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:13,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:30:13,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 10:30:13,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 10:30:13,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:30:13,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 10:30:13,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:30:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2118 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1157 trivial. 0 not checked. [2019-09-07 10:30:13,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:30:13,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 10:30:13,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 10:30:13,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 10:30:13,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:30:13,198 INFO L87 Difference]: Start difference. First operand 198 states and 200 transitions. Second operand 35 states. [2019-09-07 10:30:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:30:13,459 INFO L93 Difference]: Finished difference Result 333 states and 338 transitions. [2019-09-07 10:30:13,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 10:30:13,459 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 195 [2019-09-07 10:30:13,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:30:13,460 INFO L225 Difference]: With dead ends: 333 [2019-09-07 10:30:13,461 INFO L226 Difference]: Without dead ends: 204 [2019-09-07 10:30:13,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 10:30:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-07 10:30:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2019-09-07 10:30:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-07 10:30:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 204 transitions. [2019-09-07 10:30:13,494 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 204 transitions. Word has length 195 [2019-09-07 10:30:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:30:13,494 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 204 transitions. [2019-09-07 10:30:13,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 10:30:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 204 transitions. [2019-09-07 10:30:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-07 10:30:13,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:30:13,496 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:30:13,496 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:30:13,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:30:13,496 INFO L82 PathProgramCache]: Analyzing trace with hash 761429287, now seen corresponding path program 29 times [2019-09-07 10:30:13,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:30:13,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:30:13,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:13,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:30:13,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:30:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:30:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 14 proven. 1024 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2019-09-07 10:30:14,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:30:14,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 10:30:14,258 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:43,726 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-09-07 10:33:43,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:33:43,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 10:33:43,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:33:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2019-09-07 10:33:43,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 10:33:43,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 10:33:43,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 10:33:43,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 10:33:43,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:33:43,870 INFO L87 Difference]: Start difference. First operand 202 states and 204 transitions. Second operand 36 states. [2019-09-07 10:33:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 10:33:44,151 INFO L93 Difference]: Finished difference Result 339 states and 344 transitions. [2019-09-07 10:33:44,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 10:33:44,151 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 199 [2019-09-07 10:33:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 10:33:44,152 INFO L225 Difference]: With dead ends: 339 [2019-09-07 10:33:44,152 INFO L226 Difference]: Without dead ends: 208 [2019-09-07 10:33:44,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 10:33:44,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-07 10:33:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-09-07 10:33:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-07 10:33:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-09-07 10:33:44,186 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 199 [2019-09-07 10:33:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 10:33:44,187 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-09-07 10:33:44,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 10:33:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-09-07 10:33:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-07 10:33:44,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 10:33:44,188 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 10:33:44,188 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 10:33:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 10:33:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash -765516381, now seen corresponding path program 30 times [2019-09-07 10:33:44,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 10:33:44,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 10:33:44,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:44,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 10:33:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 10:33:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 10:33:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2374 backedges. 14 proven. 1089 refuted. 0 times theorem prover too weak. 1271 trivial. 0 not checked. [2019-09-07 10:33:44,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 10:33:44,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 10:33:44,775 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 10:35:18,699 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-09-07 10:35:18,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 10:35:18,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 64 conjunts are in the unsatisfiable core [2019-09-07 10:35:18,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 10:35:18,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 10:35:18,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:18,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:18,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:18,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 10:35:18,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-09-07 10:35:18,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:18,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:18,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:18,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-09-07 10:35:18,879 INFO L341 Elim1Store]: treesize reduction 58, result has 17.1 percent of original size [2019-09-07 10:35:18,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2019-09-07 10:35:18,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:18,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:18,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:18,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-09-07 10:35:19,000 INFO L341 Elim1Store]: treesize reduction 150, result has 14.3 percent of original size [2019-09-07 10:35:19,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 78 [2019-09-07 10:35:19,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:19,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:19,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:19,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2019-09-07 10:35:19,172 INFO L341 Elim1Store]: treesize reduction 279, result has 11.7 percent of original size [2019-09-07 10:35:19,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 88 treesize of output 105 [2019-09-07 10:35:19,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:19,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:19,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:19,189 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:94 [2019-09-07 10:35:19,384 INFO L341 Elim1Store]: treesize reduction 444, result has 9.9 percent of original size [2019-09-07 10:35:19,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 109 treesize of output 132 [2019-09-07 10:35:19,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:19,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:19,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:19,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:119, output treesize:115 [2019-09-07 10:35:19,654 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 33 [2019-09-07 10:35:19,654 INFO L341 Elim1Store]: treesize reduction 645, result has 8.6 percent of original size [2019-09-07 10:35:19,655 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 30 case distinctions, treesize of input 130 treesize of output 159 [2019-09-07 10:35:19,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:19,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:19,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:19,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:140, output treesize:136 [2019-09-07 10:35:20,030 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 38 [2019-09-07 10:35:20,031 INFO L341 Elim1Store]: treesize reduction 882, result has 7.6 percent of original size [2019-09-07 10:35:20,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 42 case distinctions, treesize of input 151 treesize of output 186 [2019-09-07 10:35:20,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:20,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:20,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:20,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:161, output treesize:157 [2019-09-07 10:35:20,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:20,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 57 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 213 [2019-09-07 10:35:20,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:20,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:20,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:20,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:185, output treesize:181 [2019-09-07 10:35:22,883 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_461 Int) (|v_main_~#a~0.base_BEFORE_CALL_22| Int) (|v_main_~#b~0.base_BEFORE_CALL_22| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_22|)) (.cse3 (* 4 v_main_~i~0_461)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_22|)) (.cse1 (* (- 4) v_main_~i~0_461))) (and (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (<= 99999 v_main_~i~0_461) (= (select .cse0 (+ .cse1 400024)) (select .cse2 (+ .cse3 (- 28)))) (= (select .cse2 (+ .cse3 (- 16))) (select .cse0 (+ .cse1 400012))) (= (select .cse2 (+ .cse3 (- 20))) (select .cse0 (+ .cse1 400016))) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (= (select .cse2 (+ .cse3 (- 12))) (select .cse0 (+ .cse1 400008))) (not (= |v_main_~#a~0.base_BEFORE_CALL_22| |v_main_~#b~0.base_BEFORE_CALL_22|)) (< v_main_~i~0_461 100000) (= (select .cse0 (+ .cse1 400020)) (select .cse2 (+ .cse3 (- 24)))) (= (select .cse2 .cse3) (select .cse0 (+ .cse1 399996)))))) is different from true [2019-09-07 10:35:25,125 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_461 Int) (|v_main_~#b~0.base_BEFORE_CALL_23| Int) (|v_main_~#a~0.base_BEFORE_CALL_23| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_23|)) (.cse1 (* 4 v_main_~i~0_461)) (.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_23|)) (.cse3 (* (- 4) v_main_~i~0_461))) (and (= (select .cse0 (+ .cse1 (- 20))) (select .cse2 (+ .cse3 400016))) (= (select .cse2 (+ .cse3 400012)) (select .cse0 (+ .cse1 (- 16)))) (= (select .cse2 (+ .cse3 400020)) (select .cse0 (+ .cse1 (- 24)))) (= (select .cse0 (+ .cse1 (- 4))) (select .cse2 (+ .cse3 400000))) (<= 99999 v_main_~i~0_461) (= (select .cse2 (+ .cse3 400024)) (select .cse0 (+ .cse1 (- 28)))) (not (= |v_main_~#a~0.base_BEFORE_CALL_23| |v_main_~#b~0.base_BEFORE_CALL_23|)) (= (select .cse2 (+ .cse3 400004)) (select .cse0 (+ .cse1 (- 8)))) (= (select .cse0 (+ .cse1 (- 12))) (select .cse2 (+ .cse3 400008))) (< v_main_~i~0_461 100000) (= (select .cse0 .cse1) (select .cse2 (+ .cse3 399996)))))) is different from true [2019-09-07 10:35:27,388 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_461 Int) (|v_main_~#b~0.base_BEFORE_CALL_24| Int) (|v_main_~#a~0.base_BEFORE_CALL_24| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_24|)) (.cse1 (* (- 4) v_main_~i~0_461)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_24|)) (.cse3 (* 4 v_main_~i~0_461))) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_24| |v_main_~#b~0.base_BEFORE_CALL_24|)) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (= (select .cse2 .cse3) (select .cse0 (+ .cse1 399996))) (= (select .cse2 (+ .cse3 (- 4))) (select .cse0 (+ .cse1 400000))) (= (select .cse2 (+ .cse3 (- 28))) (select .cse0 (+ .cse1 400024))) (<= 99999 v_main_~i~0_461) (= (select .cse0 (+ .cse1 400012)) (select .cse2 (+ .cse3 (- 16)))) (= (select .cse2 (+ .cse3 (- 12))) (select .cse0 (+ .cse1 400008))) (< v_main_~i~0_461 100000) (= (select .cse2 (+ .cse3 (- 20))) (select .cse0 (+ .cse1 400016))) (= (select .cse0 (+ .cse1 400020)) (select .cse2 (+ .cse3 (- 24))))))) is different from true [2019-09-07 10:35:29,664 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_461 Int) (|v_main_~#a~0.base_BEFORE_CALL_25| Int) (|v_main_~#b~0.base_BEFORE_CALL_25| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_25|)) (.cse1 (* (- 4) v_main_~i~0_461)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_25|)) (.cse3 (* 4 v_main_~i~0_461))) (and (= (select .cse0 (+ .cse1 400020)) (select .cse2 (+ .cse3 (- 24)))) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (= (select .cse0 (+ .cse1 400012)) (select .cse2 (+ .cse3 (- 16)))) (<= 99999 v_main_~i~0_461) (= (select .cse2 (+ .cse3 (- 28))) (select .cse0 (+ .cse1 400024))) (= (select .cse2 (+ .cse3 (- 20))) (select .cse0 (+ .cse1 400016))) (not (= |v_main_~#a~0.base_BEFORE_CALL_25| |v_main_~#b~0.base_BEFORE_CALL_25|)) (= (select .cse2 .cse3) (select .cse0 (+ .cse1 399996))) (< v_main_~i~0_461 100000) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4))))))) is different from true [2019-09-07 10:35:31,969 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_461 Int) (|v_main_~#a~0.base_BEFORE_CALL_26| Int) (|v_main_~#b~0.base_BEFORE_CALL_26| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_26|)) (.cse3 (* 4 v_main_~i~0_461)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_26|)) (.cse1 (* (- 4) v_main_~i~0_461))) (and (= (select .cse0 (+ .cse1 400016)) (select .cse2 (+ .cse3 (- 20)))) (<= 99999 v_main_~i~0_461) (= (select .cse2 (+ .cse3 (- 4))) (select .cse0 (+ .cse1 400000))) (= (select .cse2 (+ .cse3 (- 24))) (select .cse0 (+ .cse1 400020))) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (= (select .cse2 .cse3) (select .cse0 (+ .cse1 399996))) (< v_main_~i~0_461 100000) (= (select .cse2 (+ .cse3 (- 16))) (select .cse0 (+ .cse1 400012))) (= (select .cse2 (+ .cse3 (- 28))) (select .cse0 (+ .cse1 400024))) (not (= |v_main_~#a~0.base_BEFORE_CALL_26| |v_main_~#b~0.base_BEFORE_CALL_26|))))) is different from true [2019-09-07 10:35:34,302 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_461 Int) (|v_main_~#b~0.base_BEFORE_CALL_27| Int) (|v_main_~#a~0.base_BEFORE_CALL_27| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_27|)) (.cse3 (* 4 v_main_~i~0_461)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_27|)) (.cse1 (* (- 4) v_main_~i~0_461))) (and (= (select .cse0 (+ .cse1 400016)) (select .cse2 (+ .cse3 (- 20)))) (not (= |v_main_~#a~0.base_BEFORE_CALL_27| |v_main_~#b~0.base_BEFORE_CALL_27|)) (= (select .cse0 (+ .cse1 400012)) (select .cse2 (+ .cse3 (- 16)))) (<= 99999 v_main_~i~0_461) (= (select .cse0 (+ .cse1 400020)) (select .cse2 (+ .cse3 (- 24)))) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (= (select .cse2 (+ .cse3 (- 28))) (select .cse0 (+ .cse1 400024))) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (< v_main_~i~0_461 100000) (= (select .cse2 (+ .cse3 (- 4))) (select .cse0 (+ .cse1 400000))) (= (select .cse2 (+ .cse3 (- 12))) (select .cse0 (+ .cse1 400008)))))) is different from true [2019-09-07 10:35:36,598 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_461 Int) (|v_main_~#b~0.base_BEFORE_CALL_28| Int) (|v_main_~#a~0.base_BEFORE_CALL_28| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_28|)) (.cse1 (* (- 4) v_main_~i~0_461)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_28|)) (.cse3 (* 4 v_main_~i~0_461))) (and (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (<= 99999 v_main_~i~0_461) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (= (select .cse0 (+ .cse1 400020)) (select .cse2 (+ .cse3 (- 24)))) (= (select .cse0 (+ .cse1 400016)) (select .cse2 (+ .cse3 (- 20)))) (not (= |v_main_~#a~0.base_BEFORE_CALL_28| |v_main_~#b~0.base_BEFORE_CALL_28|)) (= (select .cse2 (+ .cse3 (- 16))) (select .cse0 (+ .cse1 400012))) (= (select .cse0 (+ .cse1 400024)) (select .cse2 (+ .cse3 (- 28)))) (= (select .cse2 (+ .cse3 (- 8))) (select .cse0 (+ .cse1 400004))) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (< v_main_~i~0_461 100000)))) is different from true [2019-09-07 10:35:38,703 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 75 [2019-09-07 10:35:40,804 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 76 [2019-09-07 10:35:41,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,152 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:35:41,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,196 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-07 10:35:41,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-07 10:35:41,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 57 disjoint index pairs (out of 153 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 31 [2019-09-07 10:35:41,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 10:35:41,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 10:35:41,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 10:35:41,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:175, output treesize:3