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/loops/eureka_05.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:29:06,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:29:06,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:29:06,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:29:06,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:29:06,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:29:06,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:29:06,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:29:06,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:29:06,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:29:06,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:29:06,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:29:06,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:29:06,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:29:06,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:29:06,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:29:06,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:29:06,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:29:06,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:29:06,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:29:06,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:29:06,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:29:06,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:29:06,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:29:06,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:29:06,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:29:06,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:29:06,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:29:06,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:29:06,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:29:06,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:29:06,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:29:06,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:29:06,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:29:06,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:29:06,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:29:06,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:29:06,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:29:06,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:29:06,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:29:06,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:29:06,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-05 11:29:07,004 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:29:07,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:29:07,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:29:07,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:29:07,006 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:29:07,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:29:07,006 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:29:07,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:29:07,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:29:07,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:29:07,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:29:07,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:29:07,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:29:07,008 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:29:07,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:29:07,008 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:29:07,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:29:07,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:29:07,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:29:07,009 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:29:07,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:29:07,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:29:07,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:29:07,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:29:07,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:29:07,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:29:07,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:29:07,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:29:07,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:29:07,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:29:07,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:29:07,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:29:07,056 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:29:07,056 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:29:07,057 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05.i [2019-09-05 11:29:07,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/710afbfc4/626779d098724a3bab11d3ef58218ea0/FLAGa667b2143 [2019-09-05 11:29:07,605 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:29:07,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i [2019-09-05 11:29:07,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/710afbfc4/626779d098724a3bab11d3ef58218ea0/FLAGa667b2143 [2019-09-05 11:29:07,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/710afbfc4/626779d098724a3bab11d3ef58218ea0 [2019-09-05 11:29:08,001 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:29:08,003 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:29:08,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:08,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:29:08,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:29:08,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:07" (1/1) ... [2019-09-05 11:29:08,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@86d38b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08, skipping insertion in model container [2019-09-05 11:29:08,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:07" (1/1) ... [2019-09-05 11:29:08,020 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:29:08,040 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:29:08,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:08,215 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:29:08,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:08,255 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:29:08,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08 WrapperNode [2019-09-05 11:29:08,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:08,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:29:08,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:29:08,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:29:08,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... [2019-09-05 11:29:08,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:29:08,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:29:08,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:29:08,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:29:08,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:29:08,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:29:08,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:29:08,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:29:08,447 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2019-09-05 11:29:08,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:29:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:29:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:29:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2019-09-05 11:29:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 11:29:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 11:29:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:29:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-05 11:29:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 11:29:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:29:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-05 11:29:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:29:08,693 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:29:08,693 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-05 11:29:08,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:08 BoogieIcfgContainer [2019-09-05 11:29:08,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:29:08,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:29:08,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:29:08,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:29:08,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:29:07" (1/3) ... [2019-09-05 11:29:08,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d93bc81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:08, skipping insertion in model container [2019-09-05 11:29:08,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:08" (2/3) ... [2019-09-05 11:29:08,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d93bc81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:08, skipping insertion in model container [2019-09-05 11:29:08,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:08" (3/3) ... [2019-09-05 11:29:08,703 INFO L109 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2019-09-05 11:29:08,714 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:29:08,747 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:29:08,794 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:29:08,842 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:29:08,843 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:29:08,843 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:29:08,843 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:29:08,843 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:29:08,844 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:29:08,844 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:29:08,844 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:29:08,844 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:29:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-09-05 11:29:08,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:29:08,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:08,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:08,870 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:08,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:08,876 INFO L82 PathProgramCache]: Analyzing trace with hash 625586084, now seen corresponding path program 1 times [2019-09-05 11:29:08,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:08,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:08,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:08,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:08,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:09,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:09,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 11:29:09,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 11:29:09,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 11:29:09,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:29:09,059 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2019-09-05 11:29:09,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:09,088 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2019-09-05 11:29:09,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 11:29:09,090 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-09-05 11:29:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:09,099 INFO L225 Difference]: With dead ends: 60 [2019-09-05 11:29:09,099 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 11:29:09,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:29:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 11:29:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-05 11:29:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 11:29:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-05 11:29:09,152 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2019-09-05 11:29:09,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:09,153 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-05 11:29:09,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 11:29:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-05 11:29:09,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:29:09,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:09,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:09,156 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:09,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:09,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2087778385, now seen corresponding path program 1 times [2019-09-05 11:29:09,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:09,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:09,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:09,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:09,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:09,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:29:09,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:29:09,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:29:09,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:29:09,264 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2019-09-05 11:29:09,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:09,324 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-09-05 11:29:09,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:29:09,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-05 11:29:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:09,327 INFO L225 Difference]: With dead ends: 52 [2019-09-05 11:29:09,327 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 11:29:09,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:29:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 11:29:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-05 11:29:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-05 11:29:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-09-05 11:29:09,338 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2019-09-05 11:29:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:09,338 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-09-05 11:29:09,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:29:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-09-05 11:29:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:29:09,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:09,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:09,340 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:09,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:09,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1482156659, now seen corresponding path program 1 times [2019-09-05 11:29:09,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:09,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:09,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:09,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:09,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:09,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:09,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-05 11:29:09,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:29:09,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:09,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-09-05 11:29:09,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:29:09,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:29:09,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:29:09,543 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2019-09-05 11:29:09,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:09,603 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-09-05 11:29:09,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:29:09,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-05 11:29:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:09,606 INFO L225 Difference]: With dead ends: 54 [2019-09-05 11:29:09,606 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 11:29:09,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:29:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 11:29:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-05 11:29:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-05 11:29:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-05 11:29:09,615 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2019-09-05 11:29:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:09,616 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-05 11:29:09,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:29:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-05 11:29:09,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 11:29:09,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:09,617 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:09,618 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:09,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:09,618 INFO L82 PathProgramCache]: Analyzing trace with hash -699737067, now seen corresponding path program 2 times [2019-09-05 11:29:09,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:09,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:09,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:09,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:09,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:09,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:09,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:09,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-05 11:29:09,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:09,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-05 11:29:09,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 11:29:09,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:29:09,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-05 11:29:09,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:29:09,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:29:09,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:29:09,798 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2019-09-05 11:29:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:09,981 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2019-09-05 11:29:09,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:29:09,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-09-05 11:29:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:09,983 INFO L225 Difference]: With dead ends: 62 [2019-09-05 11:29:09,983 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 11:29:09,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:29:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 11:29:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-09-05 11:29:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 11:29:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-05 11:29:10,002 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2019-09-05 11:29:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:10,004 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-05 11:29:10,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:29:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-05 11:29:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:29:10,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:10,006 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:10,006 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:10,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:10,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1207034289, now seen corresponding path program 1 times [2019-09-05 11:29:10,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:10,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:10,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:10,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:10,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:10,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:10,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:29:10,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:10,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:10,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-05 11:29:10,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:29:10,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:29:10,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:29:10,205 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2019-09-05 11:29:10,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:10,251 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-09-05 11:29:10,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:29:10,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-05 11:29:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:10,253 INFO L225 Difference]: With dead ends: 60 [2019-09-05 11:29:10,253 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 11:29:10,254 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:29:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 11:29:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-05 11:29:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 11:29:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-05 11:29:10,261 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 28 [2019-09-05 11:29:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:10,261 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-05 11:29:10,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:29:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-05 11:29:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:29:10,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:10,263 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:10,263 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:10,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:10,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1674464753, now seen corresponding path program 2 times [2019-09-05 11:29:10,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:10,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:10,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:10,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:10,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:10,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:10,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:10,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:10,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:10,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 11:29:10,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 11:29:10,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:29:10,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-05 11:29:10,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:29:10,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:29:10,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:29:10,442 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 10 states. [2019-09-05 11:29:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:10,766 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2019-09-05 11:29:10,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:29:10,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-09-05 11:29:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:10,775 INFO L225 Difference]: With dead ends: 85 [2019-09-05 11:29:10,776 INFO L226 Difference]: Without dead ends: 63 [2019-09-05 11:29:10,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:29:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-05 11:29:10,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 40. [2019-09-05 11:29:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-05 11:29:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-05 11:29:10,805 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2019-09-05 11:29:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:10,808 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-05 11:29:10,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:29:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-05 11:29:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-05 11:29:10,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:10,810 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:10,810 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:10,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:10,811 INFO L82 PathProgramCache]: Analyzing trace with hash -175519861, now seen corresponding path program 1 times [2019-09-05 11:29:10,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:10,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:10,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:10,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 11:29:10,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:10,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:10,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:10,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:29:10,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 11:29:11,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:11,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2019-09-05 11:29:11,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:29:11,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:29:11,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:29:11,019 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 9 states. [2019-09-05 11:29:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:11,210 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2019-09-05 11:29:11,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:29:11,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-09-05 11:29:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:11,212 INFO L225 Difference]: With dead ends: 74 [2019-09-05 11:29:11,212 INFO L226 Difference]: Without dead ends: 55 [2019-09-05 11:29:11,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:29:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-05 11:29:11,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-09-05 11:29:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-05 11:29:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-09-05 11:29:11,223 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 35 [2019-09-05 11:29:11,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:11,224 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-09-05 11:29:11,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:29:11,224 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-09-05 11:29:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 11:29:11,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:11,228 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:11,228 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:11,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:11,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1018225731, now seen corresponding path program 2 times [2019-09-05 11:29:11,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:11,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:11,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:11,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-05 11:29:11,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:11,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:29:11,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:29:11,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:29:11,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:29:11,355 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2019-09-05 11:29:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:11,428 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2019-09-05 11:29:11,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:29:11,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-09-05 11:29:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:11,430 INFO L225 Difference]: With dead ends: 82 [2019-09-05 11:29:11,430 INFO L226 Difference]: Without dead ends: 56 [2019-09-05 11:29:11,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:29:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-05 11:29:11,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-09-05 11:29:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-05 11:29:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2019-09-05 11:29:11,439 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 46 [2019-09-05 11:29:11,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:11,439 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2019-09-05 11:29:11,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:29:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2019-09-05 11:29:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-05 11:29:11,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:11,441 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:11,441 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1159318645, now seen corresponding path program 3 times [2019-09-05 11:29:11,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:11,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:11,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:11,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-05 11:29:11,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:11,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:11,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:29:11,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 11:29:11,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:11,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:29:11,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-05 11:29:11,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:11,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-09-05 11:29:11,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:29:11,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:29:11,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:29:11,719 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 13 states. [2019-09-05 11:29:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:11,954 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2019-09-05 11:29:11,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:29:11,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2019-09-05 11:29:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:11,956 INFO L225 Difference]: With dead ends: 86 [2019-09-05 11:29:11,956 INFO L226 Difference]: Without dead ends: 59 [2019-09-05 11:29:11,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:29:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-05 11:29:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-09-05 11:29:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-05 11:29:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2019-09-05 11:29:11,965 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 49 [2019-09-05 11:29:11,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:11,966 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-09-05 11:29:11,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:29:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2019-09-05 11:29:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-05 11:29:11,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:11,967 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:11,968 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:11,968 INFO L82 PathProgramCache]: Analyzing trace with hash 589875219, now seen corresponding path program 4 times [2019-09-05 11:29:11,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:11,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:11,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:11,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-05 11:29:12,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:12,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:12,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:12,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:29:12,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:12,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:29:12,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:29:12,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:12,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-05 11:29:12,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:29:12,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:29:12,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:29:12,124 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 9 states. [2019-09-05 11:29:12,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:12,303 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2019-09-05 11:29:12,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:29:12,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-05 11:29:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:12,307 INFO L225 Difference]: With dead ends: 96 [2019-09-05 11:29:12,307 INFO L226 Difference]: Without dead ends: 73 [2019-09-05 11:29:12,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-09-05 11:29:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-05 11:29:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2019-09-05 11:29:12,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-05 11:29:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-09-05 11:29:12,318 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 52 [2019-09-05 11:29:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:12,319 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-09-05 11:29:12,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:29:12,319 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2019-09-05 11:29:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-05 11:29:12,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:12,320 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:12,321 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:12,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:12,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1801585221, now seen corresponding path program 5 times [2019-09-05 11:29:12,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:12,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:12,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:12,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:12,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 41 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-05 11:29:12,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:12,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:12,430 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:12,514 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-05 11:29:12,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:12,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:29:12,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:29:12,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:12,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-09-05 11:29:12,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:29:12,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:29:12,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:29:12,551 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 9 states. [2019-09-05 11:29:12,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:12,766 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2019-09-05 11:29:12,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:29:12,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-09-05 11:29:12,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:12,768 INFO L225 Difference]: With dead ends: 83 [2019-09-05 11:29:12,768 INFO L226 Difference]: Without dead ends: 67 [2019-09-05 11:29:12,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:29:12,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-05 11:29:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-09-05 11:29:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-05 11:29:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2019-09-05 11:29:12,785 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 55 [2019-09-05 11:29:12,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:12,785 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2019-09-05 11:29:12,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:29:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2019-09-05 11:29:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-05 11:29:12,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:12,790 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:12,790 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:12,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:12,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1704935675, now seen corresponding path program 6 times [2019-09-05 11:29:12,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:12,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:12,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:12,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:12,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-05 11:29:12,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:12,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:12,940 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:29:13,015 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-09-05 11:29:13,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:13,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:29:13,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 46 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-05 11:29:13,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:13,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-09-05 11:29:13,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-05 11:29:13,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-05 11:29:13,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-05 11:29:13,109 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 15 states. [2019-09-05 11:29:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:13,330 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2019-09-05 11:29:13,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:29:13,333 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-09-05 11:29:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:13,334 INFO L225 Difference]: With dead ends: 117 [2019-09-05 11:29:13,334 INFO L226 Difference]: Without dead ends: 77 [2019-09-05 11:29:13,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:29:13,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-05 11:29:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2019-09-05 11:29:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-05 11:29:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-09-05 11:29:13,343 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 62 [2019-09-05 11:29:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:13,343 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-09-05 11:29:13,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-05 11:29:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-09-05 11:29:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-05 11:29:13,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:13,345 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:13,345 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:13,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:13,346 INFO L82 PathProgramCache]: Analyzing trace with hash 788547955, now seen corresponding path program 7 times [2019-09-05 11:29:13,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:13,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:13,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:13,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:13,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 61 proven. 46 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-05 11:29:13,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:13,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:13,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:13,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 11:29:13,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:29:13,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:13,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-09-05 11:29:13,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:29:13,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:29:13,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:29:13,634 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 17 states. [2019-09-05 11:29:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:14,219 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2019-09-05 11:29:14,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-05 11:29:14,220 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2019-09-05 11:29:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:14,221 INFO L225 Difference]: With dead ends: 146 [2019-09-05 11:29:14,221 INFO L226 Difference]: Without dead ends: 106 [2019-09-05 11:29:14,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2019-09-05 11:29:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-05 11:29:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 83. [2019-09-05 11:29:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-05 11:29:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2019-09-05 11:29:14,240 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 65 [2019-09-05 11:29:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:14,240 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2019-09-05 11:29:14,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:29:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2019-09-05 11:29:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-05 11:29:14,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:14,242 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:14,242 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:14,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:14,243 INFO L82 PathProgramCache]: Analyzing trace with hash -833747949, now seen corresponding path program 8 times [2019-09-05 11:29:14,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:14,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:14,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:14,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:14,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 107 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-09-05 11:29:14,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:14,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:14,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:14,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:14,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:14,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 11:29:14,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:14,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:14,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:14,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:15,002 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:15,003 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 66 treesize of output 44 [2019-09-05 11:29:15,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:15,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:15,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:15,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:30 [2019-09-05 11:29:15,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:15,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:15,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:15,313 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:15,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 53 treesize of output 17 [2019-09-05 11:29:15,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:15,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:15,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:15,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:9 [2019-09-05 11:29:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 90 proven. 102 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-05 11:29:15,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:15,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2019-09-05 11:29:15,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-05 11:29:15,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-05 11:29:15,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2019-09-05 11:29:15,363 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 30 states. [2019-09-05 11:29:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:17,305 INFO L93 Difference]: Finished difference Result 216 states and 269 transitions. [2019-09-05 11:29:17,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-05 11:29:17,309 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 78 [2019-09-05 11:29:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:17,311 INFO L225 Difference]: With dead ends: 216 [2019-09-05 11:29:17,311 INFO L226 Difference]: Without dead ends: 163 [2019-09-05 11:29:17,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=397, Invalid=3143, Unknown=0, NotChecked=0, Total=3540 [2019-09-05 11:29:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-05 11:29:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 124. [2019-09-05 11:29:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-05 11:29:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2019-09-05 11:29:17,326 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 78 [2019-09-05 11:29:17,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:17,326 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2019-09-05 11:29:17,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-05 11:29:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2019-09-05 11:29:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-05 11:29:17,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:17,328 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:17,328 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:17,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:17,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1937848504, now seen corresponding path program 1 times [2019-09-05 11:29:17,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:17,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:17,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:17,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:17,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 2 proven. 128 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-09-05 11:29:17,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:17,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:29:18,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:18,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-05 11:29:18,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:18,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:18,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:18,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:18,482 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,482 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 66 treesize of output 44 [2019-09-05 11:29:18,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:30 [2019-09-05 11:29:18,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:18,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:18,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:18,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,685 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 66 treesize of output 44 [2019-09-05 11:29:18,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:30 [2019-09-05 11:29:18,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:18,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 12 [2019-09-05 11:29:18,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:18,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:18,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:12 [2019-09-05 11:29:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 55 proven. 169 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-05 11:29:18,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:18,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 39 [2019-09-05 11:29:18,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-05 11:29:18,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-05 11:29:18,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1349, Unknown=0, NotChecked=0, Total=1482 [2019-09-05 11:29:18,940 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand 39 states. [2019-09-05 11:29:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:21,840 INFO L93 Difference]: Finished difference Result 277 states and 345 transitions. [2019-09-05 11:29:21,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-05 11:29:21,841 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 86 [2019-09-05 11:29:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:21,843 INFO L225 Difference]: With dead ends: 277 [2019-09-05 11:29:21,844 INFO L226 Difference]: Without dead ends: 218 [2019-09-05 11:29:21,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=510, Invalid=5040, Unknown=0, NotChecked=0, Total=5550 [2019-09-05 11:29:21,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-05 11:29:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 157. [2019-09-05 11:29:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-05 11:29:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 188 transitions. [2019-09-05 11:29:21,861 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 188 transitions. Word has length 86 [2019-09-05 11:29:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:21,861 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 188 transitions. [2019-09-05 11:29:21,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-05 11:29:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 188 transitions. [2019-09-05 11:29:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-05 11:29:21,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:21,863 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:21,863 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:21,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:21,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1811387833, now seen corresponding path program 2 times [2019-09-05 11:29:21,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:21,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:21,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:21,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:21,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 5 proven. 139 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-05 11:29:22,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:22,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:22,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:22,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:22,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:22,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-05 11:29:22,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:22,503 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:22,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-09-05 11:29:22,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:22,537 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.3 percent of original size [2019-09-05 11:29:22,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:22,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:36 [2019-09-05 11:29:22,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:22,615 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:22,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2019-09-05 11:29:22,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:22,626 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:22,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 treesize of output 39 [2019-09-05 11:29:22,627 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:22,648 INFO L567 ElimStorePlain]: treesize reduction 34, result has 43.3 percent of original size [2019-09-05 11:29:22,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:22,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:26 [2019-09-05 11:29:22,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:22,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-09-05 11:29:22,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:22,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:22,693 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:22,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2019-09-05 11:29:22,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:22,761 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:22,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-05 11:29:22,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:22,795 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-09-05 11:29:22,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:22,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2019-09-05 11:29:22,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:22,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:22,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-05 11:29:22,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:22,893 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-09-05 11:29:22,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:22,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2019-09-05 11:29:22,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:22,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:22,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-05 11:29:22,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:22,982 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-09-05 11:29:22,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:22,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2019-09-05 11:29:23,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:23,056 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:23,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-05 11:29:23,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:23,087 INFO L567 ElimStorePlain]: treesize reduction 36, result has 57.1 percent of original size [2019-09-05 11:29:23,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:23,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:48 [2019-09-05 11:29:29,138 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2019-09-05 11:29:29,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:29:29,152 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:29,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2019-09-05 11:29:29,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-05 11:29:29,170 INFO L567 ElimStorePlain]: treesize reduction 16, result has 40.7 percent of original size [2019-09-05 11:29:29,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:29,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2019-09-05 11:29:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 4 proven. 94 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-09-05 11:29:29,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:29,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 31 [2019-09-05 11:29:29,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:29:29,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:29:29,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=835, Unknown=2, NotChecked=0, Total=930 [2019-09-05 11:29:29,456 INFO L87 Difference]: Start difference. First operand 157 states and 188 transitions. Second operand 31 states. [2019-09-05 11:29:54,386 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-05 11:29:56,433 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 45 [2019-09-05 11:29:58,493 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 47 [2019-09-05 11:30:00,601 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 48 [2019-09-05 11:30:02,679 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 50 [2019-09-05 11:30:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:39,755 INFO L93 Difference]: Finished difference Result 304 states and 366 transitions. [2019-09-05 11:30:39,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:30:39,756 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2019-09-05 11:30:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:39,758 INFO L225 Difference]: With dead ends: 304 [2019-09-05 11:30:39,759 INFO L226 Difference]: Without dead ends: 175 [2019-09-05 11:30:39,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 44.2s TimeCoverageRelationStatistics Valid=398, Invalid=2893, Unknown=15, NotChecked=0, Total=3306 [2019-09-05 11:30:39,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-05 11:30:39,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-09-05 11:30:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-05 11:30:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2019-09-05 11:30:39,777 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 94 [2019-09-05 11:30:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:39,778 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2019-09-05 11:30:39,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:30:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2019-09-05 11:30:39,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-05 11:30:39,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:39,779 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:39,779 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:39,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:39,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1005309842, now seen corresponding path program 3 times [2019-09-05 11:30:39,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:39,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:39,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:39,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:39,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 12 proven. 203 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-05 11:30:41,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:41,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:41,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:30:41,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-05 11:30:41,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:41,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-05 11:30:41,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:41,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:41,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-09-05 11:30:41,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:41,355 INFO L567 ElimStorePlain]: treesize reduction 10, result has 77.3 percent of original size [2019-09-05 11:30:41,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:41,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2019-09-05 11:30:41,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:41,429 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:41,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2019-09-05 11:30:41,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:41,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:41,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 37 [2019-09-05 11:30:41,437 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:41,462 INFO L567 ElimStorePlain]: treesize reduction 32, result has 42.9 percent of original size [2019-09-05 11:30:41,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:41,462 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:24 [2019-09-05 11:30:41,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:41,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-09-05 11:30:41,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:41,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:41,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:41,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-09-05 11:30:41,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:41,588 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:41,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2019-09-05 11:30:41,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:41,628 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-09-05 11:30:41,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:41,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2019-09-05 11:30:41,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:41,685 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:41,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2019-09-05 11:30:41,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:41,718 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-09-05 11:30:41,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:41,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2019-09-05 11:30:41,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:41,784 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:41,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2019-09-05 11:30:41,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:41,838 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-09-05 11:30:41,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:41,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2019-09-05 11:30:41,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:41,895 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:41,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 84 [2019-09-05 11:30:41,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:41,943 INFO L567 ElimStorePlain]: treesize reduction 36, result has 56.1 percent of original size [2019-09-05 11:30:41,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-05 11:30:41,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:46 [2019-09-05 11:30:49,998 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-05 11:30:50,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:30:50,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:50,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2019-09-05 11:30:50,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-05 11:30:50,028 INFO L567 ElimStorePlain]: treesize reduction 16, result has 40.7 percent of original size [2019-09-05 11:30:50,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:50,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:7 [2019-09-05 11:30:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-09-05 11:30:50,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:50,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 35 [2019-09-05 11:30:50,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-05 11:30:50,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-05 11:30:50,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1090, Unknown=3, NotChecked=0, Total=1190 [2019-09-05 11:30:50,246 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand 35 states. [2019-09-05 11:32:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:32:26,370 INFO L93 Difference]: Finished difference Result 415 states and 507 transitions. [2019-09-05 11:32:26,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-05 11:32:26,370 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 102 [2019-09-05 11:32:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:32:26,374 INFO L225 Difference]: With dead ends: 415 [2019-09-05 11:32:26,374 INFO L226 Difference]: Without dead ends: 248 [2019-09-05 11:32:26,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=392, Invalid=3497, Unknown=17, NotChecked=0, Total=3906 [2019-09-05 11:32:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-05 11:32:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 225. [2019-09-05 11:32:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-05 11:32:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 271 transitions. [2019-09-05 11:32:26,397 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 271 transitions. Word has length 102 [2019-09-05 11:32:26,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:32:26,397 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 271 transitions. [2019-09-05 11:32:26,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-05 11:32:26,397 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 271 transitions. [2019-09-05 11:32:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-05 11:32:26,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:32:26,399 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:32:26,399 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:32:26,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:32:26,399 INFO L82 PathProgramCache]: Analyzing trace with hash -757435666, now seen corresponding path program 4 times [2019-09-05 11:32:26,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:32:26,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:32:26,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:26,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:32:26,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 6 proven. 133 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-09-05 11:32:27,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:32:27,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:32:27,076 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:32:27,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:32:27,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:32:27,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-05 11:32:27,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:27,472 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-09-05 11:32:27,472 INFO L341 Elim1Store]: treesize reduction 118, result has 60.9 percent of original size [2019-09-05 11:32:27,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 198 [2019-09-05 11:32:27,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:27,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:27,561 INFO L567 ElimStorePlain]: treesize reduction 524, result has 7.3 percent of original size [2019-09-05 11:32:27,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:27,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:25 [2019-09-05 11:32:27,701 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-09-05 11:32:27,701 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 34 treesize of output 10 [2019-09-05 11:32:27,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:27,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:27,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:27,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:3 [2019-09-05 11:32:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 121 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-05 11:32:27,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:27,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2019-09-05 11:32:27,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:32:27,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:32:27,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:32:27,742 INFO L87 Difference]: Start difference. First operand 225 states and 271 transitions. Second operand 33 states. [2019-09-05 11:32:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:32:29,698 INFO L93 Difference]: Finished difference Result 345 states and 413 transitions. [2019-09-05 11:32:29,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-05 11:32:29,698 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 102 [2019-09-05 11:32:29,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:32:29,700 INFO L225 Difference]: With dead ends: 345 [2019-09-05 11:32:29,700 INFO L226 Difference]: Without dead ends: 255 [2019-09-05 11:32:29,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=351, Invalid=2511, Unknown=0, NotChecked=0, Total=2862 [2019-09-05 11:32:29,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-05 11:32:29,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 234. [2019-09-05 11:32:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-05 11:32:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 281 transitions. [2019-09-05 11:32:29,722 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 281 transitions. Word has length 102 [2019-09-05 11:32:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:32:29,723 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 281 transitions. [2019-09-05 11:32:29,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:32:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 281 transitions. [2019-09-05 11:32:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-05 11:32:29,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:32:29,724 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:32:29,725 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:32:29,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:32:29,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1986247122, now seen corresponding path program 5 times [2019-09-05 11:32:29,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:32:29,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:32:29,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:29,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:32:29,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:32:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:32:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 6 proven. 206 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-05 11:32:30,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:32:30,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:32:30,993 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:32:31,184 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-05 11:32:31,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:32:31,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-05 11:32:31,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:32:31,207 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:31,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-09-05 11:32:31,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:31,241 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.6 percent of original size [2019-09-05 11:32:31,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:31,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:39 [2019-09-05 11:32:31,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:32:31,322 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:31,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2019-09-05 11:32:31,323 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:31,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:31,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 48 [2019-09-05 11:32:31,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:31,377 INFO L567 ElimStorePlain]: treesize reduction 43, result has 44.9 percent of original size [2019-09-05 11:32:31,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:31,377 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:91, output treesize:35 [2019-09-05 11:32:31,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-09-05 11:32:31,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:31,458 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.3 percent of original size [2019-09-05 11:32:31,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:31,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:42 [2019-09-05 11:32:31,567 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:32:31,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,570 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:32:31,586 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:31,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 74 [2019-09-05 11:32:31,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:31,627 INFO L567 ElimStorePlain]: treesize reduction 38, result has 57.3 percent of original size [2019-09-05 11:32:31,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:31,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-09-05 11:32:31,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,748 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:32:31,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,750 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:32:31,761 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:31,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 52 treesize of output 76 [2019-09-05 11:32:31,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:31,804 INFO L567 ElimStorePlain]: treesize reduction 34, result has 63.8 percent of original size [2019-09-05 11:32:31,805 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:31,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:60 [2019-09-05 11:32:31,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,941 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:32:31,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:31,947 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:32:31,958 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:31,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 86 [2019-09-05 11:32:31,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:32,003 INFO L567 ElimStorePlain]: treesize reduction 34, result has 65.3 percent of original size [2019-09-05 11:32:32,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:32,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:64 [2019-09-05 11:32:32,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:32,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:32,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:32,082 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:32:32,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:32,085 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:32:32,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:32,191 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-09-05 11:32:32,191 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:32,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 60 treesize of output 238 [2019-09-05 11:32:32,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:32,284 INFO L567 ElimStorePlain]: treesize reduction 152, result has 29.0 percent of original size [2019-09-05 11:32:32,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:32:32,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:66, output treesize:62 [2019-09-05 11:32:32,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:32,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:32,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:32,374 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:32:32,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:32,376 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:32:32,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:32:32,430 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:32:32,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 56 treesize of output 110 [2019-09-05 11:32:32,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:32:32,459 INFO L567 ElimStorePlain]: treesize reduction 72, result has 16.3 percent of original size [2019-09-05 11:32:32,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:32:32,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:10 [2019-09-05 11:32:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 13 proven. 219 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-05 11:32:49,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:32:49,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 34] total 55 [2019-09-05 11:32:49,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-05 11:32:49,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-05 11:32:49,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2746, Unknown=14, NotChecked=0, Total=2970 [2019-09-05 11:32:49,261 INFO L87 Difference]: Start difference. First operand 234 states and 281 transitions. Second operand 55 states. [2019-09-05 11:32:50,970 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-05 11:33:06,590 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-09-05 11:33:11,886 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-05 11:33:16,943 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-05 11:33:22,231 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-09-05 11:33:27,214 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2019-09-05 11:33:30,056 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-05 11:33:34,229 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 70 [2019-09-05 11:33:35,857 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-09-05 11:33:39,953 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 83 [2019-09-05 11:33:40,166 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-05 11:33:42,883 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 76 [2019-09-05 11:33:44,601 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 68 [2019-09-05 11:33:46,125 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-05 11:33:48,789 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-05 11:33:48,979 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2019-09-05 11:33:54,402 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-09-05 11:33:57,466 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 82 [2019-09-05 11:34:03,012 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 73 [2019-09-05 11:34:06,359 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2019-09-05 11:34:11,701 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 65 [2019-09-05 11:34:14,405 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2019-09-05 11:34:19,144 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 73 [2019-09-05 11:34:24,906 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 82 [2019-09-05 11:34:26,415 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 82 [2019-09-05 11:34:33,471 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2019-09-05 11:34:34,982 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-09-05 11:34:50,785 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 64 [2019-09-05 11:34:58,039 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 74 [2019-09-05 11:35:33,529 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 64 [2019-09-05 11:35:40,113 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 63 [2019-09-05 11:35:41,926 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-09-05 11:35:49,726 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 78 [2019-09-05 11:35:58,183 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 80 [2019-09-05 11:36:06,022 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 78 [2019-09-05 11:36:14,366 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 80 [2019-09-05 11:36:27,250 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 72 [2019-09-05 11:36:35,481 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73 [2019-09-05 11:36:49,942 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 72 [2019-09-05 11:37:05,201 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2019-09-05 11:37:13,223 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2019-09-05 11:37:22,804 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-09-05 11:37:24,670 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-09-05 11:37:32,693 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-09-05 11:37:39,004 WARN L188 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-09-05 11:37:45,000 WARN L188 SmtUtils]: Spent 3.09 s on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2019-09-05 11:37:52,795 WARN L188 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2019-09-05 11:38:19,093 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-09-05 11:38:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:38:34,365 INFO L93 Difference]: Finished difference Result 938 states and 1171 transitions. [2019-09-05 11:38:34,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-09-05 11:38:34,366 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 102 [2019-09-05 11:38:34,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:38:34,370 INFO L225 Difference]: With dead ends: 938 [2019-09-05 11:38:34,370 INFO L226 Difference]: Without dead ends: 493 [2019-09-05 11:38:34,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5377 ImplicationChecksByTransitivity, 220.0s TimeCoverageRelationStatistics Valid=1898, Invalid=17134, Unknown=150, NotChecked=0, Total=19182 [2019-09-05 11:38:34,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-05 11:38:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 310. [2019-09-05 11:38:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-05 11:38:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 384 transitions. [2019-09-05 11:38:34,431 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 384 transitions. Word has length 102 [2019-09-05 11:38:34,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:38:34,431 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 384 transitions. [2019-09-05 11:38:34,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-05 11:38:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 384 transitions. [2019-09-05 11:38:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-05 11:38:34,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:38:34,434 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:38:34,434 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:38:34,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:38:34,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1336748588, now seen corresponding path program 6 times [2019-09-05 11:38:34,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:38:34,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:38:34,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:38:34,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:38:34,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:38:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:38:36,433 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-05 11:38:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 11 proven. 215 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-05 11:38:36,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:38:36,816 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:38:36,826 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:38:36,946 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-05 11:38:36,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:38:36,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-05 11:38:36,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:38:37,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:38:37,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:38:37,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:38:37,476 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:38:37,477 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 64 treesize of output 43 [2019-09-05 11:38:37,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:38:37,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:38:37,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:38:37,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:40 [2019-09-05 11:38:37,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:38:37,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:38:37,939 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:38:37,939 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-05 11:38:37,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:38:37,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 18 [2019-09-05 11:38:37,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:38:37,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:38:37,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:38:37,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:15 [2019-09-05 11:38:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 117 proven. 60 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-05 11:38:38,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:38:38,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 19] total 47 [2019-09-05 11:38:38,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 11:38:38,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 11:38:38,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2016, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:38:38,078 INFO L87 Difference]: Start difference. First operand 310 states and 384 transitions. Second operand 47 states. [2019-09-05 11:38:38,794 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 34 [2019-09-05 11:38:39,005 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2019-09-05 11:38:39,204 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2019-09-05 11:38:39,375 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 45 [2019-09-05 11:38:40,036 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-09-05 11:38:40,731 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-05 11:38:41,674 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-09-05 11:38:42,007 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-05 11:38:43,463 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-05 11:38:44,684 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2019-09-05 11:38:45,541 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2019-09-05 11:38:45,776 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 41 [2019-09-05 11:38:46,349 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2019-09-05 11:38:47,129 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-09-05 11:38:48,457 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-05 11:38:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:38:48,955 INFO L93 Difference]: Finished difference Result 701 states and 877 transitions. [2019-09-05 11:38:48,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-05 11:38:48,956 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 102 [2019-09-05 11:38:48,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:38:48,959 INFO L225 Difference]: With dead ends: 701 [2019-09-05 11:38:48,959 INFO L226 Difference]: Without dead ends: 531 [2019-09-05 11:38:48,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2994 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1220, Invalid=10552, Unknown=0, NotChecked=0, Total=11772 [2019-09-05 11:38:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-09-05 11:38:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 410. [2019-09-05 11:38:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-05 11:38:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 512 transitions. [2019-09-05 11:38:49,028 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 512 transitions. Word has length 102 [2019-09-05 11:38:49,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:38:49,028 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 512 transitions. [2019-09-05 11:38:49,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 11:38:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 512 transitions. [2019-09-05 11:38:49,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-05 11:38:49,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:38:49,031 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:38:49,031 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:38:49,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:38:49,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1664820590, now seen corresponding path program 7 times [2019-09-05 11:38:49,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:38:49,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:38:49,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:38:49,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:38:49,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:38:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:38:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 6 proven. 194 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-05 11:38:50,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:38:50,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:38:50,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:38:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:38:50,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-05 11:38:50,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:38:51,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:38:51,061 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 32 treesize of output 24 [2019-09-05 11:38:51,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:38:51,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:38:51,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:38:51,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2019-09-05 11:38:51,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:38:51,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:38:51,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:38:51,396 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:38:51,396 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 66 treesize of output 44 [2019-09-05 11:38:51,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:38:51,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:38:51,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:38:51,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:30 [2019-09-05 11:38:51,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:38:51,559 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:38:51,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2019-09-05 11:38:51,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:38:51,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:38:51,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:38:51,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:9 [2019-09-05 11:38:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 55 proven. 147 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-05 11:38:51,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:38:51,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18] total 42 [2019-09-05 11:38:51,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-05 11:38:51,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-05 11:38:51,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1596, Unknown=0, NotChecked=0, Total=1722 [2019-09-05 11:38:51,624 INFO L87 Difference]: Start difference. First operand 410 states and 512 transitions. Second operand 42 states. [2019-09-05 11:38:54,801 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-05 11:38:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:38:57,974 INFO L93 Difference]: Finished difference Result 968 states and 1212 transitions. [2019-09-05 11:38:57,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-05 11:38:57,975 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 102 [2019-09-05 11:38:57,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:38:57,978 INFO L225 Difference]: With dead ends: 968 [2019-09-05 11:38:57,979 INFO L226 Difference]: Without dead ends: 816 [2019-09-05 11:38:57,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=605, Invalid=6535, Unknown=0, NotChecked=0, Total=7140 [2019-09-05 11:38:57,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-09-05 11:38:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 455. [2019-09-05 11:38:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-09-05 11:38:58,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 568 transitions. [2019-09-05 11:38:58,061 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 568 transitions. Word has length 102 [2019-09-05 11:38:58,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:38:58,062 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 568 transitions. [2019-09-05 11:38:58,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-05 11:38:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 568 transitions. [2019-09-05 11:38:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-05 11:38:58,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:38:58,067 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:38:58,067 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:38:58,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:38:58,068 INFO L82 PathProgramCache]: Analyzing trace with hash -973234200, now seen corresponding path program 8 times [2019-09-05 11:38:58,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:38:58,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:38:58,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:38:58,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:38:58,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:38:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:38:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 9 proven. 225 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-05 11:38:59,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:38:59,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:38:59,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:38:59,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:38:59,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:38:59,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 11:38:59,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:39:00,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:00,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:00,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:00,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:00,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:00,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:00,272 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:00,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 73 treesize of output 198 [2019-09-05 11:39:00,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:00,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:00,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:00,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:00,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:00,465 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-05 11:39:00,465 INFO L567 ElimStorePlain]: treesize reduction 296, result has 36.5 percent of original size [2019-09-05 11:39:00,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:00,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:39:00,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:84, output treesize:117 [2019-09-05 11:39:00,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:00,768 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:00,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2019-09-05 11:39:00,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:00,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:00,773 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:39:00,773 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:9 [2019-09-05 11:39:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 121 proven. 47 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-05 11:39:00,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:39:00,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 19] total 47 [2019-09-05 11:39:00,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-05 11:39:00,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-05 11:39:00,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1993, Unknown=0, NotChecked=0, Total=2162 [2019-09-05 11:39:00,832 INFO L87 Difference]: Start difference. First operand 455 states and 568 transitions. Second operand 47 states. [2019-09-05 11:39:03,554 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-09-05 11:39:04,024 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-05 11:39:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:39:07,207 INFO L93 Difference]: Finished difference Result 793 states and 997 transitions. [2019-09-05 11:39:07,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-05 11:39:07,211 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 102 [2019-09-05 11:39:07,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:39:07,213 INFO L225 Difference]: With dead ends: 793 [2019-09-05 11:39:07,213 INFO L226 Difference]: Without dead ends: 617 [2019-09-05 11:39:07,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=765, Invalid=7245, Unknown=0, NotChecked=0, Total=8010 [2019-09-05 11:39:07,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-05 11:39:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 529. [2019-09-05 11:39:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-09-05 11:39:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 662 transitions. [2019-09-05 11:39:07,286 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 662 transitions. Word has length 102 [2019-09-05 11:39:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:39:07,287 INFO L475 AbstractCegarLoop]: Abstraction has 529 states and 662 transitions. [2019-09-05 11:39:07,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-05 11:39:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 662 transitions. [2019-09-05 11:39:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-05 11:39:07,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:39:07,289 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:39:07,289 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:39:07,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:39:07,290 INFO L82 PathProgramCache]: Analyzing trace with hash -523632671, now seen corresponding path program 9 times [2019-09-05 11:39:07,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:39:07,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:39:07,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:07,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:39:07,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:39:07,804 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-05 11:39:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 22 proven. 119 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-09-05 11:39:08,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:39:08,139 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:39:08,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:39:08,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 11:39:08,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:39:08,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 11:39:08,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:39:08,377 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:08,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-09-05 11:39:08,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:08,403 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.3 percent of original size [2019-09-05 11:39:08,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:39:08,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:36 [2019-09-05 11:39:08,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:08,459 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:08,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2019-09-05 11:39:08,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:08,469 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:08,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 35 treesize of output 39 [2019-09-05 11:39:08,469 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:08,494 INFO L567 ElimStorePlain]: treesize reduction 34, result has 43.3 percent of original size [2019-09-05 11:39:08,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:39:08,495 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:26 [2019-09-05 11:39:08,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:08,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-09-05 11:39:08,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:08,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:08,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:39:08,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-09-05 11:39:08,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:08,614 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-09-05 11:39:08,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 53 [2019-09-05 11:39:08,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:08,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:08,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:39:08,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-09-05 11:39:08,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:08,740 INFO L341 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-09-05 11:39:08,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 70 [2019-09-05 11:39:08,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:08,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:08,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:39:08,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2019-09-05 11:39:08,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:08,906 INFO L341 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-09-05 11:39:08,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 87 [2019-09-05 11:39:08,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:08,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:08,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:39:08,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:83, output treesize:79 [2019-09-05 11:39:08,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:09,119 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-05 11:39:09,120 INFO L341 Elim1Store]: treesize reduction 105, result has 65.7 percent of original size [2019-09-05 11:39:09,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 87 treesize of output 254 [2019-09-05 11:39:09,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:09,199 INFO L567 ElimStorePlain]: treesize reduction 153, result has 37.0 percent of original size [2019-09-05 11:39:09,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-05 11:39:09,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:94, output treesize:90 [2019-09-05 11:39:09,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:09,341 INFO L341 Elim1Store]: treesize reduction 105, result has 39.3 percent of original size [2019-09-05 11:39:09,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 95 [2019-09-05 11:39:09,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:09,357 INFO L567 ElimStorePlain]: treesize reduction 73, result has 13.1 percent of original size [2019-09-05 11:39:09,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:39:09,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:93, output treesize:7 [2019-09-05 11:39:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-09-05 11:39:10,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:39:10,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2019-09-05 11:39:10,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-05 11:39:10,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-05 11:39:10,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1132, Unknown=1, NotChecked=0, Total=1260 [2019-09-05 11:39:10,339 INFO L87 Difference]: Start difference. First operand 529 states and 662 transitions. Second operand 36 states. [2019-09-05 11:39:11,006 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-05 11:39:13,124 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 88 [2019-09-05 11:39:13,623 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-05 11:39:13,845 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2019-09-05 11:39:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:39:14,170 INFO L93 Difference]: Finished difference Result 888 states and 1109 transitions. [2019-09-05 11:39:14,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-05 11:39:14,171 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 110 [2019-09-05 11:39:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:39:14,174 INFO L225 Difference]: With dead ends: 888 [2019-09-05 11:39:14,174 INFO L226 Difference]: Without dead ends: 427 [2019-09-05 11:39:14,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=463, Invalid=2958, Unknown=1, NotChecked=0, Total=3422 [2019-09-05 11:39:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-05 11:39:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2019-09-05 11:39:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-05 11:39:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 521 transitions. [2019-09-05 11:39:14,232 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 521 transitions. Word has length 110 [2019-09-05 11:39:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:39:14,233 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 521 transitions. [2019-09-05 11:39:14,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-05 11:39:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 521 transitions. [2019-09-05 11:39:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-05 11:39:14,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:39:14,235 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:39:14,235 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:39:14,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:39:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2070152803, now seen corresponding path program 10 times [2019-09-05 11:39:14,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:39:14,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:39:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:14,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:39:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:39:15,010 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2019-09-05 11:39:15,388 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 167 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-05 11:39:15,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:39:15,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:39:15,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:39:15,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:39:15,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:39:15,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-05 11:39:15,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:39:15,809 INFO L341 Elim1Store]: treesize reduction 182, result has 11.7 percent of original size [2019-09-05 11:39:15,810 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 44 [2019-09-05 11:39:15,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:15,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:15,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:39:15,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:69, output treesize:27 [2019-09-05 11:39:15,975 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-09-05 11:39:15,975 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 36 treesize of output 12 [2019-09-05 11:39:15,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:15,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:15,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:39:15,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:5 [2019-09-05 11:39:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 90 proven. 123 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-05 11:39:16,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:39:16,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 38 [2019-09-05 11:39:16,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-05 11:39:16,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-05 11:39:16,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1264, Unknown=0, NotChecked=0, Total=1406 [2019-09-05 11:39:16,040 INFO L87 Difference]: Start difference. First operand 425 states and 521 transitions. Second operand 38 states. [2019-09-05 11:39:17,157 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-09-05 11:39:17,308 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 39 [2019-09-05 11:39:17,523 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-09-05 11:39:17,706 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 48 [2019-09-05 11:39:18,035 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-05 11:39:18,618 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-09-05 11:39:18,791 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 44 [2019-09-05 11:39:19,322 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 46 [2019-09-05 11:39:19,519 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2019-09-05 11:39:19,730 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 41 [2019-09-05 11:39:19,993 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 58 [2019-09-05 11:39:20,217 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2019-09-05 11:39:20,664 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2019-09-05 11:39:20,816 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-09-05 11:39:21,171 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2019-09-05 11:39:21,392 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-09-05 11:39:21,626 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2019-09-05 11:39:21,802 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 40 [2019-09-05 11:39:22,034 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2019-09-05 11:39:22,222 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-09-05 11:39:22,388 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-09-05 11:39:22,828 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2019-09-05 11:39:23,114 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2019-09-05 11:39:23,347 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 60 [2019-09-05 11:39:23,781 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-05 11:39:24,038 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-05 11:39:24,270 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2019-09-05 11:39:24,482 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-09-05 11:39:24,647 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-09-05 11:39:24,966 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-09-05 11:39:25,210 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2019-09-05 11:39:25,625 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-09-05 11:39:25,867 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-09-05 11:39:26,038 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-09-05 11:39:26,523 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-09-05 11:39:26,964 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-09-05 11:39:27,355 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-09-05 11:39:27,634 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 42 [2019-09-05 11:39:27,833 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-09-05 11:39:28,036 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2019-09-05 11:39:28,371 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-09-05 11:39:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:39:28,743 INFO L93 Difference]: Finished difference Result 943 states and 1163 transitions. [2019-09-05 11:39:28,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-09-05 11:39:28,744 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 110 [2019-09-05 11:39:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:39:28,747 INFO L225 Difference]: With dead ends: 943 [2019-09-05 11:39:28,747 INFO L226 Difference]: Without dead ends: 325 [2019-09-05 11:39:28,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 100 SyntacticMatches, 5 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4785 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1742, Invalid=12300, Unknown=0, NotChecked=0, Total=14042 [2019-09-05 11:39:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-05 11:39:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 276. [2019-09-05 11:39:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-05 11:39:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 322 transitions. [2019-09-05 11:39:28,794 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 322 transitions. Word has length 110 [2019-09-05 11:39:28,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:39:28,795 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 322 transitions. [2019-09-05 11:39:28,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-05 11:39:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 322 transitions. [2019-09-05 11:39:28,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-05 11:39:28,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:39:28,797 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:39:28,797 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:39:28,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:39:28,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1594685855, now seen corresponding path program 11 times [2019-09-05 11:39:28,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:39:28,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:39:28,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:28,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:39:28,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:39:29,318 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-09-05 11:39:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 21 proven. 201 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-05 11:39:30,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:39:30,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:39:30,716 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:39:30,753 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-05 11:39:30,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:39:30,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 11:39:30,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:39:31,634 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2019-09-05 11:39:31,635 INFO L341 Elim1Store]: treesize reduction 187, result has 58.0 percent of original size [2019-09-05 11:39:31,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 277 [2019-09-05 11:39:31,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-05 11:39:31,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:31,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:32,014 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 46 [2019-09-05 11:39:32,014 INFO L567 ElimStorePlain]: treesize reduction 2692, result has 5.9 percent of original size [2019-09-05 11:39:32,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:32,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:39:32,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:116 [2019-09-05 11:39:32,230 INFO L341 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2019-09-05 11:39:32,230 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 46 treesize of output 12 [2019-09-05 11:39:32,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:32,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:32,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:39:32,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:5 [2019-09-05 11:39:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 167 proven. 27 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-05 11:39:32,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:39:32,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 19] total 46 [2019-09-05 11:39:32,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-05 11:39:32,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-05 11:39:32,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1934, Unknown=0, NotChecked=0, Total=2070 [2019-09-05 11:39:32,297 INFO L87 Difference]: Start difference. First operand 276 states and 322 transitions. Second operand 46 states. [2019-09-05 11:39:34,644 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-05 11:39:34,825 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-05 11:39:35,808 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 38 [2019-09-05 11:39:36,091 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2019-09-05 11:39:37,149 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-05 11:39:37,975 WARN L188 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-05 11:39:38,174 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-09-05 11:39:38,896 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 54 [2019-09-05 11:39:39,112 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 47 [2019-09-05 11:39:39,297 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 45 [2019-09-05 11:39:39,657 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 53 [2019-09-05 11:39:39,881 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 47 [2019-09-05 11:39:40,419 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 58 [2019-09-05 11:39:40,705 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 48 [2019-09-05 11:39:40,868 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 46 [2019-09-05 11:39:41,091 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 57 [2019-09-05 11:39:41,307 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2019-09-05 11:39:41,627 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2019-09-05 11:39:41,856 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-09-05 11:39:42,036 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 46 [2019-09-05 11:39:42,295 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2019-09-05 11:39:42,565 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2019-09-05 11:39:42,802 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 41 [2019-09-05 11:39:43,034 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 55 [2019-09-05 11:39:43,555 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 62 [2019-09-05 11:39:43,821 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2019-09-05 11:39:44,065 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 63 [2019-09-05 11:39:44,270 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 58 [2019-09-05 11:39:45,007 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-09-05 11:39:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:39:48,024 INFO L93 Difference]: Finished difference Result 543 states and 648 transitions. [2019-09-05 11:39:48,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-09-05 11:39:48,024 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 110 [2019-09-05 11:39:48,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:39:48,027 INFO L225 Difference]: With dead ends: 543 [2019-09-05 11:39:48,027 INFO L226 Difference]: Without dead ends: 369 [2019-09-05 11:39:48,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5163 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=1556, Invalid=16804, Unknown=0, NotChecked=0, Total=18360 [2019-09-05 11:39:48,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-05 11:39:48,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 303. [2019-09-05 11:39:48,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-09-05 11:39:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 354 transitions. [2019-09-05 11:39:48,087 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 354 transitions. Word has length 110 [2019-09-05 11:39:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:39:48,087 INFO L475 AbstractCegarLoop]: Abstraction has 303 states and 354 transitions. [2019-09-05 11:39:48,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-05 11:39:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 354 transitions. [2019-09-05 11:39:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-05 11:39:48,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:39:48,089 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:39:48,089 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:39:48,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:39:48,089 INFO L82 PathProgramCache]: Analyzing trace with hash 801223523, now seen corresponding path program 12 times [2019-09-05 11:39:48,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:39:48,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:39:48,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:48,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:39:48,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:39:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:39:49,176 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2019-09-05 11:39:49,436 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2019-09-05 11:39:49,654 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 42 [2019-09-05 11:39:49,972 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 45 [2019-09-05 11:39:50,216 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 46 [2019-09-05 11:39:50,529 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 54 [2019-09-05 11:39:50,837 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 50 [2019-09-05 11:39:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 18 proven. 204 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-05 11:39:51,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:39:51,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:39:51,824 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:39:51,960 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-05 11:39:51,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:39:51,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-05 11:39:51,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:39:51,983 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:51,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-09-05 11:39:51,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:52,013 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.6 percent of original size [2019-09-05 11:39:52,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:39:52,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:39 [2019-09-05 11:39:52,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:39:52,081 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:52,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 42 [2019-09-05 11:39:52,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:52,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:52,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-09-05 11:39:52,107 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:52,137 INFO L567 ElimStorePlain]: treesize reduction 37, result has 43.9 percent of original size [2019-09-05 11:39:52,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:39:52,137 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:79, output treesize:29 [2019-09-05 11:39:52,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:52,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-09-05 11:39:52,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:52,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:52,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:39:52,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-09-05 11:39:52,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:52,293 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:52,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-05 11:39:52,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:52,332 INFO L567 ElimStorePlain]: treesize reduction 36, result has 58.6 percent of original size [2019-09-05 11:39:52,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:39:52,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2019-09-05 11:39:52,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:52,411 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:52,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-05 11:39:52,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:52,448 INFO L567 ElimStorePlain]: treesize reduction 36, result has 58.6 percent of original size [2019-09-05 11:39:52,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:39:52,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2019-09-05 11:39:52,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:52,532 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:52,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-05 11:39:52,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:52,574 INFO L567 ElimStorePlain]: treesize reduction 36, result has 58.6 percent of original size [2019-09-05 11:39:52,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-05 11:39:52,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:51 [2019-09-05 11:39:52,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:52,643 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:52,643 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 86 [2019-09-05 11:39:52,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:39:52,679 INFO L567 ElimStorePlain]: treesize reduction 36, result has 58.6 percent of original size [2019-09-05 11:39:52,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-05 11:39:52,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:51 [2019-09-05 11:39:58,749 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2019-09-05 11:39:58,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-05 11:39:58,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:39:58,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2019-09-05 11:39:58,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-05 11:39:58,781 INFO L567 ElimStorePlain]: treesize reduction 16, result has 46.7 percent of original size [2019-09-05 11:39:58,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:39:58,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:10 [2019-09-05 11:40:04,039 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-09-05 11:40:04,923 WARN L188 SmtUtils]: Spent 817.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-09-05 11:40:05,813 WARN L188 SmtUtils]: Spent 818.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-09-05 11:40:07,058 WARN L188 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 36 [2019-09-05 11:40:08,156 WARN L188 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 38 [2019-09-05 11:40:09,222 WARN L188 SmtUtils]: Spent 987.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-09-05 11:40:10,271 WARN L188 SmtUtils]: Spent 950.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-05 11:40:11,650 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 44 [2019-09-05 11:40:47,503 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 38 [2019-09-05 11:40:51,235 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-05 11:40:53,354 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-05 11:41:15,463 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 14 proven. 210 refuted. 6 times theorem prover too weak. 89 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:41:15,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:41:15,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 32] total 64 [2019-09-05 11:41:15,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-05 11:41:15,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-05 11:41:15,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3772, Unknown=36, NotChecked=0, Total=4032 [2019-09-05 11:41:15,480 INFO L87 Difference]: Start difference. First operand 303 states and 354 transitions. Second operand 64 states. [2019-09-05 11:41:56,313 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-05 11:42:14,133 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-05 11:42:23,805 WARN L188 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-05 11:42:33,452 WARN L188 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-05 11:42:49,543 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-05 11:42:59,646 WARN L188 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-05 11:43:09,697 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-05 11:43:23,625 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 73 DAG size of output: 61