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_partial_init_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 17:46:58,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 17:46:58,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 17:46:58,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 17:46:58,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 17:46:58,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 17:46:58,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 17:46:58,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 17:46:58,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 17:46:58,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 17:46:58,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 17:46:58,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 17:46:58,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 17:46:58,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 17:46:58,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 17:46:58,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 17:46:58,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 17:46:58,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 17:46:58,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 17:46:58,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 17:46:58,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 17:46:58,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 17:46:58,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 17:46:58,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 17:46:58,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 17:46:58,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 17:46:58,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 17:46:58,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 17:46:58,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 17:46:58,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 17:46:58,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 17:46:58,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 17:46:58,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 17:46:58,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 17:46:58,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 17:46:58,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 17:46:58,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 17:46:58,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 17:46:58,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 17:46:58,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 17:46:58,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 17:46:58,575 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-10-13 17:46:58,591 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 17:46:58,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 17:46:58,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 17:46:58,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 17:46:58,593 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 17:46:58,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 17:46:58,593 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 17:46:58,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 17:46:58,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 17:46:58,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 17:46:58,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 17:46:58,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 17:46:58,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 17:46:58,595 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 17:46:58,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 17:46:58,596 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 17:46:58,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 17:46:58,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 17:46:58,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 17:46:58,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 17:46:58,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 17:46:58,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 17:46:58,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 17:46:58,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 17:46:58,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 17:46:58,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 17:46:58,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 17:46:58,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 17:46:58,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 17:46:58,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 17:46:58,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 17:46:58,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 17:46:58,892 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 17:46:58,892 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 17:46:58,893 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partial_init_ground.i [2019-10-13 17:46:58,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e158c09/2af03b3b1bf3478b95eba77a314eeb25/FLAGaa5b7cb7a [2019-10-13 17:46:59,378 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 17:46:59,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partial_init_ground.i [2019-10-13 17:46:59,385 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e158c09/2af03b3b1bf3478b95eba77a314eeb25/FLAGaa5b7cb7a [2019-10-13 17:46:59,795 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43e158c09/2af03b3b1bf3478b95eba77a314eeb25 [2019-10-13 17:46:59,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 17:46:59,807 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 17:46:59,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 17:46:59,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 17:46:59,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 17:46:59,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:59" (1/1) ... [2019-10-13 17:46:59,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2b4d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:59, skipping insertion in model container [2019-10-13 17:46:59,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:59" (1/1) ... [2019-10-13 17:46:59,823 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 17:46:59,840 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 17:47:00,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:47:00,033 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 17:47:00,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 17:47:00,070 INFO L192 MainTranslator]: Completed translation [2019-10-13 17:47:00,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:00 WrapperNode [2019-10-13 17:47:00,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 17:47:00,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 17:47:00,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 17:47:00,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 17:47:00,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:00" (1/1) ... [2019-10-13 17:47:00,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:00" (1/1) ... [2019-10-13 17:47:00,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:00" (1/1) ... [2019-10-13 17:47:00,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:00" (1/1) ... [2019-10-13 17:47:00,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:00" (1/1) ... [2019-10-13 17:47:00,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:00" (1/1) ... [2019-10-13 17:47:00,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:00" (1/1) ... [2019-10-13 17:47:00,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 17:47:00,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 17:47:00,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 17:47:00,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 17:47:00,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:00" (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-10-13 17:47:00,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 17:47:00,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 17:47:00,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 17:47:00,254 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 17:47:00,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 17:47:00,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 17:47:00,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 17:47:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 17:47:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 17:47:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 17:47:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 17:47:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 17:47:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 17:47:00,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 17:47:00,564 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 17:47:00,565 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 17:47:00,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:47:00 BoogieIcfgContainer [2019-10-13 17:47:00,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 17:47:00,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 17:47:00,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 17:47:00,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 17:47:00,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:46:59" (1/3) ... [2019-10-13 17:47:00,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45721ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:47:00, skipping insertion in model container [2019-10-13 17:47:00,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:47:00" (2/3) ... [2019-10-13 17:47:00,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45721ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:47:00, skipping insertion in model container [2019-10-13 17:47:00,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:47:00" (3/3) ... [2019-10-13 17:47:00,574 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_partial_init_ground.i [2019-10-13 17:47:00,583 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 17:47:00,590 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 17:47:00,601 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 17:47:00,623 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 17:47:00,623 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 17:47:00,623 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 17:47:00,623 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 17:47:00,623 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 17:47:00,624 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 17:47:00,624 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 17:47:00,624 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 17:47:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-10-13 17:47:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 17:47:00,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:00,645 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:00,647 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:00,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:00,652 INFO L82 PathProgramCache]: Analyzing trace with hash -267634740, now seen corresponding path program 1 times [2019-10-13 17:47:00,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:00,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021960391] [2019-10-13 17:47:00,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:00,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:00,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:47:00,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021960391] [2019-10-13 17:47:00,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:47:00,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 17:47:00,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780915565] [2019-10-13 17:47:00,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 17:47:00,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:00,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 17:47:00,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 17:47:00,854 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-10-13 17:47:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:00,974 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2019-10-13 17:47:00,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 17:47:00,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 17:47:00,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:00,986 INFO L225 Difference]: With dead ends: 58 [2019-10-13 17:47:00,986 INFO L226 Difference]: Without dead ends: 28 [2019-10-13 17:47:00,990 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-13 17:47:01,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-13 17:47:01,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-13 17:47:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 17:47:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-10-13 17:47:01,035 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 15 [2019-10-13 17:47:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:01,036 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-10-13 17:47:01,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 17:47:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-10-13 17:47:01,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 17:47:01,038 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:01,038 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:01,039 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:01,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:01,040 INFO L82 PathProgramCache]: Analyzing trace with hash 814551547, now seen corresponding path program 1 times [2019-10-13 17:47:01,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:01,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930748173] [2019-10-13 17:47:01,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:01,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:01,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 17:47:01,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930748173] [2019-10-13 17:47:01,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:47:01,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 17:47:01,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18077607] [2019-10-13 17:47:01,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 17:47:01,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:01,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 17:47:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 17:47:01,119 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2019-10-13 17:47:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:01,253 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2019-10-13 17:47:01,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 17:47:01,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-13 17:47:01,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:01,255 INFO L225 Difference]: With dead ends: 53 [2019-10-13 17:47:01,255 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 17:47:01,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 17:47:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 17:47:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-10-13 17:47:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 17:47:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-13 17:47:01,272 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 15 [2019-10-13 17:47:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:01,272 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-13 17:47:01,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 17:47:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-13 17:47:01,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 17:47:01,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:01,277 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:01,277 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:01,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:01,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1658683186, now seen corresponding path program 1 times [2019-10-13 17:47:01,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:01,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400843808] [2019-10-13 17:47:01,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:01,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:01,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 17:47:01,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400843808] [2019-10-13 17:47:01,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 17:47:01,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 17:47:01,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153841164] [2019-10-13 17:47:01,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 17:47:01,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:01,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 17:47:01,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:47:01,409 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-10-13 17:47:01,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:01,504 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-10-13 17:47:01,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 17:47:01,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-13 17:47:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:01,507 INFO L225 Difference]: With dead ends: 52 [2019-10-13 17:47:01,507 INFO L226 Difference]: Without dead ends: 33 [2019-10-13 17:47:01,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 17:47:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-13 17:47:01,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-13 17:47:01,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 17:47:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-13 17:47:01,515 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 20 [2019-10-13 17:47:01,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:01,516 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-13 17:47:01,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 17:47:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-10-13 17:47:01,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 17:47:01,517 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:01,517 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:01,517 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:01,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:01,518 INFO L82 PathProgramCache]: Analyzing trace with hash 978624816, now seen corresponding path program 1 times [2019-10-13 17:47:01,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:01,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450275484] [2019-10-13 17:47:01,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:01,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:01,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:47:01,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450275484] [2019-10-13 17:47:01,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714033066] [2019-10-13 17:47:01,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:01,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 17:47:01,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 17:47:01,726 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:01,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-10-13 17:47:01,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983897479] [2019-10-13 17:47:01,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 17:47:01,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:01,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 17:47:01,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:47:01,729 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 6 states. [2019-10-13 17:47:01,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:01,826 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2019-10-13 17:47:01,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 17:47:01,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-13 17:47:01,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:01,828 INFO L225 Difference]: With dead ends: 68 [2019-10-13 17:47:01,828 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 17:47:01,829 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 17:47:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 17:47:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2019-10-13 17:47:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 17:47:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-10-13 17:47:01,836 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 20 [2019-10-13 17:47:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:01,836 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-10-13 17:47:01,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 17:47:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-10-13 17:47:01,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 17:47:01,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:01,838 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:02,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:02,042 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:02,044 INFO L82 PathProgramCache]: Analyzing trace with hash 685876501, now seen corresponding path program 1 times [2019-10-13 17:47:02,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:02,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62568273] [2019-10-13 17:47:02,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:02,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:02,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 17:47:02,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62568273] [2019-10-13 17:47:02,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000854943] [2019-10-13 17:47:02,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:02,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 17:47:02,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 17:47:02,259 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:02,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-13 17:47:02,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765092096] [2019-10-13 17:47:02,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 17:47:02,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:02,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 17:47:02,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:47:02,262 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2019-10-13 17:47:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:02,378 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2019-10-13 17:47:02,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 17:47:02,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-10-13 17:47:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:02,380 INFO L225 Difference]: With dead ends: 80 [2019-10-13 17:47:02,380 INFO L226 Difference]: Without dead ends: 53 [2019-10-13 17:47:02,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 17:47:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-13 17:47:02,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2019-10-13 17:47:02,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 17:47:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-10-13 17:47:02,394 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 25 [2019-10-13 17:47:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:02,394 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-10-13 17:47:02,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 17:47:02,394 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-10-13 17:47:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 17:47:02,395 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:02,395 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:02,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:02,597 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2073376788, now seen corresponding path program 2 times [2019-10-13 17:47:02,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:02,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127649808] [2019-10-13 17:47:02,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:02,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:02,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 17:47:02,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127649808] [2019-10-13 17:47:02,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488176397] [2019-10-13 17:47:02,699 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:02,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 17:47:02,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:02,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 17:47:02,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 17:47:02,802 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:02,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-10-13 17:47:02,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671760091] [2019-10-13 17:47:02,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 17:47:02,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:02,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 17:47:02,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-13 17:47:02,804 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 8 states. [2019-10-13 17:47:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:02,918 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2019-10-13 17:47:02,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 17:47:02,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-10-13 17:47:02,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:02,920 INFO L225 Difference]: With dead ends: 94 [2019-10-13 17:47:02,920 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 17:47:02,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-13 17:47:02,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 17:47:02,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2019-10-13 17:47:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 17:47:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2019-10-13 17:47:02,934 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 30 [2019-10-13 17:47:02,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:02,937 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2019-10-13 17:47:02,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 17:47:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2019-10-13 17:47:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 17:47:02,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:02,939 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:03,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:03,144 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:03,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1184790065, now seen corresponding path program 3 times [2019-10-13 17:47:03,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:03,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723993085] [2019-10-13 17:47:03,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:03,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:03,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 17:47:03,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723993085] [2019-10-13 17:47:03,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285380592] [2019-10-13 17:47:03,273 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:03,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 17:47:03,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:03,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-13 17:47:03,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:03,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 17:47:03,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:03,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:03,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:03,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-10-13 17:47:03,510 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 17:47:03,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:03,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 12 [2019-10-13 17:47:03,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:03,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:03,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:03,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:12 [2019-10-13 17:47:03,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-13 17:47:03,587 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:03,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-13 17:47:03,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123188346] [2019-10-13 17:47:03,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 17:47:03,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:03,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 17:47:03,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-13 17:47:03,590 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 15 states. [2019-10-13 17:47:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:04,235 INFO L93 Difference]: Finished difference Result 149 states and 188 transitions. [2019-10-13 17:47:04,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 17:47:04,235 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2019-10-13 17:47:04,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:04,238 INFO L225 Difference]: With dead ends: 149 [2019-10-13 17:47:04,238 INFO L226 Difference]: Without dead ends: 110 [2019-10-13 17:47:04,241 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2019-10-13 17:47:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-13 17:47:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-10-13 17:47:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-13 17:47:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2019-10-13 17:47:04,257 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 35 [2019-10-13 17:47:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:04,257 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2019-10-13 17:47:04,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 17:47:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2019-10-13 17:47:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 17:47:04,259 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:04,259 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:04,463 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:04,463 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:04,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:04,464 INFO L82 PathProgramCache]: Analyzing trace with hash -919845830, now seen corresponding path program 4 times [2019-10-13 17:47:04,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:04,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688074712] [2019-10-13 17:47:04,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:04,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:04,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 17:47:04,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688074712] [2019-10-13 17:47:04,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425470886] [2019-10-13 17:47:04,563 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:04,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 17:47:04,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:04,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 17:47:04,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 17:47:04,648 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:04,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-10-13 17:47:04,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298694941] [2019-10-13 17:47:04,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 17:47:04,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:04,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 17:47:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-10-13 17:47:04,649 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand 10 states. [2019-10-13 17:47:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:04,773 INFO L93 Difference]: Finished difference Result 163 states and 207 transitions. [2019-10-13 17:47:04,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 17:47:04,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-10-13 17:47:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:04,778 INFO L225 Difference]: With dead ends: 163 [2019-10-13 17:47:04,778 INFO L226 Difference]: Without dead ends: 100 [2019-10-13 17:47:04,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-10-13 17:47:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-13 17:47:04,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2019-10-13 17:47:04,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-13 17:47:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2019-10-13 17:47:04,789 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 40 [2019-10-13 17:47:04,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:04,790 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2019-10-13 17:47:04,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 17:47:04,790 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2019-10-13 17:47:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 17:47:04,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:04,791 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:04,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:04,996 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:04,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:04,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1690639503, now seen corresponding path program 5 times [2019-10-13 17:47:04,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:04,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925259074] [2019-10-13 17:47:04,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:04,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:04,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 17:47:05,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925259074] [2019-10-13 17:47:05,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435511274] [2019-10-13 17:47:05,114 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:05,354 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-13 17:47:05,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:05,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 17:47:05,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-13 17:47:05,382 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:05,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-10-13 17:47:05,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185480199] [2019-10-13 17:47:05,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 17:47:05,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:05,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 17:47:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-10-13 17:47:05,387 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand 11 states. [2019-10-13 17:47:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:05,505 INFO L93 Difference]: Finished difference Result 183 states and 233 transitions. [2019-10-13 17:47:05,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 17:47:05,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-10-13 17:47:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:05,507 INFO L225 Difference]: With dead ends: 183 [2019-10-13 17:47:05,507 INFO L226 Difference]: Without dead ends: 111 [2019-10-13 17:47:05,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-10-13 17:47:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-13 17:47:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2019-10-13 17:47:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-13 17:47:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2019-10-13 17:47:05,518 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 45 [2019-10-13 17:47:05,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:05,518 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2019-10-13 17:47:05,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 17:47:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2019-10-13 17:47:05,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 17:47:05,520 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:05,520 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:05,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:05,730 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:05,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:05,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1288529122, now seen corresponding path program 6 times [2019-10-13 17:47:05,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:05,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320450811] [2019-10-13 17:47:05,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:05,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:05,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-13 17:47:05,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320450811] [2019-10-13 17:47:05,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879965108] [2019-10-13 17:47:05,932 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:06,110 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-13 17:47:06,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:06,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 17:47:06,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:06,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 17:47:06,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:06,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:06,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:06,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-10-13 17:47:06,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:06,214 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 23 treesize of output 22 [2019-10-13 17:47:06,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:06,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:06,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:06,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-10-13 17:47:06,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:06,315 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 17:47:06,317 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:06,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 17 [2019-10-13 17:47:06,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:06,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:06,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:06,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:12 [2019-10-13 17:47:06,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-13 17:47:06,393 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:06,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-10-13 17:47:06,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919034513] [2019-10-13 17:47:06,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 17:47:06,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:06,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 17:47:06,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-10-13 17:47:06,398 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand 20 states. [2019-10-13 17:47:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:07,844 INFO L93 Difference]: Finished difference Result 269 states and 342 transitions. [2019-10-13 17:47:07,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-13 17:47:07,845 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2019-10-13 17:47:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:07,847 INFO L225 Difference]: With dead ends: 269 [2019-10-13 17:47:07,847 INFO L226 Difference]: Without dead ends: 188 [2019-10-13 17:47:07,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=451, Invalid=2971, Unknown=0, NotChecked=0, Total=3422 [2019-10-13 17:47:07,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-13 17:47:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 130. [2019-10-13 17:47:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-13 17:47:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 163 transitions. [2019-10-13 17:47:07,864 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 163 transitions. Word has length 50 [2019-10-13 17:47:07,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:07,864 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 163 transitions. [2019-10-13 17:47:07,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 17:47:07,864 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 163 transitions. [2019-10-13 17:47:07,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 17:47:07,865 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:07,866 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:08,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:08,077 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:08,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:08,078 INFO L82 PathProgramCache]: Analyzing trace with hash -539813591, now seen corresponding path program 7 times [2019-10-13 17:47:08,078 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:08,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844359494] [2019-10-13 17:47:08,079 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:08,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:08,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-13 17:47:08,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844359494] [2019-10-13 17:47:08,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583729149] [2019-10-13 17:47:08,182 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:08,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 17:47:08,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:08,297 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-13 17:47:08,298 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:08,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-10-13 17:47:08,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802265833] [2019-10-13 17:47:08,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 17:47:08,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:08,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 17:47:08,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-13 17:47:08,300 INFO L87 Difference]: Start difference. First operand 130 states and 163 transitions. Second operand 13 states. [2019-10-13 17:47:08,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:08,415 INFO L93 Difference]: Finished difference Result 262 states and 339 transitions. [2019-10-13 17:47:08,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 17:47:08,416 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-10-13 17:47:08,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:08,417 INFO L225 Difference]: With dead ends: 262 [2019-10-13 17:47:08,417 INFO L226 Difference]: Without dead ends: 155 [2019-10-13 17:47:08,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-10-13 17:47:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-13 17:47:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2019-10-13 17:47:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-10-13 17:47:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 181 transitions. [2019-10-13 17:47:08,436 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 181 transitions. Word has length 55 [2019-10-13 17:47:08,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:08,437 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 181 transitions. [2019-10-13 17:47:08,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 17:47:08,437 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 181 transitions. [2019-10-13 17:47:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 17:47:08,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:08,438 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:08,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:08,645 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:08,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:08,645 INFO L82 PathProgramCache]: Analyzing trace with hash 996171136, now seen corresponding path program 8 times [2019-10-13 17:47:08,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:08,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908974567] [2019-10-13 17:47:08,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:08,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:08,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-13 17:47:08,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908974567] [2019-10-13 17:47:08,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277543116] [2019-10-13 17:47:08,801 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:08,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 17:47:08,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:08,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 17:47:08,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-13 17:47:08,902 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:08,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-10-13 17:47:08,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001180574] [2019-10-13 17:47:08,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 17:47:08,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:08,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 17:47:08,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-10-13 17:47:08,903 INFO L87 Difference]: Start difference. First operand 144 states and 181 transitions. Second operand 14 states. [2019-10-13 17:47:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:09,048 INFO L93 Difference]: Finished difference Result 288 states and 373 transitions. [2019-10-13 17:47:09,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 17:47:09,049 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-10-13 17:47:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:09,050 INFO L225 Difference]: With dead ends: 288 [2019-10-13 17:47:09,050 INFO L226 Difference]: Without dead ends: 169 [2019-10-13 17:47:09,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-10-13 17:47:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-13 17:47:09,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 158. [2019-10-13 17:47:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-13 17:47:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 199 transitions. [2019-10-13 17:47:09,061 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 199 transitions. Word has length 60 [2019-10-13 17:47:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:09,061 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 199 transitions. [2019-10-13 17:47:09,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 17:47:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2019-10-13 17:47:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 17:47:09,062 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:09,063 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:09,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:09,270 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:09,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:09,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2076215877, now seen corresponding path program 9 times [2019-10-13 17:47:09,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:09,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916773440] [2019-10-13 17:47:09,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:09,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:09,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-13 17:47:09,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916773440] [2019-10-13 17:47:09,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178415137] [2019-10-13 17:47:09,447 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:09,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 17:47:09,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:09,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 17:47:09,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:09,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 17:47:09,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:09,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:09,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:09,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-10-13 17:47:09,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:09,617 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 23 treesize of output 22 [2019-10-13 17:47:09,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:09,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:09,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:09,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-10-13 17:47:09,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:09,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:09,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:09,699 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:09,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2019-10-13 17:47:09,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:09,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:09,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:09,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-10-13 17:47:09,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:09,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 17:47:09,829 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:09,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 22 [2019-10-13 17:47:09,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:09,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:09,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:09,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:12 [2019-10-13 17:47:09,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-13 17:47:09,906 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:09,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-10-13 17:47:09,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843244140] [2019-10-13 17:47:09,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 17:47:09,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:09,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 17:47:09,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-10-13 17:47:09,907 INFO L87 Difference]: Start difference. First operand 158 states and 199 transitions. Second operand 25 states. [2019-10-13 17:47:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:12,718 INFO L93 Difference]: Finished difference Result 413 states and 530 transitions. [2019-10-13 17:47:12,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-10-13 17:47:12,718 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2019-10-13 17:47:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:12,721 INFO L225 Difference]: With dead ends: 413 [2019-10-13 17:47:12,721 INFO L226 Difference]: Without dead ends: 282 [2019-10-13 17:47:12,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2669 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=990, Invalid=8130, Unknown=0, NotChecked=0, Total=9120 [2019-10-13 17:47:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-13 17:47:12,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 195. [2019-10-13 17:47:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-13 17:47:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 248 transitions. [2019-10-13 17:47:12,736 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 248 transitions. Word has length 65 [2019-10-13 17:47:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:12,736 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 248 transitions. [2019-10-13 17:47:12,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 17:47:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 248 transitions. [2019-10-13 17:47:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-13 17:47:12,738 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:12,738 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:12,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:12,943 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:12,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1135497178, now seen corresponding path program 10 times [2019-10-13 17:47:12,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:12,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227670931] [2019-10-13 17:47:12,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:12,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:12,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 17:47:13,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227670931] [2019-10-13 17:47:13,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878791143] [2019-10-13 17:47:13,117 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:13,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 17:47:13,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:13,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-13 17:47:13,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-10-13 17:47:13,218 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:13,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 16 [2019-10-13 17:47:13,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302386894] [2019-10-13 17:47:13,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-13 17:47:13,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:13,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-13 17:47:13,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-10-13 17:47:13,220 INFO L87 Difference]: Start difference. First operand 195 states and 248 transitions. Second operand 16 states. [2019-10-13 17:47:13,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:13,416 INFO L93 Difference]: Finished difference Result 391 states and 511 transitions. [2019-10-13 17:47:13,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 17:47:13,417 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 70 [2019-10-13 17:47:13,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:13,419 INFO L225 Difference]: With dead ends: 391 [2019-10-13 17:47:13,419 INFO L226 Difference]: Without dead ends: 225 [2019-10-13 17:47:13,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-10-13 17:47:13,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-10-13 17:47:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 212. [2019-10-13 17:47:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-13 17:47:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 270 transitions. [2019-10-13 17:47:13,430 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 270 transitions. Word has length 70 [2019-10-13 17:47:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:13,431 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 270 transitions. [2019-10-13 17:47:13,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-13 17:47:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 270 transitions. [2019-10-13 17:47:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-13 17:47:13,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:13,432 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:13,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:13,636 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:13,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:13,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2116065059, now seen corresponding path program 11 times [2019-10-13 17:47:13,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:13,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297407503] [2019-10-13 17:47:13,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:13,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:13,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-13 17:47:13,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297407503] [2019-10-13 17:47:13,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710374278] [2019-10-13 17:47:13,820 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:19,027 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-10-13 17:47:19,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:19,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 17:47:19,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-13 17:47:19,058 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:19,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 17 [2019-10-13 17:47:19,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490015035] [2019-10-13 17:47:19,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 17:47:19,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:19,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 17:47:19,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-10-13 17:47:19,060 INFO L87 Difference]: Start difference. First operand 212 states and 270 transitions. Second operand 17 states. [2019-10-13 17:47:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:19,219 INFO L93 Difference]: Finished difference Result 423 states and 553 transitions. [2019-10-13 17:47:19,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 17:47:19,219 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2019-10-13 17:47:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:19,222 INFO L225 Difference]: With dead ends: 423 [2019-10-13 17:47:19,222 INFO L226 Difference]: Without dead ends: 242 [2019-10-13 17:47:19,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-10-13 17:47:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-10-13 17:47:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 229. [2019-10-13 17:47:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-13 17:47:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 292 transitions. [2019-10-13 17:47:19,233 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 292 transitions. Word has length 75 [2019-10-13 17:47:19,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:19,234 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 292 transitions. [2019-10-13 17:47:19,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 17:47:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 292 transitions. [2019-10-13 17:47:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-13 17:47:19,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:19,235 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:19,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:19,440 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:19,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:19,441 INFO L82 PathProgramCache]: Analyzing trace with hash 745113354, now seen corresponding path program 12 times [2019-10-13 17:47:19,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:19,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579328578] [2019-10-13 17:47:19,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:19,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:19,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-10-13 17:47:19,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579328578] [2019-10-13 17:47:19,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038394031] [2019-10-13 17:47:19,614 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:25,044 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-13 17:47:25,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:25,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-13 17:47:25,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:25,096 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 17:47:25,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:25,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:25,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:25,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-10-13 17:47:25,188 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:25,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 51 [2019-10-13 17:47:25,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:25,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:25,213 INFO L567 ElimStorePlain]: treesize reduction 17, result has 68.5 percent of original size [2019-10-13 17:47:25,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:25,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:37 [2019-10-13 17:47:25,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:25,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:25,319 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:25,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 87 [2019-10-13 17:47:25,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:25,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:25,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:25,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:25,334 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 44 treesize of output 43 [2019-10-13 17:47:25,335 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:25,410 INFO L567 ElimStorePlain]: treesize reduction 57, result has 63.2 percent of original size [2019-10-13 17:47:25,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 17:47:25,411 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:100, output treesize:98 [2019-10-13 17:47:25,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:25,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:25,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:25,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:25,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:25,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:25,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2019-10-13 17:47:25,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:25,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:25,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:25,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:25,636 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:25,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 117 [2019-10-13 17:47:25,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:25,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:25,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:25,641 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:25,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:25,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:25,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:25,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2019-10-13 17:47:25,653 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:25,780 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-10-13 17:47:25,780 INFO L567 ElimStorePlain]: treesize reduction 116, result has 63.7 percent of original size [2019-10-13 17:47:25,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-13 17:47:25,781 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:210, output treesize:204 [2019-10-13 17:47:25,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 17:47:26,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 17:47:26,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:26,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:26,088 INFO L392 ElimStorePlain]: Different costs {12=[v_prenex_4, |#memory_int|], 20=[v_prenex_2]} [2019-10-13 17:47:26,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,098 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 17:47:26,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:26,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 33 [2019-10-13 17:47:26,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:26,243 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-10-13 17:47:26,243 INFO L567 ElimStorePlain]: treesize reduction 12, result has 95.5 percent of original size [2019-10-13 17:47:26,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,253 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 17:47:26,255 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:26,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 30 [2019-10-13 17:47:26,256 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:26,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:26,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 17:47:26,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,339 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 17:47:26,355 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:26,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 75 [2019-10-13 17:47:26,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:26,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:26,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:26,360 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:26,371 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 17:47:26,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:26,375 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:26,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 30 [2019-10-13 17:47:26,377 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:26,434 INFO L567 ElimStorePlain]: treesize reduction 30, result has 65.9 percent of original size [2019-10-13 17:47:26,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-10-13 17:47:26,435 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:323, output treesize:58 [2019-10-13 17:47:26,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 17:47:26,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:26,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:26,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:26,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-10-13 17:47:26,620 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:26,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-10-13 17:47:26,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134344747] [2019-10-13 17:47:26,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 17:47:26,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:26,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 17:47:26,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=764, Unknown=0, NotChecked=0, Total=930 [2019-10-13 17:47:26,622 INFO L87 Difference]: Start difference. First operand 229 states and 292 transitions. Second operand 31 states. [2019-10-13 17:47:27,749 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-13 17:47:28,069 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-13 17:47:28,410 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-13 17:47:28,803 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-13 17:47:29,195 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-13 17:47:29,585 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-13 17:47:29,978 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-13 17:47:30,374 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-13 17:47:30,764 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-13 17:47:31,193 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-13 17:47:31,595 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-13 17:47:32,067 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-13 17:47:32,471 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-13 17:47:32,940 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-13 17:47:33,359 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-13 17:47:33,825 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-13 17:47:34,290 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-13 17:47:34,858 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-13 17:47:35,284 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-13 17:47:35,759 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-13 17:47:36,193 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-13 17:47:36,657 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-13 17:47:37,105 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-13 17:47:37,591 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-13 17:47:38,017 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-10-13 17:47:38,183 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-10-13 17:47:38,649 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-10-13 17:47:38,912 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-10-13 17:47:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:39,824 INFO L93 Difference]: Finished difference Result 610 states and 783 transitions. [2019-10-13 17:47:39,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-10-13 17:47:39,824 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 80 [2019-10-13 17:47:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:39,827 INFO L225 Difference]: With dead ends: 610 [2019-10-13 17:47:39,827 INFO L226 Difference]: Without dead ends: 414 [2019-10-13 17:47:39,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7822 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=2206, Invalid=21050, Unknown=0, NotChecked=0, Total=23256 [2019-10-13 17:47:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-10-13 17:47:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 275. [2019-10-13 17:47:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-13 17:47:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 353 transitions. [2019-10-13 17:47:39,853 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 353 transitions. Word has length 80 [2019-10-13 17:47:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:39,853 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 353 transitions. [2019-10-13 17:47:39,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 17:47:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 353 transitions. [2019-10-13 17:47:39,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 17:47:39,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:39,854 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:40,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:40,056 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:40,056 INFO L82 PathProgramCache]: Analyzing trace with hash 351706429, now seen corresponding path program 13 times [2019-10-13 17:47:40,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:40,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250918602] [2019-10-13 17:47:40,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:40,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:40,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-13 17:47:40,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250918602] [2019-10-13 17:47:40,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131168325] [2019-10-13 17:47:40,233 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:40,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-13 17:47:40,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-10-13 17:47:40,336 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:40,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 19 [2019-10-13 17:47:40,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084048114] [2019-10-13 17:47:40,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 17:47:40,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 17:47:40,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-10-13 17:47:40,337 INFO L87 Difference]: Start difference. First operand 275 states and 353 transitions. Second operand 19 states. [2019-10-13 17:47:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:40,488 INFO L93 Difference]: Finished difference Result 550 states and 723 transitions. [2019-10-13 17:47:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 17:47:40,489 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2019-10-13 17:47:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:40,491 INFO L225 Difference]: With dead ends: 550 [2019-10-13 17:47:40,491 INFO L226 Difference]: Without dead ends: 310 [2019-10-13 17:47:40,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-10-13 17:47:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-10-13 17:47:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 295. [2019-10-13 17:47:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-13 17:47:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 379 transitions. [2019-10-13 17:47:40,511 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 379 transitions. Word has length 85 [2019-10-13 17:47:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:40,512 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 379 transitions. [2019-10-13 17:47:40,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 17:47:40,512 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 379 transitions. [2019-10-13 17:47:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 17:47:40,514 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:40,514 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:40,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:40,717 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:40,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:40,718 INFO L82 PathProgramCache]: Analyzing trace with hash 10777324, now seen corresponding path program 14 times [2019-10-13 17:47:40,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:40,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985469183] [2019-10-13 17:47:40,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:40,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:40,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:40,970 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-10-13 17:47:40,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985469183] [2019-10-13 17:47:40,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369711894] [2019-10-13 17:47:40,971 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:41,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 17:47:41,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:41,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-13 17:47:41,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-10-13 17:47:41,169 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:41,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 20 [2019-10-13 17:47:41,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403117930] [2019-10-13 17:47:41,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 17:47:41,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:41,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 17:47:41,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-10-13 17:47:41,171 INFO L87 Difference]: Start difference. First operand 295 states and 379 transitions. Second operand 20 states. [2019-10-13 17:47:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 17:47:41,408 INFO L93 Difference]: Finished difference Result 588 states and 773 transitions. [2019-10-13 17:47:41,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 17:47:41,408 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 90 [2019-10-13 17:47:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 17:47:41,410 INFO L225 Difference]: With dead ends: 588 [2019-10-13 17:47:41,410 INFO L226 Difference]: Without dead ends: 330 [2019-10-13 17:47:41,411 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-10-13 17:47:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-13 17:47:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 315. [2019-10-13 17:47:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-10-13 17:47:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 405 transitions. [2019-10-13 17:47:41,430 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 405 transitions. Word has length 90 [2019-10-13 17:47:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 17:47:41,430 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 405 transitions. [2019-10-13 17:47:41,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 17:47:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 405 transitions. [2019-10-13 17:47:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 17:47:41,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 17:47:41,432 INFO L380 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 17:47:41,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:41,636 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 17:47:41,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 17:47:41,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1827696217, now seen corresponding path program 15 times [2019-10-13 17:47:41,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 17:47:41,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885428619] [2019-10-13 17:47:41,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:41,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 17:47:41,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 17:47:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 17:47:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-10-13 17:47:41,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885428619] [2019-10-13 17:47:41,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621417668] [2019-10-13 17:47:41,893 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 17:47:42,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-13 17:47:42,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 17:47:42,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-13 17:47:42,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 17:47:42,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 17:47:42,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:42,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:42,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:42,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-10-13 17:47:42,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,558 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 26 treesize of output 25 [2019-10-13 17:47:42,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:42,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:42,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:42,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-10-13 17:47:42,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,632 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:42,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2019-10-13 17:47:42,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:42,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:42,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:42,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-10-13 17:47:42,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:42,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 59 [2019-10-13 17:47:42,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:42,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:42,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:42,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:78, output treesize:74 [2019-10-13 17:47:42,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:42,836 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:42,836 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 64 [2019-10-13 17:47:42,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:42,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:42,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:42,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:76 [2019-10-13 17:47:43,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 17:47:43,015 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 17:47:43,018 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:43,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 71 treesize of output 32 [2019-10-13 17:47:43,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 17:47:43,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 17:47:43,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 17:47:43,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:12 [2019-10-13 17:47:43,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 17:47:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2019-10-13 17:47:43,129 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 17:47:43,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2019-10-13 17:47:43,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124027185] [2019-10-13 17:47:43,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 17:47:43,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 17:47:43,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 17:47:43,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 17:47:43,131 INFO L87 Difference]: Start difference. First operand 315 states and 405 transitions. Second operand 35 states.