java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/xor2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 12:07:35,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 12:07:35,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 12:07:35,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 12:07:35,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 12:07:35,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 12:07:35,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 12:07:35,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 12:07:35,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 12:07:35,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 12:07:35,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 12:07:35,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 12:07:35,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 12:07:35,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 12:07:35,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 12:07:35,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 12:07:35,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 12:07:35,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 12:07:35,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 12:07:35,831 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 12:07:35,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 12:07:35,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 12:07:35,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 12:07:35,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 12:07:35,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 12:07:35,838 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 12:07:35,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 12:07:35,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 12:07:35,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 12:07:35,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 12:07:35,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 12:07:35,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 12:07:35,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 12:07:35,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 12:07:35,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 12:07:35,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 12:07:35,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 12:07:35,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 12:07:35,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 12:07:35,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 12:07:35,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 12:07:35,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 12:07:35,863 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 12:07:35,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 12:07:35,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 12:07:35,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 12:07:35,865 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 12:07:35,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 12:07:35,866 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 12:07:35,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 12:07:35,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 12:07:35,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 12:07:35,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 12:07:35,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 12:07:35,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 12:07:35,867 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 12:07:35,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 12:07:35,867 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 12:07:35,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 12:07:35,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 12:07:35,868 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 12:07:35,868 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 12:07:35,868 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 12:07:35,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 12:07:35,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 12:07:35,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 12:07:35,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 12:07:35,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 12:07:35,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 12:07:35,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 12:07:35,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 12:07:35,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 12:07:35,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 12:07:35,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 12:07:35,928 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 12:07:35,928 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 12:07:35,929 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/xor2.i [2019-09-07 12:07:36,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d672b37a/63b1b961c8164ac381b96ce2d384c26d/FLAG9262b565c [2019-09-07 12:07:36,506 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 12:07:36,506 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/xor2.i [2019-09-07 12:07:36,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d672b37a/63b1b961c8164ac381b96ce2d384c26d/FLAG9262b565c [2019-09-07 12:07:36,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d672b37a/63b1b961c8164ac381b96ce2d384c26d [2019-09-07 12:07:36,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 12:07:36,893 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 12:07:36,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 12:07:36,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 12:07:36,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 12:07:36,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:07:36" (1/1) ... [2019-09-07 12:07:36,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d623fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:07:36, skipping insertion in model container [2019-09-07 12:07:36,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 12:07:36" (1/1) ... [2019-09-07 12:07:36,908 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 12:07:36,924 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 12:07:37,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:07:37,136 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 12:07:37,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 12:07:37,272 INFO L192 MainTranslator]: Completed translation [2019-09-07 12:07:37,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:07:37 WrapperNode [2019-09-07 12:07:37,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 12:07:37,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 12:07:37,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 12:07:37,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 12:07:37,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:07:37" (1/1) ... [2019-09-07 12:07:37,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:07:37" (1/1) ... [2019-09-07 12:07:37,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:07:37" (1/1) ... [2019-09-07 12:07:37,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:07:37" (1/1) ... [2019-09-07 12:07:37,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:07:37" (1/1) ... [2019-09-07 12:07:37,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:07:37" (1/1) ... [2019-09-07 12:07:37,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:07:37" (1/1) ... [2019-09-07 12:07:37,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 12:07:37,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 12:07:37,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 12:07:37,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 12:07:37,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:07:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 12:07:37,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 12:07:37,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 12:07:37,376 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2019-09-07 12:07:37,376 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 12:07:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 12:07:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 12:07:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2019-09-07 12:07:37,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 12:07:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 12:07:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 12:07:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 12:07:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 12:07:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 12:07:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 12:07:37,720 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 12:07:37,721 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 12:07:37,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:07:37 BoogieIcfgContainer [2019-09-07 12:07:37,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 12:07:37,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 12:07:37,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 12:07:37,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 12:07:37,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 12:07:36" (1/3) ... [2019-09-07 12:07:37,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7673a99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:07:37, skipping insertion in model container [2019-09-07 12:07:37,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 12:07:37" (2/3) ... [2019-09-07 12:07:37,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7673a99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 12:07:37, skipping insertion in model container [2019-09-07 12:07:37,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 12:07:37" (3/3) ... [2019-09-07 12:07:37,735 INFO L109 eAbstractionObserver]: Analyzing ICFG xor2.i [2019-09-07 12:07:37,745 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 12:07:37,753 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 12:07:37,771 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 12:07:37,802 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 12:07:37,803 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 12:07:37,803 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 12:07:37,803 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 12:07:37,803 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 12:07:37,804 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 12:07:37,804 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 12:07:37,804 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 12:07:37,804 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 12:07:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-09-07 12:07:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 12:07:37,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:37,836 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:37,838 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:37,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:37,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1461178031, now seen corresponding path program 1 times [2019-09-07 12:07:37,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:37,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:37,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:37,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:07:37,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:37,999 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 12:07:38,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:07:38,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 12:07:38,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 12:07:38,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 12:07:38,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 12:07:38,022 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-09-07 12:07:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:38,047 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-09-07 12:07:38,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 12:07:38,049 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-09-07 12:07:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:38,058 INFO L225 Difference]: With dead ends: 54 [2019-09-07 12:07:38,058 INFO L226 Difference]: Without dead ends: 26 [2019-09-07 12:07:38,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 12:07:38,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-07 12:07:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-07 12:07:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-07 12:07:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-07 12:07:38,107 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-09-07 12:07:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:38,108 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-07 12:07:38,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 12:07:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-07 12:07:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 12:07:38,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:38,111 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:38,112 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:38,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:38,112 INFO L82 PathProgramCache]: Analyzing trace with hash -595992629, now seen corresponding path program 1 times [2019-09-07 12:07:38,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:38,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:38,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:38,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:07:38,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 12:07:38,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:07:38,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:07:38,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:07:38,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:07:38,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:07:38,179 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-09-07 12:07:38,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:38,201 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-09-07 12:07:38,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:07:38,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-07 12:07:38,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:38,203 INFO L225 Difference]: With dead ends: 46 [2019-09-07 12:07:38,203 INFO L226 Difference]: Without dead ends: 28 [2019-09-07 12:07:38,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:07:38,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-07 12:07:38,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-07 12:07:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 12:07:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-07 12:07:38,213 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-09-07 12:07:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:38,213 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-07 12:07:38,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:07:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-07 12:07:38,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 12:07:38,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:38,215 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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-07 12:07:38,216 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:38,216 INFO L82 PathProgramCache]: Analyzing trace with hash 169606189, now seen corresponding path program 1 times [2019-09-07 12:07:38,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:38,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:38,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:38,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:07:38,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:38,284 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 12:07:38,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:38,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:38,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:07:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:38,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 12:07:38,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 12:07:38,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 12:07:38,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 12:07:38,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 12:07:38,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 12:07:38,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 12:07:38,440 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-09-07 12:07:38,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:38,463 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-09-07 12:07:38,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:07:38,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-09-07 12:07:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:38,465 INFO L225 Difference]: With dead ends: 46 [2019-09-07 12:07:38,466 INFO L226 Difference]: Without dead ends: 29 [2019-09-07 12:07:38,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-07 12:07:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-07 12:07:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-07 12:07:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-07 12:07:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-07 12:07:38,473 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-09-07 12:07:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:38,474 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-07 12:07:38,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 12:07:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-07 12:07:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 12:07:38,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:38,476 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-07 12:07:38,476 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:38,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:38,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1462689141, now seen corresponding path program 1 times [2019-09-07 12:07:38,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:38,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:38,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:38,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:07:38,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 12:07:38,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 12:07:38,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 12:07:38,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 12:07:38,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 12:07:38,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:07:38,606 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-09-07 12:07:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:38,624 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-09-07 12:07:38,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 12:07:38,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-09-07 12:07:38,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:38,626 INFO L225 Difference]: With dead ends: 43 [2019-09-07 12:07:38,627 INFO L226 Difference]: Without dead ends: 30 [2019-09-07 12:07:38,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 12:07:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-07 12:07:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-07 12:07:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-07 12:07:38,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-07 12:07:38,634 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-09-07 12:07:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:38,636 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-07 12:07:38,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 12:07:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-07 12:07:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 12:07:38,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:38,639 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-07 12:07:38,639 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:38,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:38,639 INFO L82 PathProgramCache]: Analyzing trace with hash -233991671, now seen corresponding path program 1 times [2019-09-07 12:07:38,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:38,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:38,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:38,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:07:38,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 12:07:38,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:38,731 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) [2019-09-07 12:07:38,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:38,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 12:07:38,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 12:07:38,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:38,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 12:07:38,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 12:07:38,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 12:07:38,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:07:38,869 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-09-07 12:07:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:38,901 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-09-07 12:07:38,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 12:07:38,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-09-07 12:07:38,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:38,903 INFO L225 Difference]: With dead ends: 52 [2019-09-07 12:07:38,903 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 12:07:38,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 12:07:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 12:07:38,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-07 12:07:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-07 12:07:38,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-07 12:07:38,913 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-09-07 12:07:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:38,913 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-07 12:07:38,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 12:07:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-07 12:07:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 12:07:38,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:38,915 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:38,915 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:38,916 INFO L82 PathProgramCache]: Analyzing trace with hash 4791275, now seen corresponding path program 2 times [2019-09-07 12:07:38,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:38,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:38,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:38,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:07:38,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-07 12:07:39,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:39,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:07:39,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:39,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:07:39,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:39,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 12:07:39,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-07 12:07:39,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:39,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-07 12:07:39,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 12:07:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 12:07:39,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:07:39,149 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 7 states. [2019-09-07 12:07:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:39,224 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2019-09-07 12:07:39,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 12:07:39,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-09-07 12:07:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:39,225 INFO L225 Difference]: With dead ends: 57 [2019-09-07 12:07:39,226 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 12:07:39,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:07:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 12:07:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-07 12:07:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-07 12:07:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-07 12:07:39,240 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 44 [2019-09-07 12:07:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:39,240 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-07 12:07:39,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 12:07:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-07 12:07:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 12:07:39,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:39,245 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 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-07 12:07:39,245 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:39,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:39,246 INFO L82 PathProgramCache]: Analyzing trace with hash 602858155, now seen corresponding path program 3 times [2019-09-07 12:07:39,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:39,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:39,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:39,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:39,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:39,335 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 12:07:39,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:39,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:07:39,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:39,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 12:07:39,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:39,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 12:07:39,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:39,410 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-07 12:07:39,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:39,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-09-07 12:07:39,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 12:07:39,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 12:07:39,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:07:39,417 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2019-09-07 12:07:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:39,476 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-09-07 12:07:39,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 12:07:39,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-09-07 12:07:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:39,478 INFO L225 Difference]: With dead ends: 62 [2019-09-07 12:07:39,478 INFO L226 Difference]: Without dead ends: 41 [2019-09-07 12:07:39,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:07:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-07 12:07:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-09-07 12:07:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-07 12:07:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-07 12:07:39,485 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 52 [2019-09-07 12:07:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:39,485 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-07 12:07:39,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 12:07:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-07 12:07:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 12:07:39,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:39,487 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:39,487 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:39,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:39,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1131907463, now seen corresponding path program 4 times [2019-09-07 12:07:39,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:39,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:39,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:39,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:39,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-07 12:07:39,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:39,586 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:39,600 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 12:07:39,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:07:39,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:39,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 12:07:39,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-07 12:07:39,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:39,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 12:07:39,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 12:07:39,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 12:07:39,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:07:39,685 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2019-09-07 12:07:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:39,739 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2019-09-07 12:07:39,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 12:07:39,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-09-07 12:07:39,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:39,741 INFO L225 Difference]: With dead ends: 68 [2019-09-07 12:07:39,741 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 12:07:39,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:07:39,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 12:07:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-07 12:07:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-07 12:07:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-07 12:07:39,760 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 60 [2019-09-07 12:07:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:39,761 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-07 12:07:39,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 12:07:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-07 12:07:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 12:07:39,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:39,763 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:39,765 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:39,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:39,766 INFO L82 PathProgramCache]: Analyzing trace with hash 397221609, now seen corresponding path program 5 times [2019-09-07 12:07:39,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:39,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:39,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:39,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:39,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 12:07:39,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:39,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:39,908 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 12:07:39,968 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-07 12:07:39,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:39,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 12:07:39,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:40,005 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 52 proven. 9 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:07:40,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:40,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 12:07:40,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 12:07:40,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 12:07:40,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:07:40,014 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2019-09-07 12:07:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:40,055 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-09-07 12:07:40,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 12:07:40,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-09-07 12:07:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:40,058 INFO L225 Difference]: With dead ends: 69 [2019-09-07 12:07:40,058 INFO L226 Difference]: Without dead ends: 44 [2019-09-07 12:07:40,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:07:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-07 12:07:40,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-07 12:07:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-07 12:07:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-07 12:07:40,074 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 62 [2019-09-07 12:07:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:40,075 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-07 12:07:40,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 12:07:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-07 12:07:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 12:07:40,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:40,079 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:40,079 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash 236717639, now seen corresponding path program 6 times [2019-09-07 12:07:40,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:40,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:40,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-07 12:07:40,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:40,193 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-07 12:07:40,207 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:40,260 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-07 12:07:40,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:40,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 12:07:40,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 90 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-07 12:07:40,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:40,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 12:07:40,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 12:07:40,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 12:07:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:07:40,293 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2019-09-07 12:07:40,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:40,319 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2019-09-07 12:07:40,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 12:07:40,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-07 12:07:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:40,322 INFO L225 Difference]: With dead ends: 65 [2019-09-07 12:07:40,323 INFO L226 Difference]: Without dead ends: 46 [2019-09-07 12:07:40,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 12:07:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-07 12:07:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-07 12:07:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-07 12:07:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-07 12:07:40,337 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 68 [2019-09-07 12:07:40,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:40,338 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-07 12:07:40,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 12:07:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-07 12:07:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 12:07:40,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:40,339 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:40,339 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:40,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1582231867, now seen corresponding path program 7 times [2019-09-07 12:07:40,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:40,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:40,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:40,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:40,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-07 12:07:40,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:40,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:40,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:07:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:40,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 12:07:40,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-07 12:07:40,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:40,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 12:07:40,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 12:07:40,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 12:07:40,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 12:07:40,602 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 8 states. [2019-09-07 12:07:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:40,646 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-09-07 12:07:40,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 12:07:40,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-09-07 12:07:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:40,647 INFO L225 Difference]: With dead ends: 78 [2019-09-07 12:07:40,648 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 12:07:40,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 12:07:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 12:07:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-07 12:07:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 12:07:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-07 12:07:40,668 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 70 [2019-09-07 12:07:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:40,668 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-07 12:07:40,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 12:07:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-07 12:07:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 12:07:40,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:40,673 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 5, 5, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:40,673 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:40,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:40,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1824730713, now seen corresponding path program 8 times [2019-09-07 12:07:40,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:40,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:40,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:40,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:07:40,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-07 12:07:40,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:40,764 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) [2019-09-07 12:07:40,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:40,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:07:40,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:40,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 12:07:40,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-09-07 12:07:40,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:40,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 12:07:40,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 12:07:40,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 12:07:40,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:07:40,923 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 13 states. [2019-09-07 12:07:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:40,997 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2019-09-07 12:07:40,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 12:07:40,999 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-09-07 12:07:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:41,002 INFO L225 Difference]: With dead ends: 83 [2019-09-07 12:07:41,002 INFO L226 Difference]: Without dead ends: 53 [2019-09-07 12:07:41,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:07:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-07 12:07:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-09-07 12:07:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-07 12:07:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-07 12:07:41,011 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 72 [2019-09-07 12:07:41,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:41,011 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-07 12:07:41,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 12:07:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-07 12:07:41,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 12:07:41,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:41,014 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:41,014 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:41,014 INFO L82 PathProgramCache]: Analyzing trace with hash -345746841, now seen corresponding path program 9 times [2019-09-07 12:07:41,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:41,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:41,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:41,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:41,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-07 12:07:41,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:41,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:41,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 12:07:41,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-07 12:07:41,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:41,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 12:07:41,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 176 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-07 12:07:41,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:41,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 12:07:41,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 12:07:41,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 12:07:41,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:07:41,199 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2019-09-07 12:07:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:41,230 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-09-07 12:07:41,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 12:07:41,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-09-07 12:07:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:41,232 INFO L225 Difference]: With dead ends: 75 [2019-09-07 12:07:41,232 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 12:07:41,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 12:07:41,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 12:07:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-07 12:07:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-07 12:07:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-07 12:07:41,237 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 80 [2019-09-07 12:07:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:41,238 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-07 12:07:41,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 12:07:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-07 12:07:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 12:07:41,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:41,239 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:41,239 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:41,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:41,240 INFO L82 PathProgramCache]: Analyzing trace with hash 180247269, now seen corresponding path program 10 times [2019-09-07 12:07:41,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:41,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:41,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:41,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:41,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 12:07:41,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:41,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:07:41,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:41,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:07:41,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:41,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 12:07:41,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 12:07:41,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:41,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 12:07:41,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 12:07:41,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 12:07:41,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:07:41,426 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 9 states. [2019-09-07 12:07:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:41,465 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2019-09-07 12:07:41,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 12:07:41,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-07 12:07:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:41,467 INFO L225 Difference]: With dead ends: 89 [2019-09-07 12:07:41,467 INFO L226 Difference]: Without dead ends: 56 [2019-09-07 12:07:41,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 12:07:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-07 12:07:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-07 12:07:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-07 12:07:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-07 12:07:41,480 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 82 [2019-09-07 12:07:41,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:41,480 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-07 12:07:41,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 12:07:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-07 12:07:41,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-07 12:07:41,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:41,484 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:41,484 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:41,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:41,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1497902269, now seen corresponding path program 11 times [2019-09-07 12:07:41,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:41,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:41,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:41,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:41,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2019-09-07 12:07:41,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:41,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:41,576 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 12:07:41,665 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-07 12:07:41,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:41,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 12:07:41,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-09-07 12:07:41,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:41,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-09-07 12:07:41,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 12:07:41,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 12:07:41,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 12:07:41,761 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 14 states. [2019-09-07 12:07:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:41,829 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2019-09-07 12:07:41,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 12:07:41,831 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2019-09-07 12:07:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:41,832 INFO L225 Difference]: With dead ends: 96 [2019-09-07 12:07:41,832 INFO L226 Difference]: Without dead ends: 61 [2019-09-07 12:07:41,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-07 12:07:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-07 12:07:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-07 12:07:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-07 12:07:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-07 12:07:41,844 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 88 [2019-09-07 12:07:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:41,844 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-07 12:07:41,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 12:07:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-07 12:07:41,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 12:07:41,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:41,845 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:41,846 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:41,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1395924767, now seen corresponding path program 12 times [2019-09-07 12:07:41,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:41,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:41,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:41,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:41,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-09-07 12:07:41,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:41,962 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-07 12:07:41,989 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 12:07:42,134 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 12:07:42,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:42,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 12:07:42,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-09-07 12:07:42,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:42,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-09-07 12:07:42,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 12:07:42,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 12:07:42,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 12:07:42,228 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 15 states. [2019-09-07 12:07:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:42,308 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2019-09-07 12:07:42,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 12:07:42,311 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-09-07 12:07:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:42,313 INFO L225 Difference]: With dead ends: 105 [2019-09-07 12:07:42,313 INFO L226 Difference]: Without dead ends: 65 [2019-09-07 12:07:42,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 12:07:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-07 12:07:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-09-07 12:07:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-07 12:07:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-07 12:07:42,323 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 96 [2019-09-07 12:07:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:42,325 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-07 12:07:42,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 12:07:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-07 12:07:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 12:07:42,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:42,328 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 7, 7, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:42,328 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:42,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:42,329 INFO L82 PathProgramCache]: Analyzing trace with hash 51602815, now seen corresponding path program 13 times [2019-09-07 12:07:42,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:42,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:42,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:42,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:42,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 12:07:42,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:42,439 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-07 12:07:42,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:07:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:42,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 12:07:42,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 12:07:42,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:42,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 12:07:42,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 12:07:42,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 12:07:42,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:07:42,543 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 11 states. [2019-09-07 12:07:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:42,574 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-09-07 12:07:42,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 12:07:42,576 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2019-09-07 12:07:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:42,577 INFO L225 Difference]: With dead ends: 108 [2019-09-07 12:07:42,577 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 12:07:42,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 12:07:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 12:07:42,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-07 12:07:42,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-07 12:07:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-07 12:07:42,582 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 100 [2019-09-07 12:07:42,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:42,582 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-07 12:07:42,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 12:07:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-07 12:07:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 12:07:42,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:42,584 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 8, 8, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:42,584 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:42,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:42,584 INFO L82 PathProgramCache]: Analyzing trace with hash -861900575, now seen corresponding path program 14 times [2019-09-07 12:07:42,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:42,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:42,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:42,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:07:42,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2019-09-07 12:07:42,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:42,690 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) [2019-09-07 12:07:42,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:42,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:07:42,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:42,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 12:07:42,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 12:07:43,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:43,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 12:07:43,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 12:07:43,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 12:07:43,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 12:07:43,043 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 19 states. [2019-09-07 12:07:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:43,206 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-09-07 12:07:43,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 12:07:43,206 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 102 [2019-09-07 12:07:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:43,208 INFO L225 Difference]: With dead ends: 113 [2019-09-07 12:07:43,208 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 12:07:43,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 12:07:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 12:07:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-09-07 12:07:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-07 12:07:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-07 12:07:43,218 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 102 [2019-09-07 12:07:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:43,218 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-07 12:07:43,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 12:07:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-07 12:07:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 12:07:43,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:43,220 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:43,220 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:43,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:43,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1202945119, now seen corresponding path program 15 times [2019-09-07 12:07:43,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:43,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:43,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:43,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:43,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2019-09-07 12:07:43,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:43,345 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) [2019-09-07 12:07:43,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:43,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 12:07:43,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:43,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 12:07:43,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-09-07 12:07:43,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:43,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 12:07:43,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 12:07:43,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 12:07:43,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 12:07:43,502 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 10 states. [2019-09-07 12:07:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:43,541 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-09-07 12:07:43,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 12:07:43,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2019-09-07 12:07:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:43,543 INFO L225 Difference]: With dead ends: 99 [2019-09-07 12:07:43,543 INFO L226 Difference]: Without dead ends: 72 [2019-09-07 12:07:43,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 12:07:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-07 12:07:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-09-07 12:07:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-07 12:07:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-09-07 12:07:43,551 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 110 [2019-09-07 12:07:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:43,551 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-09-07 12:07:43,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 12:07:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-09-07 12:07:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 12:07:43,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:43,553 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 9, 9, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:43,553 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:43,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:43,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1345733217, now seen corresponding path program 16 times [2019-09-07 12:07:43,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:43,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:43,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:43,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:43,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2019-09-07 12:07:43,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:43,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:43,671 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 12:07:43,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:07:43,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:43,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 12:07:43,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-09-07 12:07:43,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:43,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-09-07 12:07:43,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 12:07:43,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 12:07:43,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 12:07:43,876 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 21 states. [2019-09-07 12:07:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:43,953 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2019-09-07 12:07:43,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 12:07:43,953 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 112 [2019-09-07 12:07:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:43,954 INFO L225 Difference]: With dead ends: 123 [2019-09-07 12:07:43,954 INFO L226 Difference]: Without dead ends: 77 [2019-09-07 12:07:43,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-09-07 12:07:43,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-07 12:07:43,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-09-07 12:07:43,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-07 12:07:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-09-07 12:07:43,959 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 112 [2019-09-07 12:07:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:43,959 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-09-07 12:07:43,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 12:07:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-09-07 12:07:43,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-07 12:07:43,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:43,961 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 10, 10, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:43,961 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash -154970529, now seen corresponding path program 17 times [2019-09-07 12:07:43,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:43,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:43,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:43,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:43,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2019-09-07 12:07:44,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:44,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:44,128 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 12:07:44,484 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-09-07 12:07:44,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:44,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 12:07:44,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2019-09-07 12:07:44,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:44,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2019-09-07 12:07:44,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 12:07:44,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 12:07:44,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 12:07:44,685 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-09-07 12:07:44,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:44,787 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2019-09-07 12:07:44,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 12:07:44,787 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 120 [2019-09-07 12:07:44,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:44,788 INFO L225 Difference]: With dead ends: 128 [2019-09-07 12:07:44,788 INFO L226 Difference]: Without dead ends: 81 [2019-09-07 12:07:44,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-09-07 12:07:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-07 12:07:44,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-09-07 12:07:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 12:07:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2019-09-07 12:07:44,795 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 120 [2019-09-07 12:07:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:44,795 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-09-07 12:07:44,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 12:07:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2019-09-07 12:07:44,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-07 12:07:44,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:44,797 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:44,798 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:44,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:44,798 INFO L82 PathProgramCache]: Analyzing trace with hash 313490235, now seen corresponding path program 18 times [2019-09-07 12:07:44,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:44,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:44,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:44,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:44,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2019-09-07 12:07:44,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:44,960 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) [2019-09-07 12:07:44,985 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:45,610 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 12:07:45,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:45,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 12:07:45,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:07:45,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:45,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 12:07:45,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 12:07:45,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 12:07:45,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 12:07:45,645 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 12 states. [2019-09-07 12:07:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:45,691 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-09-07 12:07:45,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 12:07:45,692 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2019-09-07 12:07:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:45,693 INFO L225 Difference]: With dead ends: 113 [2019-09-07 12:07:45,694 INFO L226 Difference]: Without dead ends: 82 [2019-09-07 12:07:45,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 12:07:45,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-07 12:07:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-07 12:07:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 12:07:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-09-07 12:07:45,700 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 128 [2019-09-07 12:07:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:45,700 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-09-07 12:07:45,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 12:07:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-09-07 12:07:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 12:07:45,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:45,702 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:45,702 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:45,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:45,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1422542521, now seen corresponding path program 19 times [2019-09-07 12:07:45,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:45,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:45,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:45,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:45,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-09-07 12:07:45,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:45,870 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-07 12:07:45,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:45,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 12:07:45,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:07:46,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:46,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-07 12:07:46,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 12:07:46,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 12:07:46,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 12:07:46,013 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 14 states. [2019-09-07 12:07:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:46,058 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-09-07 12:07:46,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 12:07:46,060 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-09-07 12:07:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:46,061 INFO L225 Difference]: With dead ends: 138 [2019-09-07 12:07:46,061 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 12:07:46,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 12:07:46,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 12:07:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-07 12:07:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 12:07:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2019-09-07 12:07:46,066 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 130 [2019-09-07 12:07:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:46,066 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2019-09-07 12:07:46,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 12:07:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2019-09-07 12:07:46,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-07 12:07:46,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:46,068 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 11, 11, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:46,068 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:46,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1420903781, now seen corresponding path program 20 times [2019-09-07 12:07:46,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:46,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:46,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:46,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:07:46,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2019-09-07 12:07:46,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:46,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:46,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 12:07:46,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:07:46,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:46,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 12:07:46,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:46,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-09-07 12:07:46,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:46,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-07 12:07:46,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 12:07:46,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 12:07:46,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 12:07:46,465 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 25 states. [2019-09-07 12:07:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:46,559 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-09-07 12:07:46,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 12:07:46,560 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2019-09-07 12:07:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:46,561 INFO L225 Difference]: With dead ends: 143 [2019-09-07 12:07:46,561 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 12:07:46,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 12:07:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 12:07:46,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-09-07 12:07:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-07 12:07:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-09-07 12:07:46,566 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 132 [2019-09-07 12:07:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:46,567 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-09-07 12:07:46,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 12:07:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-09-07 12:07:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 12:07:46,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:46,569 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 12, 12, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:46,569 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:46,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:46,569 INFO L82 PathProgramCache]: Analyzing trace with hash -770351269, now seen corresponding path program 21 times [2019-09-07 12:07:46,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:46,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:46,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:46,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:46,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1314 trivial. 0 not checked. [2019-09-07 12:07:46,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:46,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:46,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 12:07:47,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-09-07 12:07:47,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:47,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 12:07:47,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 538 proven. 81 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2019-09-07 12:07:47,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:47,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 12:07:47,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 12:07:47,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 12:07:47,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:07:47,320 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 13 states. [2019-09-07 12:07:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:47,379 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2019-09-07 12:07:47,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 12:07:47,380 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 140 [2019-09-07 12:07:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:47,382 INFO L225 Difference]: With dead ends: 123 [2019-09-07 12:07:47,382 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 12:07:47,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 12:07:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 12:07:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-07 12:07:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-07 12:07:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-09-07 12:07:47,386 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 140 [2019-09-07 12:07:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:47,387 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-09-07 12:07:47,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 12:07:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-09-07 12:07:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 12:07:47,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:47,388 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 12, 12, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:47,388 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:47,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:47,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1742940889, now seen corresponding path program 22 times [2019-09-07 12:07:47,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:47,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:47,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:47,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:47,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 0 proven. 657 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2019-09-07 12:07:47,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:47,550 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) [2019-09-07 12:07:47,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:47,616 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:07:47,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:47,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 12:07:47,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1414 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 757 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-07 12:07:47,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:47,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 12:07:47,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 12:07:47,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 12:07:47,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 12:07:47,655 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 15 states. [2019-09-07 12:07:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:47,701 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2019-09-07 12:07:47,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 12:07:47,702 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2019-09-07 12:07:47,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:47,703 INFO L225 Difference]: With dead ends: 149 [2019-09-07 12:07:47,703 INFO L226 Difference]: Without dead ends: 92 [2019-09-07 12:07:47,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 12:07:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-07 12:07:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-09-07 12:07:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-07 12:07:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2019-09-07 12:07:47,708 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 142 [2019-09-07 12:07:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:47,708 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2019-09-07 12:07:47,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 12:07:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2019-09-07 12:07:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-07 12:07:47,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:47,710 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 12, 12, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:47,710 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:47,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:47,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1856940489, now seen corresponding path program 23 times [2019-09-07 12:07:47,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:47,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:47,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:47,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:47,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1627 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2019-09-07 12:07:47,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:47,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:47,842 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 12:07:49,927 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-09-07 12:07:49,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:49,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 12:07:49,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1627 backedges. 628 proven. 144 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2019-09-07 12:07:50,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:50,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2019-09-07 12:07:50,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 12:07:50,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 12:07:50,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-09-07 12:07:50,179 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 26 states. [2019-09-07 12:07:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:50,308 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-09-07 12:07:50,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 12:07:50,309 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 148 [2019-09-07 12:07:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:50,311 INFO L225 Difference]: With dead ends: 156 [2019-09-07 12:07:50,311 INFO L226 Difference]: Without dead ends: 97 [2019-09-07 12:07:50,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-09-07 12:07:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-07 12:07:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2019-09-07 12:07:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-07 12:07:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-09-07 12:07:50,321 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 148 [2019-09-07 12:07:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:50,321 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-09-07 12:07:50,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 12:07:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-09-07 12:07:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-07 12:07:50,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:50,326 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 12, 12, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:50,326 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:50,327 INFO L82 PathProgramCache]: Analyzing trace with hash 277518355, now seen corresponding path program 24 times [2019-09-07 12:07:50,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:50,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:50,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:50,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:50,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1879 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-09-07 12:07:50,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:50,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:07:50,606 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:51,226 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 12:07:51,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:51,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 12:07:51,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1879 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-09-07 12:07:51,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:51,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 12:07:51,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 12:07:51,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 12:07:51,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 12:07:51,263 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 16 states. [2019-09-07 12:07:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:51,332 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2019-09-07 12:07:51,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 12:07:51,333 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 156 [2019-09-07 12:07:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:51,333 INFO L225 Difference]: With dead ends: 162 [2019-09-07 12:07:51,334 INFO L226 Difference]: Without dead ends: 98 [2019-09-07 12:07:51,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 12:07:51,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-07 12:07:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-09-07 12:07:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-07 12:07:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2019-09-07 12:07:51,339 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 156 [2019-09-07 12:07:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:51,339 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2019-09-07 12:07:51,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 12:07:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2019-09-07 12:07:51,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-07 12:07:51,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:51,340 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 13, 13, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:51,341 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:51,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:51,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1910106763, now seen corresponding path program 25 times [2019-09-07 12:07:51,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:51,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:51,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:51,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:51,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 1783 trivial. 0 not checked. [2019-09-07 12:07:51,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:51,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:07:51,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:51,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 12:07:51,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-09-07 12:07:51,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:51,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2019-09-07 12:07:51,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 12:07:51,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 12:07:51,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-09-07 12:07:51,781 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 28 states. [2019-09-07 12:07:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:51,925 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2019-09-07 12:07:51,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 12:07:51,925 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 158 [2019-09-07 12:07:51,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:51,926 INFO L225 Difference]: With dead ends: 167 [2019-09-07 12:07:51,926 INFO L226 Difference]: Without dead ends: 103 [2019-09-07 12:07:51,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-09-07 12:07:51,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-07 12:07:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-09-07 12:07:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-07 12:07:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2019-09-07 12:07:51,931 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 158 [2019-09-07 12:07:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:51,932 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2019-09-07 12:07:51,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 12:07:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2019-09-07 12:07:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-07 12:07:51,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:51,933 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 14, 14, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:51,933 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:51,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash -351678763, now seen corresponding path program 26 times [2019-09-07 12:07:51,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:51,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:51,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:07:51,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 0 proven. 905 refuted. 0 times theorem prover too weak. 1049 trivial. 0 not checked. [2019-09-07 12:07:52,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:52,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:07:52,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:52,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:07:52,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:52,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 12:07:52,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 1758 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:07:52,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:52,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-09-07 12:07:52,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 12:07:52,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 12:07:52,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 12:07:52,438 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 31 states. [2019-09-07 12:07:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:52,560 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2019-09-07 12:07:52,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 12:07:52,560 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 162 [2019-09-07 12:07:52,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:52,562 INFO L225 Difference]: With dead ends: 173 [2019-09-07 12:07:52,562 INFO L226 Difference]: Without dead ends: 107 [2019-09-07 12:07:52,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 12:07:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-07 12:07:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-09-07 12:07:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-07 12:07:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-09-07 12:07:52,572 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 162 [2019-09-07 12:07:52,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:52,573 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-09-07 12:07:52,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 12:07:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-09-07 12:07:52,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-07 12:07:52,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:52,575 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 15, 15, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:52,576 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:52,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:52,576 INFO L82 PathProgramCache]: Analyzing trace with hash -712964715, now seen corresponding path program 27 times [2019-09-07 12:07:52,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:52,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:52,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:52,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2019-09-07 12:07:52,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:52,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:52,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 12:07:53,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-07 12:07:53,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:53,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 12:07:53,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 850 proven. 144 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:07:53,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:53,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 12:07:53,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 12:07:53,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 12:07:53,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 12:07:53,470 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 16 states. [2019-09-07 12:07:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:53,526 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2019-09-07 12:07:53,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 12:07:53,527 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 170 [2019-09-07 12:07:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:53,528 INFO L225 Difference]: With dead ends: 147 [2019-09-07 12:07:53,528 INFO L226 Difference]: Without dead ends: 108 [2019-09-07 12:07:53,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 12:07:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-09-07 12:07:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-09-07 12:07:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-07 12:07:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-09-07 12:07:53,533 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 170 [2019-09-07 12:07:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:53,534 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-09-07 12:07:53,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 12:07:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-09-07 12:07:53,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-07 12:07:53,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:53,535 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 15, 15, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:53,535 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:53,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:53,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1388002669, now seen corresponding path program 28 times [2019-09-07 12:07:53,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:53,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:53,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:53,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:53,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2257 backedges. 0 proven. 1044 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2019-09-07 12:07:53,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:53,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:53,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 12:07:53,807 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:07:53,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:53,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 12:07:53,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2257 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-09-07 12:07:54,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:54,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2019-09-07 12:07:54,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 12:07:54,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 12:07:54,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 12:07:54,083 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 33 states. [2019-09-07 12:07:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:54,200 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2019-09-07 12:07:54,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 12:07:54,203 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 172 [2019-09-07 12:07:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:54,204 INFO L225 Difference]: With dead ends: 183 [2019-09-07 12:07:54,204 INFO L226 Difference]: Without dead ends: 113 [2019-09-07 12:07:54,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 12:07:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-07 12:07:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-09-07 12:07:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-07 12:07:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-09-07 12:07:54,211 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 172 [2019-09-07 12:07:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:54,211 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-09-07 12:07:54,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 12:07:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-09-07 12:07:54,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-07 12:07:54,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:54,213 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 16, 16, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:54,213 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:54,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:54,214 INFO L82 PathProgramCache]: Analyzing trace with hash 476938067, now seen corresponding path program 29 times [2019-09-07 12:07:54,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:54,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:54,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:54,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:54,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2555 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 2386 trivial. 0 not checked. [2019-09-07 12:07:54,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:54,410 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:54,458 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 12:07:56,965 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-09-07 12:07:56,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:07:56,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 12:07:56,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:07:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2555 backedges. 964 proven. 225 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2019-09-07 12:07:57,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:07:57,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2019-09-07 12:07:57,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 12:07:57,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 12:07:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-07 12:07:57,266 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 32 states. [2019-09-07 12:07:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:07:57,374 INFO L93 Difference]: Finished difference Result 188 states and 199 transitions. [2019-09-07 12:07:57,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 12:07:57,376 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 180 [2019-09-07 12:07:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:07:57,377 INFO L225 Difference]: With dead ends: 188 [2019-09-07 12:07:57,377 INFO L226 Difference]: Without dead ends: 117 [2019-09-07 12:07:57,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2019-09-07 12:07:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-07 12:07:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-09-07 12:07:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-07 12:07:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-09-07 12:07:57,382 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 180 [2019-09-07 12:07:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:07:57,383 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-09-07 12:07:57,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 12:07:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-09-07 12:07:57,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-07 12:07:57,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:07:57,384 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 16, 16, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:07:57,384 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:07:57,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:07:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash 416291375, now seen corresponding path program 30 times [2019-09-07 12:07:57,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:07:57,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:07:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:57,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:07:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:07:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:07:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2867 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-09-07 12:07:57,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:07:57,567 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:07:57,577 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 12:08:00,859 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-07 12:08:00,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:08:00,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 12:08:00,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:08:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2867 backedges. 1098 proven. 196 refuted. 0 times theorem prover too weak. 1573 trivial. 0 not checked. [2019-09-07 12:08:00,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:08:00,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 12:08:00,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 12:08:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 12:08:00,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 12:08:00,900 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 18 states. [2019-09-07 12:08:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:08:00,968 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2019-09-07 12:08:00,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 12:08:00,969 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 188 [2019-09-07 12:08:00,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:08:00,970 INFO L225 Difference]: With dead ends: 161 [2019-09-07 12:08:00,970 INFO L226 Difference]: Without dead ends: 118 [2019-09-07 12:08:00,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 12:08:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-07 12:08:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-07 12:08:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-07 12:08:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-09-07 12:08:00,976 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 188 [2019-09-07 12:08:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:08:00,976 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-09-07 12:08:00,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 12:08:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-09-07 12:08:00,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-07 12:08:00,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:08:00,978 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 16, 16, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:08:00,978 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:08:00,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:08:00,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1920587603, now seen corresponding path program 31 times [2019-09-07 12:08:00,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:08:00,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:08:00,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:00,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:08:00,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:08:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-09-07 12:08:01,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:08:01,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:08:01,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:08:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:08:01,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 12:08:01,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:08:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-09-07 12:08:01,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:08:01,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-07 12:08:01,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 12:08:01,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 12:08:01,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 12:08:01,348 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 20 states. [2019-09-07 12:08:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:08:01,413 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2019-09-07 12:08:01,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 12:08:01,413 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 190 [2019-09-07 12:08:01,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:08:01,414 INFO L225 Difference]: With dead ends: 198 [2019-09-07 12:08:01,415 INFO L226 Difference]: Without dead ends: 120 [2019-09-07 12:08:01,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 12:08:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-07 12:08:01,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-09-07 12:08:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-07 12:08:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-09-07 12:08:01,420 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 190 [2019-09-07 12:08:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:08:01,421 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-09-07 12:08:01,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 12:08:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-09-07 12:08:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 12:08:01,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:08:01,422 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 17, 17, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:08:01,423 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:08:01,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:08:01,423 INFO L82 PathProgramCache]: Analyzing trace with hash 419155343, now seen corresponding path program 32 times [2019-09-07 12:08:01,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:08:01,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:08:01,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:01,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:08:01,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:08:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2929 backedges. 0 proven. 1352 refuted. 0 times theorem prover too weak. 1577 trivial. 0 not checked. [2019-09-07 12:08:01,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:08:01,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:08:01,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 12:08:01,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:08:01,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:08:01,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 12:08:01,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:08:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2929 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-09-07 12:08:02,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:08:02,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2019-09-07 12:08:02,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 12:08:02,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 12:08:02,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 12:08:02,119 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 37 states. [2019-09-07 12:08:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:08:02,269 INFO L93 Difference]: Finished difference Result 203 states and 215 transitions. [2019-09-07 12:08:02,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 12:08:02,277 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 192 [2019-09-07 12:08:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:08:02,278 INFO L225 Difference]: With dead ends: 203 [2019-09-07 12:08:02,278 INFO L226 Difference]: Without dead ends: 125 [2019-09-07 12:08:02,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 12:08:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-07 12:08:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-09-07 12:08:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-07 12:08:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-09-07 12:08:02,283 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 192 [2019-09-07 12:08:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:08:02,284 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-09-07 12:08:02,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 12:08:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-09-07 12:08:02,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-07 12:08:02,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:08:02,285 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 18, 18, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:08:02,285 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:08:02,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:08:02,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1598450097, now seen corresponding path program 33 times [2019-09-07 12:08:02,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:08:02,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:08:02,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:02,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:08:02,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:08:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2019-09-07 12:08:02,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:08:02,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:08:02,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 12:08:04,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-07 12:08:04,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:08:04,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 12:08:04,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:08:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 1234 proven. 225 refuted. 0 times theorem prover too weak. 1808 trivial. 0 not checked. [2019-09-07 12:08:04,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:08:04,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 12:08:04,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 12:08:04,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 12:08:04,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 12:08:04,478 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 19 states. [2019-09-07 12:08:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:08:04,550 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2019-09-07 12:08:04,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 12:08:04,550 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 200 [2019-09-07 12:08:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:08:04,552 INFO L225 Difference]: With dead ends: 171 [2019-09-07 12:08:04,552 INFO L226 Difference]: Without dead ends: 126 [2019-09-07 12:08:04,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 12:08:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-07 12:08:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-09-07 12:08:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-09-07 12:08:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-09-07 12:08:04,558 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 200 [2019-09-07 12:08:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:08:04,560 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-09-07 12:08:04,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 12:08:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-09-07 12:08:04,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-07 12:08:04,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:08:04,562 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 18, 18, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:08:04,562 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:08:04,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:08:04,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1636869325, now seen corresponding path program 34 times [2019-09-07 12:08:04,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:08:04,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:08:04,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:04,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:08:04,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:08:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3298 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2019-09-07 12:08:04,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:08:04,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:08:04,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 12:08:04,913 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:08:04,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:08:04,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 12:08:04,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:08:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3298 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2019-09-07 12:08:05,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:08:05,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2019-09-07 12:08:05,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 12:08:05,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 12:08:05,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 12:08:05,330 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 39 states. [2019-09-07 12:08:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:08:05,450 INFO L93 Difference]: Finished difference Result 213 states and 225 transitions. [2019-09-07 12:08:05,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 12:08:05,450 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 202 [2019-09-07 12:08:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:08:05,452 INFO L225 Difference]: With dead ends: 213 [2019-09-07 12:08:05,452 INFO L226 Difference]: Without dead ends: 131 [2019-09-07 12:08:05,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 12:08:05,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-07 12:08:05,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2019-09-07 12:08:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-09-07 12:08:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2019-09-07 12:08:05,458 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 202 [2019-09-07 12:08:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:08:05,459 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2019-09-07 12:08:05,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 12:08:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2019-09-07 12:08:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-07 12:08:05,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:08:05,461 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 19, 19, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:08:05,461 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:08:05,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:08:05,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1825442931, now seen corresponding path program 35 times [2019-09-07 12:08:05,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:08:05,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:08:05,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:05,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:08:05,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:08:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3656 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 3400 trivial. 0 not checked. [2019-09-07 12:08:05,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:08:05,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:08:05,726 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:08:25,864 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-09-07 12:08:25,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:08:25,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 12:08:25,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:08:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3656 backedges. 1372 proven. 324 refuted. 0 times theorem prover too weak. 1960 trivial. 0 not checked. [2019-09-07 12:08:26,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:08:26,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2019-09-07 12:08:26,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 12:08:26,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 12:08:26,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 12:08:26,227 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 38 states. [2019-09-07 12:08:26,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:08:26,373 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2019-09-07 12:08:26,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 12:08:26,373 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 210 [2019-09-07 12:08:26,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:08:26,375 INFO L225 Difference]: With dead ends: 218 [2019-09-07 12:08:26,375 INFO L226 Difference]: Without dead ends: 135 [2019-09-07 12:08:26,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 12:08:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-09-07 12:08:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2019-09-07 12:08:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-07 12:08:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2019-09-07 12:08:26,380 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 210 [2019-09-07 12:08:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:08:26,381 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2019-09-07 12:08:26,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 12:08:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2019-09-07 12:08:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-07 12:08:26,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:08:26,383 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 19, 19, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:08:26,383 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:08:26,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:08:26,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1061136745, now seen corresponding path program 36 times [2019-09-07 12:08:26,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:08:26,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:08:26,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:26,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:08:26,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:08:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4028 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 3739 trivial. 0 not checked. [2019-09-07 12:08:26,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:08:26,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:08:26,676 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:08:29,045 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-07 12:08:29,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:08:29,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 12:08:29,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:08:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4028 backedges. 1530 proven. 289 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:08:29,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:08:29,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 12:08:29,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 12:08:29,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 12:08:29,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 12:08:29,100 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 21 states. [2019-09-07 12:08:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:08:29,192 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2019-09-07 12:08:29,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 12:08:29,193 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 218 [2019-09-07 12:08:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:08:29,194 INFO L225 Difference]: With dead ends: 185 [2019-09-07 12:08:29,194 INFO L226 Difference]: Without dead ends: 136 [2019-09-07 12:08:29,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 12:08:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-07 12:08:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-07 12:08:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-07 12:08:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-09-07 12:08:29,201 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 218 [2019-09-07 12:08:29,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:08:29,202 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-09-07 12:08:29,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 12:08:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-09-07 12:08:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-07 12:08:29,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:08:29,204 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 19, 19, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:08:29,205 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:08:29,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:08:29,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1865902439, now seen corresponding path program 37 times [2019-09-07 12:08:29,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:08:29,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:08:29,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:29,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:08:29,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:08:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-09-07 12:08:29,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:08:29,501 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:08:29,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:08:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:08:29,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 12:08:29,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:08:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-09-07 12:08:29,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:08:29,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 12:08:29,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 12:08:29,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 12:08:29,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 12:08:29,649 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 23 states. [2019-09-07 12:08:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:08:29,719 INFO L93 Difference]: Finished difference Result 228 states and 236 transitions. [2019-09-07 12:08:29,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 12:08:29,720 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 220 [2019-09-07 12:08:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:08:29,721 INFO L225 Difference]: With dead ends: 228 [2019-09-07 12:08:29,721 INFO L226 Difference]: Without dead ends: 138 [2019-09-07 12:08:29,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 12:08:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-07 12:08:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-09-07 12:08:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-07 12:08:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2019-09-07 12:08:29,727 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 220 [2019-09-07 12:08:29,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:08:29,727 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2019-09-07 12:08:29,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 12:08:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2019-09-07 12:08:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-07 12:08:29,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:08:29,729 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 20, 20, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:08:29,729 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:08:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:08:29,730 INFO L82 PathProgramCache]: Analyzing trace with hash -709437751, now seen corresponding path program 38 times [2019-09-07 12:08:29,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:08:29,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:08:29,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:29,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:08:29,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:08:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4102 backedges. 0 proven. 1889 refuted. 0 times theorem prover too weak. 2213 trivial. 0 not checked. [2019-09-07 12:08:30,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:08:30,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:08:30,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 12:08:30,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:08:30,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:08:30,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 12:08:30,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:08:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4102 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-09-07 12:08:30,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:08:30,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-09-07 12:08:30,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 12:08:30,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 12:08:30,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 12:08:30,723 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 43 states. [2019-09-07 12:08:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:08:30,885 INFO L93 Difference]: Finished difference Result 233 states and 245 transitions. [2019-09-07 12:08:30,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 12:08:30,889 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 222 [2019-09-07 12:08:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:08:30,890 INFO L225 Difference]: With dead ends: 233 [2019-09-07 12:08:30,890 INFO L226 Difference]: Without dead ends: 143 [2019-09-07 12:08:30,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 12:08:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-07 12:08:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-09-07 12:08:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-07 12:08:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2019-09-07 12:08:30,898 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 222 [2019-09-07 12:08:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:08:30,898 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2019-09-07 12:08:30,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 12:08:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2019-09-07 12:08:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-07 12:08:30,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:08:30,900 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 21, 21, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:08:30,900 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:08:30,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:08:30,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1789841015, now seen corresponding path program 39 times [2019-09-07 12:08:30,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:08:30,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:08:30,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:30,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:08:30,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:08:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4500 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 4176 trivial. 0 not checked. [2019-09-07 12:08:31,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:08:31,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:08:31,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 12:08:36,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-07 12:08:36,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:08:36,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 12:08:36,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:08:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4500 backedges. 1690 proven. 324 refuted. 0 times theorem prover too weak. 2486 trivial. 0 not checked. [2019-09-07 12:08:36,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:08:36,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 12:08:36,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 12:08:36,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 12:08:36,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 12:08:36,437 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 22 states. [2019-09-07 12:08:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:08:36,528 INFO L93 Difference]: Finished difference Result 195 states and 200 transitions. [2019-09-07 12:08:36,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 12:08:36,528 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 230 [2019-09-07 12:08:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:08:36,530 INFO L225 Difference]: With dead ends: 195 [2019-09-07 12:08:36,530 INFO L226 Difference]: Without dead ends: 144 [2019-09-07 12:08:36,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 12:08:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-07 12:08:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2019-09-07 12:08:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-07 12:08:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2019-09-07 12:08:36,538 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 230 [2019-09-07 12:08:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:08:36,539 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2019-09-07 12:08:36,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 12:08:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2019-09-07 12:08:36,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-07 12:08:36,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:08:36,541 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 21, 21, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:08:36,541 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:08:36,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:08:36,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1882132089, now seen corresponding path program 40 times [2019-09-07 12:08:36,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:08:36,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:08:36,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:36,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:08:36,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:08:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4537 backedges. 0 proven. 2088 refuted. 0 times theorem prover too weak. 2449 trivial. 0 not checked. [2019-09-07 12:08:36,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:08:36,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:08:36,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 12:08:36,936 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:08:36,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:08:36,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 12:08:36,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:08:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4537 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 4096 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:08:37,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:08:37,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2019-09-07 12:08:37,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 12:08:37,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 12:08:37,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 12:08:37,545 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 45 states. [2019-09-07 12:08:37,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:08:37,775 INFO L93 Difference]: Finished difference Result 243 states and 255 transitions. [2019-09-07 12:08:37,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 12:08:37,775 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 232 [2019-09-07 12:08:37,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:08:37,777 INFO L225 Difference]: With dead ends: 243 [2019-09-07 12:08:37,777 INFO L226 Difference]: Without dead ends: 149 [2019-09-07 12:08:37,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 12:08:37,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-07 12:08:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2019-09-07 12:08:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-07 12:08:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-09-07 12:08:37,783 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 232 [2019-09-07 12:08:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:08:37,784 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-09-07 12:08:37,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 12:08:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-09-07 12:08:37,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-07 12:08:37,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:08:37,786 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 22, 22, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:08:37,786 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:08:37,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:08:37,787 INFO L82 PathProgramCache]: Analyzing trace with hash -377433529, now seen corresponding path program 41 times [2019-09-07 12:08:37,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:08:37,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:08:37,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:37,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:08:37,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:08:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:08:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4955 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 4594 trivial. 0 not checked. [2019-09-07 12:08:38,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:08:38,070 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:08:38,080 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 12:09:36,724 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2019-09-07 12:09:36,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:09:36,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 12:09:36,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:09:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4955 backedges. 1852 proven. 441 refuted. 0 times theorem prover too weak. 2662 trivial. 0 not checked. [2019-09-07 12:09:37,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:09:37,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2019-09-07 12:09:37,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 12:09:37,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 12:09:37,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 12:09:37,164 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 44 states. [2019-09-07 12:09:37,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:09:37,342 INFO L93 Difference]: Finished difference Result 248 states and 259 transitions. [2019-09-07 12:09:37,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 12:09:37,342 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 240 [2019-09-07 12:09:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:09:37,344 INFO L225 Difference]: With dead ends: 248 [2019-09-07 12:09:37,344 INFO L226 Difference]: Without dead ends: 153 [2019-09-07 12:09:37,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=506, Invalid=1386, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 12:09:37,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-07 12:09:37,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-09-07 12:09:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-09-07 12:09:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2019-09-07 12:09:37,350 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 240 [2019-09-07 12:09:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:09:37,350 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2019-09-07 12:09:37,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 12:09:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2019-09-07 12:09:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-07 12:09:37,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:09:37,352 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 22, 22, 20, 20, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:09:37,352 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:09:37,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:09:37,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1533993763, now seen corresponding path program 42 times [2019-09-07 12:09:37,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:09:37,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:09:37,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:09:37,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:09:37,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:09:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:09:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5387 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 4987 trivial. 0 not checked. [2019-09-07 12:09:37,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:09:37,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:09:37,720 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:09:45,272 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-09-07 12:09:45,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:09:45,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 12:09:45,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:09:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5387 backedges. 2077 proven. 400 refuted. 0 times theorem prover too weak. 2910 trivial. 0 not checked. [2019-09-07 12:09:45,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:09:45,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 26 [2019-09-07 12:09:45,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 12:09:45,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 12:09:45,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2019-09-07 12:09:45,385 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 26 states. [2019-09-07 12:09:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:09:45,807 INFO L93 Difference]: Finished difference Result 209 states and 214 transitions. [2019-09-07 12:09:45,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 12:09:45,808 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 248 [2019-09-07 12:09:45,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:09:45,809 INFO L225 Difference]: With dead ends: 209 [2019-09-07 12:09:45,810 INFO L226 Difference]: Without dead ends: 154 [2019-09-07 12:09:45,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=786, Invalid=1376, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 12:09:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-09-07 12:09:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-09-07 12:09:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-07 12:09:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-09-07 12:09:45,827 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 248 [2019-09-07 12:09:45,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:09:45,828 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-09-07 12:09:45,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 12:09:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-09-07 12:09:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-07 12:09:45,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:09:45,830 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 22, 22, 21, 21, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:09:45,832 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:09:45,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:09:45,833 INFO L82 PathProgramCache]: Analyzing trace with hash 982889633, now seen corresponding path program 43 times [2019-09-07 12:09:45,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:09:45,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:09:45,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:09:45,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:09:45,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:09:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:09:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5428 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 4944 trivial. 0 not checked. [2019-09-07 12:09:46,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:09:46,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:09:46,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:09:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:09:46,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 12:09:46,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:09:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5428 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 4944 trivial. 0 not checked. [2019-09-07 12:09:46,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:09:46,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 12:09:46,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 12:09:46,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 12:09:46,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 12:09:46,547 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 26 states. [2019-09-07 12:09:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:09:46,627 INFO L93 Difference]: Finished difference Result 258 states and 266 transitions. [2019-09-07 12:09:46,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 12:09:46,628 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 250 [2019-09-07 12:09:46,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:09:46,629 INFO L225 Difference]: With dead ends: 258 [2019-09-07 12:09:46,629 INFO L226 Difference]: Without dead ends: 156 [2019-09-07 12:09:46,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 12:09:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-07 12:09:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-09-07 12:09:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-07 12:09:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2019-09-07 12:09:46,636 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 250 [2019-09-07 12:09:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:09:46,637 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2019-09-07 12:09:46,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 12:09:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2019-09-07 12:09:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-07 12:09:46,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:09:46,639 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 23, 23, 21, 21, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:09:46,639 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:09:46,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:09:46,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1758131581, now seen corresponding path program 44 times [2019-09-07 12:09:46,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:09:46,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:09:46,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:09:46,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:09:46,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:09:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:09:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5473 backedges. 0 proven. 2516 refuted. 0 times theorem prover too weak. 2957 trivial. 0 not checked. [2019-09-07 12:09:47,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:09:47,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:09:47,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 12:09:47,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:09:47,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:09:47,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 12:09:47,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:09:47,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5473 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 4944 trivial. 0 not checked. [2019-09-07 12:09:47,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:09:47,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2019-09-07 12:09:47,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 12:09:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 12:09:47,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 12:09:47,890 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 49 states. [2019-09-07 12:09:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:09:48,069 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions. [2019-09-07 12:09:48,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 12:09:48,069 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 252 [2019-09-07 12:09:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:09:48,071 INFO L225 Difference]: With dead ends: 263 [2019-09-07 12:09:48,071 INFO L226 Difference]: Without dead ends: 161 [2019-09-07 12:09:48,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 12:09:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-07 12:09:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2019-09-07 12:09:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-07 12:09:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2019-09-07 12:09:48,079 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 252 [2019-09-07 12:09:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:09:48,079 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2019-09-07 12:09:48,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 12:09:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2019-09-07 12:09:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-07 12:09:48,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:09:48,081 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 24, 24, 21, 21, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:09:48,082 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:09:48,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:09:48,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1514272579, now seen corresponding path program 45 times [2019-09-07 12:09:48,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:09:48,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:09:48,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:09:48,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:09:48,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:09:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:09:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5931 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 5490 trivial. 0 not checked. [2019-09-07 12:09:48,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:09:48,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:09:48,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 12:09:54,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-09-07 12:09:54,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:09:54,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 12:09:54,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:09:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5931 backedges. 2218 proven. 441 refuted. 0 times theorem prover too weak. 3272 trivial. 0 not checked. [2019-09-07 12:09:54,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:09:54,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 12:09:54,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 12:09:54,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 12:09:54,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 12:09:54,292 INFO L87 Difference]: Start difference. First operand 159 states and 163 transitions. Second operand 25 states. [2019-09-07 12:09:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:09:54,370 INFO L93 Difference]: Finished difference Result 219 states and 224 transitions. [2019-09-07 12:09:54,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 12:09:54,371 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 260 [2019-09-07 12:09:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:09:54,373 INFO L225 Difference]: With dead ends: 219 [2019-09-07 12:09:54,373 INFO L226 Difference]: Without dead ends: 162 [2019-09-07 12:09:54,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 12:09:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-07 12:09:54,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-09-07 12:09:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-07 12:09:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2019-09-07 12:09:54,380 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 260 [2019-09-07 12:09:54,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:09:54,380 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2019-09-07 12:09:54,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 12:09:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2019-09-07 12:09:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-07 12:09:54,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:09:54,382 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 24, 24, 22, 22, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:09:54,383 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:09:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:09:54,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1367881535, now seen corresponding path program 46 times [2019-09-07 12:09:54,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:09:54,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:09:54,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:09:54,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:09:54,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:09:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:09:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5974 backedges. 0 proven. 2745 refuted. 0 times theorem prover too weak. 3229 trivial. 0 not checked. [2019-09-07 12:09:54,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:09:54,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:09:54,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 12:09:54,857 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:09:54,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:09:54,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 12:09:54,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:09:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5974 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 5398 trivial. 0 not checked. [2019-09-07 12:09:55,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:09:55,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2019-09-07 12:09:55,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 12:09:55,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 12:09:55,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 12:09:55,487 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 51 states. [2019-09-07 12:09:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:09:55,695 INFO L93 Difference]: Finished difference Result 273 states and 285 transitions. [2019-09-07 12:09:55,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 12:09:55,695 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 262 [2019-09-07 12:09:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:09:55,697 INFO L225 Difference]: With dead ends: 273 [2019-09-07 12:09:55,697 INFO L226 Difference]: Without dead ends: 167 [2019-09-07 12:09:55,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 12:09:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-09-07 12:09:55,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2019-09-07 12:09:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-07 12:09:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-09-07 12:09:55,705 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 262 [2019-09-07 12:09:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:09:55,706 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-09-07 12:09:55,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 12:09:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-09-07 12:09:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-07 12:09:55,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:09:55,708 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 25, 25, 22, 22, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:09:55,709 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:09:55,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:09:55,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1765000319, now seen corresponding path program 47 times [2019-09-07 12:09:55,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:09:55,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:09:55,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:09:55,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:09:55,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:09:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:09:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6452 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 5968 trivial. 0 not checked. [2019-09-07 12:09:56,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:09:56,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:09:56,078 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 12:11:24,607 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 50 check-sat command(s) [2019-09-07 12:11:24,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:11:24,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 12:11:24,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:11:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6452 backedges. 2404 proven. 576 refuted. 0 times theorem prover too weak. 3472 trivial. 0 not checked. [2019-09-07 12:11:25,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:11:25,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 50 [2019-09-07 12:11:25,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 12:11:25,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 12:11:25,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=650, Invalid=1800, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 12:11:25,171 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 50 states. [2019-09-07 12:11:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:11:25,396 INFO L93 Difference]: Finished difference Result 278 states and 289 transitions. [2019-09-07 12:11:25,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 12:11:25,397 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 270 [2019-09-07 12:11:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:11:25,398 INFO L225 Difference]: With dead ends: 278 [2019-09-07 12:11:25,398 INFO L226 Difference]: Without dead ends: 171 [2019-09-07 12:11:25,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=650, Invalid=1800, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 12:11:25,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-07 12:11:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-09-07 12:11:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-07 12:11:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 173 transitions. [2019-09-07 12:11:25,406 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 173 transitions. Word has length 270 [2019-09-07 12:11:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:11:25,407 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 173 transitions. [2019-09-07 12:11:25,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 12:11:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2019-09-07 12:11:25,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-07 12:11:25,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:11:25,411 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 25, 25, 23, 23, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:11:25,411 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:11:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:11:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash -692066467, now seen corresponding path program 48 times [2019-09-07 12:11:25,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:11:25,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:11:25,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:25,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:11:25,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:11:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6944 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 6415 trivial. 0 not checked. [2019-09-07 12:11:25,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:11:25,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:11:25,810 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 12:11:43,891 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-09-07 12:11:43,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:11:43,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 12:11:43,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:11:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6944 backedges. 2610 proven. 529 refuted. 0 times theorem prover too weak. 3805 trivial. 0 not checked. [2019-09-07 12:11:43,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:11:43,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-09-07 12:11:43,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 12:11:43,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 12:11:43,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 12:11:43,951 INFO L87 Difference]: Start difference. First operand 169 states and 173 transitions. Second operand 27 states. [2019-09-07 12:11:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:11:44,044 INFO L93 Difference]: Finished difference Result 233 states and 238 transitions. [2019-09-07 12:11:44,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 12:11:44,050 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 278 [2019-09-07 12:11:44,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:11:44,051 INFO L225 Difference]: With dead ends: 233 [2019-09-07 12:11:44,051 INFO L226 Difference]: Without dead ends: 172 [2019-09-07 12:11:44,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 12:11:44,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-07 12:11:44,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-09-07 12:11:44,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-07 12:11:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-09-07 12:11:44,061 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 278 [2019-09-07 12:11:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:11:44,063 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-09-07 12:11:44,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 12:11:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-09-07 12:11:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-07 12:11:44,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:11:44,065 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 25, 25, 24, 24, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:11:44,065 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:11:44,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:11:44,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1853565531, now seen corresponding path program 49 times [2019-09-07 12:11:44,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:11:44,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:11:44,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:44,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:11:44,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:11:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6991 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 6366 trivial. 0 not checked. [2019-09-07 12:11:44,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:11:44,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:11:44,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:11:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:11:44,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 12:11:44,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:11:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6991 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 6366 trivial. 0 not checked. [2019-09-07 12:11:44,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:11:44,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 12:11:44,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 12:11:44,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 12:11:44,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 12:11:44,752 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 29 states. [2019-09-07 12:11:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:11:44,875 INFO L93 Difference]: Finished difference Result 288 states and 296 transitions. [2019-09-07 12:11:44,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 12:11:44,875 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 280 [2019-09-07 12:11:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:11:44,877 INFO L225 Difference]: With dead ends: 288 [2019-09-07 12:11:44,878 INFO L226 Difference]: Without dead ends: 174 [2019-09-07 12:11:44,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 12:11:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-07 12:11:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-07 12:11:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-07 12:11:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2019-09-07 12:11:44,888 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 280 [2019-09-07 12:11:44,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:11:44,889 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2019-09-07 12:11:44,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 12:11:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2019-09-07 12:11:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-07 12:11:44,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:11:44,891 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 26, 26, 24, 24, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:11:44,891 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:11:44,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:11:44,892 INFO L82 PathProgramCache]: Analyzing trace with hash -354907971, now seen corresponding path program 50 times [2019-09-07 12:11:44,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:11:44,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:11:44,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:44,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:11:44,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:11:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7042 backedges. 0 proven. 3233 refuted. 0 times theorem prover too weak. 3809 trivial. 0 not checked. [2019-09-07 12:11:45,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:11:45,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:11:45,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:11:45,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:11:45,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:11:45,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 12:11:45,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:11:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7042 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 6366 trivial. 0 not checked. [2019-09-07 12:11:46,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:11:46,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 55 [2019-09-07 12:11:46,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 12:11:46,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 12:11:46,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 12:11:46,341 INFO L87 Difference]: Start difference. First operand 173 states and 177 transitions. Second operand 55 states. [2019-09-07 12:11:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:11:46,602 INFO L93 Difference]: Finished difference Result 293 states and 305 transitions. [2019-09-07 12:11:46,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 12:11:46,608 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 282 [2019-09-07 12:11:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:11:46,609 INFO L225 Difference]: With dead ends: 293 [2019-09-07 12:11:46,609 INFO L226 Difference]: Without dead ends: 179 [2019-09-07 12:11:46,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 12:11:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-07 12:11:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-09-07 12:11:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-07 12:11:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-09-07 12:11:46,617 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 282 [2019-09-07 12:11:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:11:46,617 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-09-07 12:11:46,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 12:11:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-09-07 12:11:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-07 12:11:46,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:11:46,619 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 27, 27, 24, 24, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:11:46,619 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:11:46,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:11:46,620 INFO L82 PathProgramCache]: Analyzing trace with hash 502138749, now seen corresponding path program 51 times [2019-09-07 12:11:46,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:11:46,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:11:46,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:46,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:11:46,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:11:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:11:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7560 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 6984 trivial. 0 not checked. [2019-09-07 12:11:47,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:11:47,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:11:47,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 12:11:59,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-09-07 12:11:59,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:11:59,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 12:11:59,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:11:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7560 backedges. 2818 proven. 576 refuted. 0 times theorem prover too weak. 4166 trivial. 0 not checked. [2019-09-07 12:12:00,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:12:00,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 12:12:00,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 12:12:00,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 12:12:00,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 12:12:00,003 INFO L87 Difference]: Start difference. First operand 177 states and 181 transitions. Second operand 28 states. [2019-09-07 12:12:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:12:00,082 INFO L93 Difference]: Finished difference Result 243 states and 248 transitions. [2019-09-07 12:12:00,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 12:12:00,083 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 290 [2019-09-07 12:12:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:12:00,084 INFO L225 Difference]: With dead ends: 243 [2019-09-07 12:12:00,084 INFO L226 Difference]: Without dead ends: 180 [2019-09-07 12:12:00,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 12:12:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-07 12:12:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2019-09-07 12:12:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-07 12:12:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 183 transitions. [2019-09-07 12:12:00,090 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 183 transitions. Word has length 290 [2019-09-07 12:12:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:12:00,091 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 183 transitions. [2019-09-07 12:12:00,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 12:12:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2019-09-07 12:12:00,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-07 12:12:00,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:12:00,094 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 27, 27, 25, 25, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:12:00,094 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:12:00,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:12:00,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1633634939, now seen corresponding path program 52 times [2019-09-07 12:12:00,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:12:00,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:12:00,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:12:00,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:12:00,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:12:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:12:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7609 backedges. 0 proven. 3492 refuted. 0 times theorem prover too weak. 4117 trivial. 0 not checked. [2019-09-07 12:12:00,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:12:00,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:12:00,566 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 12:12:00,673 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:12:00,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:12:00,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 12:12:00,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:12:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7609 backedges. 2816 proven. 676 refuted. 0 times theorem prover too weak. 4117 trivial. 0 not checked. [2019-09-07 12:12:00,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:12:00,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 12:12:00,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 12:12:00,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 12:12:00,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 12:12:00,731 INFO L87 Difference]: Start difference. First operand 179 states and 183 transitions. Second operand 30 states. [2019-09-07 12:12:00,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:12:00,822 INFO L93 Difference]: Finished difference Result 299 states and 309 transitions. [2019-09-07 12:12:00,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 12:12:00,822 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 292 [2019-09-07 12:12:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:12:00,823 INFO L225 Difference]: With dead ends: 299 [2019-09-07 12:12:00,823 INFO L226 Difference]: Without dead ends: 182 [2019-09-07 12:12:00,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 12:12:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-07 12:12:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-09-07 12:12:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-07 12:12:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2019-09-07 12:12:00,830 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 292 [2019-09-07 12:12:00,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:12:00,830 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2019-09-07 12:12:00,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 12:12:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2019-09-07 12:12:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-07 12:12:00,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:12:00,833 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 27, 27, 25, 25, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:12:00,833 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:12:00,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:12:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1706231129, now seen corresponding path program 53 times [2019-09-07 12:12:00,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:12:00,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:12:00,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:12:00,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:12:00,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:12:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:12:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8092 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 7467 trivial. 0 not checked. [2019-09-07 12:12:01,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:12:01,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:12:01,234 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 12:13:54,253 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 56 check-sat command(s) [2019-09-07 12:13:54,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:13:54,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 12:13:54,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:13:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8092 backedges. 3028 proven. 729 refuted. 0 times theorem prover too weak. 4335 trivial. 0 not checked. [2019-09-07 12:13:54,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:13:54,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 56 [2019-09-07 12:13:54,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 12:13:54,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 12:13:54,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=2268, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 12:13:54,927 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 56 states. [2019-09-07 12:13:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:13:55,148 INFO L93 Difference]: Finished difference Result 306 states and 317 transitions. [2019-09-07 12:13:55,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 12:13:55,149 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 298 [2019-09-07 12:13:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:13:55,150 INFO L225 Difference]: With dead ends: 306 [2019-09-07 12:13:55,150 INFO L226 Difference]: Without dead ends: 187 [2019-09-07 12:13:55,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=812, Invalid=2268, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 12:13:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-07 12:13:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-09-07 12:13:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-07 12:13:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2019-09-07 12:13:55,158 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 298 [2019-09-07 12:13:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:13:55,158 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2019-09-07 12:13:55,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 12:13:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2019-09-07 12:13:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-07 12:13:55,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:13:55,161 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 27, 27, 26, 26, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:13:55,161 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:13:55,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:13:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1531933131, now seen corresponding path program 54 times [2019-09-07 12:13:55,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:13:55,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:13:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:13:55,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:13:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:13:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:13:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8644 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 7915 trivial. 0 not checked. [2019-09-07 12:13:55,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:13:55,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:13:55,748 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 12:14:22,752 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-09-07 12:14:22,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:14:22,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 12:14:22,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:14:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8644 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 7915 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (56)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 12:14:22,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:14:22,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 12:14:22,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 12:14:22,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 12:14:22,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 12:14:22,863 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand 31 states. [2019-09-07 12:14:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:14:22,963 INFO L93 Difference]: Finished difference Result 312 states and 320 transitions. [2019-09-07 12:14:22,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 12:14:22,964 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 306 [2019-09-07 12:14:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:14:22,965 INFO L225 Difference]: With dead ends: 312 [2019-09-07 12:14:22,966 INFO L226 Difference]: Without dead ends: 188 [2019-09-07 12:14:22,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 12:14:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-07 12:14:22,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-09-07 12:14:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-07 12:14:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 191 transitions. [2019-09-07 12:14:22,974 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 191 transitions. Word has length 306 [2019-09-07 12:14:22,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:14:22,974 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 191 transitions. [2019-09-07 12:14:22,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 12:14:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 191 transitions. [2019-09-07 12:14:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-07 12:14:22,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:14:22,976 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 28, 28, 26, 26, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:14:22,977 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:14:22,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:14:22,977 INFO L82 PathProgramCache]: Analyzing trace with hash -335751657, now seen corresponding path program 55 times [2019-09-07 12:14:22,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:14:22,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:14:22,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:14:22,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:14:22,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:14:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:14:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8699 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 8023 trivial. 0 not checked. [2019-09-07 12:14:23,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:14:23,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:14:23,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:14:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:14:23,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 12:14:23,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:14:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 8699 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 7915 trivial. 0 not checked. [2019-09-07 12:14:24,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:14:24,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 58 [2019-09-07 12:14:24,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 12:14:24,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 12:14:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=2436, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 12:14:24,270 INFO L87 Difference]: Start difference. First operand 187 states and 191 transitions. Second operand 58 states. [2019-09-07 12:14:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:14:24,515 INFO L93 Difference]: Finished difference Result 317 states and 326 transitions. [2019-09-07 12:14:24,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 12:14:24,516 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 308 [2019-09-07 12:14:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:14:24,517 INFO L225 Difference]: With dead ends: 317 [2019-09-07 12:14:24,517 INFO L226 Difference]: Without dead ends: 193 [2019-09-07 12:14:24,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=870, Invalid=2436, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 12:14:24,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-07 12:14:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2019-09-07 12:14:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-07 12:14:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2019-09-07 12:14:24,524 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 308 [2019-09-07 12:14:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:14:24,524 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2019-09-07 12:14:24,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 12:14:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2019-09-07 12:14:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-07 12:14:24,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:14:24,527 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 29, 29, 27, 27, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:14:24,527 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:14:24,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:14:24,528 INFO L82 PathProgramCache]: Analyzing trace with hash 929788279, now seen corresponding path program 56 times [2019-09-07 12:14:24,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:14:24,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:14:24,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:14:24,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:14:24,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:14:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:14:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8809 backedges. 0 proven. 4040 refuted. 0 times theorem prover too weak. 4769 trivial. 0 not checked. [2019-09-07 12:14:24,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:14:24,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:14:25,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 12:14:25,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:14:25,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:14:25,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 12:14:25,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:14:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8809 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 7968 trivial. 0 not checked. [2019-09-07 12:14:25,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:14:25,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 61 [2019-09-07 12:14:25,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 12:14:25,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 12:14:25,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 12:14:25,802 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 61 states. [2019-09-07 12:14:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:14:26,030 INFO L93 Difference]: Finished difference Result 323 states and 335 transitions. [2019-09-07 12:14:26,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 12:14:26,034 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 312 [2019-09-07 12:14:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:14:26,035 INFO L225 Difference]: With dead ends: 323 [2019-09-07 12:14:26,035 INFO L226 Difference]: Without dead ends: 197 [2019-09-07 12:14:26,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 12:14:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-07 12:14:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-09-07 12:14:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-07 12:14:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2019-09-07 12:14:26,044 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 312 [2019-09-07 12:14:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:14:26,044 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2019-09-07 12:14:26,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 12:14:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2019-09-07 12:14:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-07 12:14:26,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:14:26,049 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 30, 30, 27, 27, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:14:26,049 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:14:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:14:26,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1478459959, now seen corresponding path program 57 times [2019-09-07 12:14:26,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:14:26,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:14:26,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:14:26,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:14:26,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:14:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:14:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9387 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 8658 trivial. 0 not checked. [2019-09-07 12:14:26,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:14:26,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:14:26,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 12:14:49,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-09-07 12:14:49,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:14:49,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 12:14:49,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:14:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9387 backedges. 3549 proven. 729 refuted. 0 times theorem prover too weak. 5109 trivial. 0 not checked. [2019-09-07 12:14:49,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:14:49,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 33 [2019-09-07 12:14:49,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 12:14:49,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 12:14:49,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 12:14:49,637 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 33 states. [2019-09-07 12:14:50,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:14:50,241 INFO L93 Difference]: Finished difference Result 267 states and 272 transitions. [2019-09-07 12:14:50,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 12:14:50,241 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 320 [2019-09-07 12:14:50,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:14:50,243 INFO L225 Difference]: With dead ends: 267 [2019-09-07 12:14:50,243 INFO L226 Difference]: Without dead ends: 198 [2019-09-07 12:14:50,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1339, Invalid=2321, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 12:14:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-07 12:14:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-09-07 12:14:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-07 12:14:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2019-09-07 12:14:50,250 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 320 [2019-09-07 12:14:50,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:14:50,250 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2019-09-07 12:14:50,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 12:14:50,250 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2019-09-07 12:14:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-07 12:14:50,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:14:50,253 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 30, 30, 28, 28, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:14:50,253 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:14:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:14:50,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1144416587, now seen corresponding path program 58 times [2019-09-07 12:14:50,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:14:50,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:14:50,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:14:50,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:14:50,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:14:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:14:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9442 backedges. 0 proven. 4329 refuted. 0 times theorem prover too weak. 5113 trivial. 0 not checked. [2019-09-07 12:14:50,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:14:50,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 12:14:50,863 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:14:50,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:14:50,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:14:50,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 12:14:50,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:14:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9442 backedges. 3488 proven. 841 refuted. 0 times theorem prover too weak. 5113 trivial. 0 not checked. [2019-09-07 12:14:51,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:14:51,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-09-07 12:14:51,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 12:14:51,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 12:14:51,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 12:14:51,045 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand 33 states. [2019-09-07 12:14:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:14:51,147 INFO L93 Difference]: Finished difference Result 329 states and 339 transitions. [2019-09-07 12:14:51,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 12:14:51,150 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 322 [2019-09-07 12:14:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:14:51,152 INFO L225 Difference]: With dead ends: 329 [2019-09-07 12:14:51,152 INFO L226 Difference]: Without dead ends: 200 [2019-09-07 12:14:51,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 12:14:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-07 12:14:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-09-07 12:14:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-07 12:14:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2019-09-07 12:14:51,158 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 322 [2019-09-07 12:14:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:14:51,158 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2019-09-07 12:14:51,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 12:14:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2019-09-07 12:14:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-07 12:14:51,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:14:51,161 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 30, 30, 28, 28, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:14:51,161 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:14:51,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:14:51,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1637014291, now seen corresponding path program 59 times [2019-09-07 12:14:51,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:14:51,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:14:51,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:14:51,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:14:51,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:14:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:14:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9979 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 9195 trivial. 0 not checked. [2019-09-07 12:14:51,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:14:51,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:14:51,637 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 12:17:29,937 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 62 check-sat command(s) [2019-09-07 12:17:29,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:17:29,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 12:17:29,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:17:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9979 backedges. 3724 proven. 900 refuted. 0 times theorem prover too weak. 5355 trivial. 0 not checked. [2019-09-07 12:17:30,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:17:30,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 62 [2019-09-07 12:17:30,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-07 12:17:30,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-07 12:17:30,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=2790, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 12:17:30,767 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 62 states. [2019-09-07 12:17:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:17:31,031 INFO L93 Difference]: Finished difference Result 336 states and 347 transitions. [2019-09-07 12:17:31,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 12:17:31,032 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 328 [2019-09-07 12:17:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:17:31,033 INFO L225 Difference]: With dead ends: 336 [2019-09-07 12:17:31,034 INFO L226 Difference]: Without dead ends: 205 [2019-09-07 12:17:31,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=992, Invalid=2790, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 12:17:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-07 12:17:31,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2019-09-07 12:17:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-07 12:17:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 207 transitions. [2019-09-07 12:17:31,041 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 207 transitions. Word has length 328 [2019-09-07 12:17:31,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:17:31,042 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 207 transitions. [2019-09-07 12:17:31,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-07 12:17:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2019-09-07 12:17:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-07 12:17:31,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:17:31,044 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 30, 30, 29, 29, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:17:31,045 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:17:31,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:17:31,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1778450159, now seen corresponding path program 60 times [2019-09-07 12:17:31,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:17:31,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:17:31,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:17:31,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:17:31,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:17:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:17:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10591 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 9691 trivial. 0 not checked. [2019-09-07 12:17:31,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:17:31,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:17:31,676 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 12:18:26,121 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-09-07 12:18:26,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:18:26,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 12:18:26,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:18:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10591 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 9691 trivial. 0 not checked. [2019-09-07 12:18:26,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:18:26,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 12:18:26,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 12:18:26,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 12:18:26,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 12:18:26,213 INFO L87 Difference]: Start difference. First operand 203 states and 207 transitions. Second operand 34 states. [2019-09-07 12:18:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:18:26,319 INFO L93 Difference]: Finished difference Result 342 states and 350 transitions. [2019-09-07 12:18:26,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 12:18:26,319 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 336 [2019-09-07 12:18:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:18:26,320 INFO L225 Difference]: With dead ends: 342 [2019-09-07 12:18:26,320 INFO L226 Difference]: Without dead ends: 206 [2019-09-07 12:18:26,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 12:18:26,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-07 12:18:26,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-09-07 12:18:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-07 12:18:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2019-09-07 12:18:26,327 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 336 [2019-09-07 12:18:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:18:26,327 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2019-09-07 12:18:26,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 12:18:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2019-09-07 12:18:26,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-07 12:18:26,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:18:26,330 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 31, 31, 29, 29, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:18:26,330 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:18:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:18:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash -380121263, now seen corresponding path program 61 times [2019-09-07 12:18:26,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:18:26,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:18:26,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:18:26,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:18:26,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:18:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:18:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10652 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 9811 trivial. 0 not checked. [2019-09-07 12:18:26,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:18:26,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:18:26,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:18:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:18:26,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 12:18:26,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:18:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10652 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 9691 trivial. 0 not checked. [2019-09-07 12:18:27,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:18:27,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 64 [2019-09-07 12:18:27,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-07 12:18:27,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-07 12:18:27,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 12:18:27,715 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand 64 states. [2019-09-07 12:18:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:18:28,026 INFO L93 Difference]: Finished difference Result 347 states and 356 transitions. [2019-09-07 12:18:28,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-07 12:18:28,027 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 338 [2019-09-07 12:18:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:18:28,028 INFO L225 Difference]: With dead ends: 347 [2019-09-07 12:18:28,028 INFO L226 Difference]: Without dead ends: 211 [2019-09-07 12:18:28,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 12:18:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-07 12:18:28,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-09-07 12:18:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-07 12:18:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 213 transitions. [2019-09-07 12:18:28,032 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 213 transitions. Word has length 338 [2019-09-07 12:18:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:18:28,032 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 213 transitions. [2019-09-07 12:18:28,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-07 12:18:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 213 transitions. [2019-09-07 12:18:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-07 12:18:28,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:18:28,035 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 32, 32, 30, 30, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:18:28,035 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:18:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:18:28,036 INFO L82 PathProgramCache]: Analyzing trace with hash -14687055, now seen corresponding path program 62 times [2019-09-07 12:18:28,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:18:28,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:18:28,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:18:28,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 12:18:28,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:18:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:18:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10774 backedges. 0 proven. 4937 refuted. 0 times theorem prover too weak. 5837 trivial. 0 not checked. [2019-09-07 12:18:28,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:18:28,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:18:28,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 12:18:28,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 12:18:28,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:18:28,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 12:18:28,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:18:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10774 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 9750 trivial. 0 not checked. [2019-09-07 12:18:29,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:18:29,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 67 [2019-09-07 12:18:29,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 12:18:29,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 12:18:29,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 12:18:29,559 INFO L87 Difference]: Start difference. First operand 209 states and 213 transitions. Second operand 67 states. [2019-09-07 12:18:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:18:29,828 INFO L93 Difference]: Finished difference Result 353 states and 365 transitions. [2019-09-07 12:18:29,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 12:18:29,829 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 342 [2019-09-07 12:18:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:18:29,829 INFO L225 Difference]: With dead ends: 353 [2019-09-07 12:18:29,830 INFO L226 Difference]: Without dead ends: 215 [2019-09-07 12:18:29,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 12:18:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-07 12:18:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-09-07 12:18:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-07 12:18:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2019-09-07 12:18:29,836 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 342 [2019-09-07 12:18:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:18:29,837 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2019-09-07 12:18:29,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 12:18:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2019-09-07 12:18:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-07 12:18:29,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:18:29,839 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 33, 33, 30, 30, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:18:29,839 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:18:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:18:29,840 INFO L82 PathProgramCache]: Analyzing trace with hash 201885553, now seen corresponding path program 63 times [2019-09-07 12:18:29,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:18:29,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:18:29,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:18:29,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:18:29,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:18:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:18:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 11412 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2019-09-07 12:18:30,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:18:30,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:18:30,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 12:19:06,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-07 12:19:06,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:19:06,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 12:19:06,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:19:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11412 backedges. 4299 proven. 900 refuted. 0 times theorem prover too weak. 6213 trivial. 0 not checked. [2019-09-07 12:19:06,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:19:06,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 36 [2019-09-07 12:19:06,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 12:19:06,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 12:19:06,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 12:19:06,780 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 36 states. [2019-09-07 12:19:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:19:07,488 INFO L93 Difference]: Finished difference Result 291 states and 296 transitions. [2019-09-07 12:19:07,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 12:19:07,488 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 350 [2019-09-07 12:19:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:19:07,489 INFO L225 Difference]: With dead ends: 291 [2019-09-07 12:19:07,489 INFO L226 Difference]: Without dead ends: 216 [2019-09-07 12:19:07,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1621, Invalid=2801, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 12:19:07,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-07 12:19:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-09-07 12:19:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-07 12:19:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 219 transitions. [2019-09-07 12:19:07,496 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 219 transitions. Word has length 350 [2019-09-07 12:19:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:19:07,497 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 219 transitions. [2019-09-07 12:19:07,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 12:19:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2019-09-07 12:19:07,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-09-07 12:19:07,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:19:07,499 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 33, 33, 31, 31, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:19:07,499 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:19:07,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:19:07,500 INFO L82 PathProgramCache]: Analyzing trace with hash 39898479, now seen corresponding path program 64 times [2019-09-07 12:19:07,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:19:07,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:19:07,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:19:07,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:19:07,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:19:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:19:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 11473 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 6217 trivial. 0 not checked. [2019-09-07 12:19:08,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:19:08,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:19:08,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 12:19:08,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 12:19:08,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 12:19:08,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 12:19:08,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 12:19:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 11473 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 10384 trivial. 0 not checked. [2019-09-07 12:19:09,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 12:19:09,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 69 [2019-09-07 12:19:09,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-07 12:19:09,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-07 12:19:09,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 12:19:09,106 INFO L87 Difference]: Start difference. First operand 215 states and 219 transitions. Second operand 69 states. [2019-09-07 12:19:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 12:19:09,359 INFO L93 Difference]: Finished difference Result 363 states and 375 transitions. [2019-09-07 12:19:09,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 12:19:09,360 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 352 [2019-09-07 12:19:09,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 12:19:09,362 INFO L225 Difference]: With dead ends: 363 [2019-09-07 12:19:09,362 INFO L226 Difference]: Without dead ends: 221 [2019-09-07 12:19:09,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 12:19:09,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-07 12:19:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2019-09-07 12:19:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-07 12:19:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 223 transitions. [2019-09-07 12:19:09,369 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 223 transitions. Word has length 352 [2019-09-07 12:19:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 12:19:09,370 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 223 transitions. [2019-09-07 12:19:09,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-07 12:19:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2019-09-07 12:19:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-07 12:19:09,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 12:19:09,372 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 34, 34, 31, 31, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 12:19:09,372 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 12:19:09,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 12:19:09,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1742277073, now seen corresponding path program 65 times [2019-09-07 12:19:09,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 12:19:09,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 12:19:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:19:09,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 12:19:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 12:19:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 12:19:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12131 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 11170 trivial. 0 not checked. [2019-09-07 12:19:09,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 12:19:09,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 12:19:09,924 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1