java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copyInitSum2_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:57:11,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:57:11,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:57:11,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:57:11,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:57:11,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:57:11,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:57:11,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:57:11,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:57:11,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:57:11,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:57:11,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:57:11,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:57:11,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:57:11,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:57:11,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:57:11,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:57:11,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:57:11,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:57:11,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:57:11,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:57:11,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:57:11,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:57:11,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:57:11,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:57:11,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:57:11,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:57:11,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:57:11,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:57:11,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:57:11,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:57:11,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:57:11,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:57:11,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:57:11,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:57:11,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:57:11,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:57:11,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:57:11,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:57:11,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:57:11,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:57:11,983 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 22:57:11,997 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:57:11,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:57:11,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:57:11,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:57:11,999 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:57:11,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:57:11,999 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:57:12,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:57:12,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:57:12,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:57:12,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:57:12,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:57:12,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:57:12,001 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:57:12,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:57:12,001 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:57:12,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:57:12,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:57:12,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:57:12,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:57:12,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:57:12,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:57:12,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:57:12,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:57:12,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:57:12,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:57:12,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:57:12,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:57:12,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:57:12,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:57:12,057 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:57:12,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:57:12,063 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:57:12,063 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:57:12,064 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInitSum2_ground-2.i [2019-10-01 22:57:12,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7ca5eb1/99403d4a56774231a48f24ea54499dd7/FLAGd0a2a2ce6 [2019-10-01 22:57:12,592 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:57:12,592 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInitSum2_ground-2.i [2019-10-01 22:57:12,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7ca5eb1/99403d4a56774231a48f24ea54499dd7/FLAGd0a2a2ce6 [2019-10-01 22:57:13,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7ca5eb1/99403d4a56774231a48f24ea54499dd7 [2019-10-01 22:57:13,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:57:13,025 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:57:13,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:57:13,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:57:13,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:57:13,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:57:13" (1/1) ... [2019-10-01 22:57:13,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e788b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:13, skipping insertion in model container [2019-10-01 22:57:13,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:57:13" (1/1) ... [2019-10-01 22:57:13,045 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:57:13,067 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:57:13,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:57:13,298 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:57:13,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:57:13,436 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:57:13,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:13 WrapperNode [2019-10-01 22:57:13,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:57:13,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:57:13,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:57:13,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:57:13,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:13" (1/1) ... [2019-10-01 22:57:13,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:13" (1/1) ... [2019-10-01 22:57:13,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:13" (1/1) ... [2019-10-01 22:57:13,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:13" (1/1) ... [2019-10-01 22:57:13,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:13" (1/1) ... [2019-10-01 22:57:13,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:13" (1/1) ... [2019-10-01 22:57:13,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:13" (1/1) ... [2019-10-01 22:57:13,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:57:13,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:57:13,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:57:13,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:57:13,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:57:13,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:57:13,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:57:13,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:57:13,545 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:57:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:57:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:57:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:57:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:57:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:57:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:57:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:57:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:57:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:57:13,845 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:57:13,846 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-01 22:57:13,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:57:13 BoogieIcfgContainer [2019-10-01 22:57:13,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:57:13,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:57:13,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:57:13,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:57:13,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:57:13" (1/3) ... [2019-10-01 22:57:13,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a137f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:57:13, skipping insertion in model container [2019-10-01 22:57:13,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:57:13" (2/3) ... [2019-10-01 22:57:13,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a137f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:57:13, skipping insertion in model container [2019-10-01 22:57:13,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:57:13" (3/3) ... [2019-10-01 22:57:13,878 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum2_ground-2.i [2019-10-01 22:57:13,904 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:57:13,922 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:57:13,947 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:57:13,974 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:57:13,975 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:57:13,975 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:57:13,975 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:57:13,975 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:57:13,975 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:57:13,976 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:57:13,976 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:57:13,976 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:57:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-01 22:57:13,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 22:57:13,997 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:13,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:14,000 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:14,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:14,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1001985310, now seen corresponding path program 1 times [2019-10-01 22:57:14,007 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:14,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:14,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:14,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:14,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:14,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:57:14,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:57:14,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:57:14,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:57:14,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:57:14,164 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-10-01 22:57:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:14,186 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2019-10-01 22:57:14,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:57:14,187 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-10-01 22:57:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:14,194 INFO L225 Difference]: With dead ends: 51 [2019-10-01 22:57:14,194 INFO L226 Difference]: Without dead ends: 24 [2019-10-01 22:57:14,197 INFO L640 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-10-01 22:57:14,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-01 22:57:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-01 22:57:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 22:57:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-01 22:57:14,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2019-10-01 22:57:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:14,231 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-01 22:57:14,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:57:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-10-01 22:57:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-01 22:57:14,233 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:14,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:14,233 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:14,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:14,234 INFO L82 PathProgramCache]: Analyzing trace with hash -400143846, now seen corresponding path program 1 times [2019-10-01 22:57:14,234 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:14,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:14,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:57:14,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:57:14,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:57:14,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:57:14,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:57:14,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:57:14,294 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2019-10-01 22:57:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:14,360 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 22:57:14,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:57:14,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-01 22:57:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:14,362 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:57:14,362 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 22:57:14,363 INFO L640 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-10-01 22:57:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 22:57:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-10-01 22:57:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:57:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-01 22:57:14,371 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2019-10-01 22:57:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:14,371 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-01 22:57:14,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:57:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-01 22:57:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-01 22:57:14,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:14,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:14,373 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:14,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:14,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1150570790, now seen corresponding path program 1 times [2019-10-01 22:57:14,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:14,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:14,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:14,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:14,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:57:14,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:14,493 INFO L224 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-10-01 22:57:14,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:14,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:57:14,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-01 22:57:14,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:14,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:57:14,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:57:14,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:57:14,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:57:14,628 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 5 states. [2019-10-01 22:57:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:14,720 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-10-01 22:57:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:57:14,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-01 22:57:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:14,723 INFO L225 Difference]: With dead ends: 53 [2019-10-01 22:57:14,723 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 22:57:14,723 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-10-01 22:57:14,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 22:57:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-01 22:57:14,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 22:57:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-10-01 22:57:14,736 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2019-10-01 22:57:14,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:14,737 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-10-01 22:57:14,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:57:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-10-01 22:57:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 22:57:14,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:14,738 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:14,739 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:14,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:14,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1868122094, now seen corresponding path program 2 times [2019-10-01 22:57:14,741 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:14,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:14,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:14,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:14,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 22:57:14,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:14,841 INFO L224 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-10-01 22:57:14,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:14,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:14,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:14,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:57:14,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:57:14,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:14,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:57:14,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:57:14,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:57:14,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:57:14,959 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 6 states. [2019-10-01 22:57:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:15,071 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 22:57:15,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:57:15,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-01 22:57:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:15,073 INFO L225 Difference]: With dead ends: 62 [2019-10-01 22:57:15,073 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 22:57:15,074 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-10-01 22:57:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 22:57:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 22:57:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 22:57:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-10-01 22:57:15,083 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 27 [2019-10-01 22:57:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:15,084 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-10-01 22:57:15,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:57:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-10-01 22:57:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:57:15,087 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:15,087 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:15,088 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:15,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:15,089 INFO L82 PathProgramCache]: Analyzing trace with hash 150752210, now seen corresponding path program 3 times [2019-10-01 22:57:15,089 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:15,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:15,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:15,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:15,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 22:57:15,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:15,221 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:15,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:57:15,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:57:15,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:15,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:57:15,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:57:15,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:15,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 22:57:15,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:57:15,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:57:15,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:57:15,315 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 7 states. [2019-10-01 22:57:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:15,399 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2019-10-01 22:57:15,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 22:57:15,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-10-01 22:57:15,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:15,401 INFO L225 Difference]: With dead ends: 71 [2019-10-01 22:57:15,401 INFO L226 Difference]: Without dead ends: 44 [2019-10-01 22:57:15,402 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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-10-01 22:57:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-01 22:57:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-10-01 22:57:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-01 22:57:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-10-01 22:57:15,409 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 32 [2019-10-01 22:57:15,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:15,409 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-10-01 22:57:15,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:57:15,409 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-10-01 22:57:15,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-01 22:57:15,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:15,411 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:15,411 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:15,411 INFO L82 PathProgramCache]: Analyzing trace with hash -125121014, now seen corresponding path program 4 times [2019-10-01 22:57:15,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:15,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:15,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:15,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:15,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-01 22:57:15,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:15,491 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:15,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:15,540 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:15,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:15,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:57:15,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:15,557 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-01 22:57:15,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:15,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:57:15,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:57:15,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:57:15,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:57:15,564 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 8 states. [2019-10-01 22:57:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:15,658 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2019-10-01 22:57:15,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:57:15,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-10-01 22:57:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:15,660 INFO L225 Difference]: With dead ends: 80 [2019-10-01 22:57:15,661 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 22:57:15,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 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-10-01 22:57:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 22:57:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 22:57:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 22:57:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-10-01 22:57:15,668 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 37 [2019-10-01 22:57:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:15,668 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-10-01 22:57:15,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:57:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-10-01 22:57:15,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 22:57:15,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:15,670 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:15,670 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:15,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1558523702, now seen corresponding path program 5 times [2019-10-01 22:57:15,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:15,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:15,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:15,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:15,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-01 22:57:15,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:15,762 INFO L224 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) [2019-10-01 22:57:15,787 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:16,165 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:57:16,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:16,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:57:16,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-01 22:57:16,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:16,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 22:57:16,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:57:16,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:57:16,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:57:16,200 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 9 states. [2019-10-01 22:57:16,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:16,307 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-10-01 22:57:16,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:57:16,307 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-10-01 22:57:16,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:16,308 INFO L225 Difference]: With dead ends: 89 [2019-10-01 22:57:16,308 INFO L226 Difference]: Without dead ends: 54 [2019-10-01 22:57:16,309 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 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-10-01 22:57:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-01 22:57:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-10-01 22:57:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-01 22:57:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-10-01 22:57:16,316 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 42 [2019-10-01 22:57:16,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:16,317 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-10-01 22:57:16,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:57:16,317 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-10-01 22:57:16,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 22:57:16,318 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:16,318 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:16,319 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:16,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:16,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1349350398, now seen corresponding path program 6 times [2019-10-01 22:57:16,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:16,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:16,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:16,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:16,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-01 22:57:16,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:16,451 INFO L224 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) [2019-10-01 22:57:16,486 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:16,818 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:57:16,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:16,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:57:16,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:16,852 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 22:57:16,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:16,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 22:57:16,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 22:57:16,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 22:57:16,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 22:57:16,859 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2019-10-01 22:57:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:16,973 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2019-10-01 22:57:16,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:57:16,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-10-01 22:57:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:16,976 INFO L225 Difference]: With dead ends: 98 [2019-10-01 22:57:16,976 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 22:57:16,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 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-10-01 22:57:16,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 22:57:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-10-01 22:57:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-01 22:57:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2019-10-01 22:57:16,991 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 47 [2019-10-01 22:57:16,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:16,991 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2019-10-01 22:57:16,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 22:57:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2019-10-01 22:57:16,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-01 22:57:16,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:16,997 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:16,997 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:16,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:16,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1128841790, now seen corresponding path program 7 times [2019-10-01 22:57:16,998 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:16,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:17,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:17,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:17,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-01 22:57:17,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:17,157 INFO L224 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-10-01 22:57:17,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:17,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:57:17,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-01 22:57:17,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:17,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:57:17,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:57:17,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:57:17,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:57:17,249 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 11 states. [2019-10-01 22:57:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:17,382 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-10-01 22:57:17,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:57:17,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-10-01 22:57:17,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:17,383 INFO L225 Difference]: With dead ends: 107 [2019-10-01 22:57:17,383 INFO L226 Difference]: Without dead ends: 64 [2019-10-01 22:57:17,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 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-10-01 22:57:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-01 22:57:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-10-01 22:57:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-01 22:57:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-10-01 22:57:17,391 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 52 [2019-10-01 22:57:17,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:17,392 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-10-01 22:57:17,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:57:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-10-01 22:57:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-01 22:57:17,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:17,393 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:17,393 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:17,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:17,394 INFO L82 PathProgramCache]: Analyzing trace with hash -612503046, now seen corresponding path program 8 times [2019-10-01 22:57:17,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:17,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:17,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:17,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-01 22:57:17,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:17,543 INFO L224 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-10-01 22:57:17,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:57:17,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:17,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:17,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:57:17,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-01 22:57:17,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:17,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:57:17,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:57:17,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:57:17,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:57:17,640 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 12 states. [2019-10-01 22:57:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:17,750 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-10-01 22:57:17,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:57:17,750 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-10-01 22:57:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:17,751 INFO L225 Difference]: With dead ends: 116 [2019-10-01 22:57:17,751 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 22:57:17,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:57:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 22:57:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 22:57:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 22:57:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-10-01 22:57:17,759 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 57 [2019-10-01 22:57:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:17,760 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-10-01 22:57:17,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:57:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-10-01 22:57:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-01 22:57:17,761 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:17,761 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:17,761 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:17,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:17,762 INFO L82 PathProgramCache]: Analyzing trace with hash -490630470, now seen corresponding path program 9 times [2019-10-01 22:57:17,762 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:17,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:17,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:17,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:17,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-01 22:57:17,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:17,927 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:17,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:57:18,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:57:18,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:18,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:57:18,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:18,229 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-01 22:57:18,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:18,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 22:57:18,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:57:18,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:57:18,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:57:18,245 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 13 states. [2019-10-01 22:57:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:18,387 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2019-10-01 22:57:18,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 22:57:18,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-10-01 22:57:18,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:18,388 INFO L225 Difference]: With dead ends: 125 [2019-10-01 22:57:18,388 INFO L226 Difference]: Without dead ends: 74 [2019-10-01 22:57:18,389 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:57:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-01 22:57:18,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-10-01 22:57:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-01 22:57:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-10-01 22:57:18,396 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 62 [2019-10-01 22:57:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:18,396 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-10-01 22:57:18,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:57:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-10-01 22:57:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 22:57:18,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:18,398 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:18,398 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:18,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:18,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1207107598, now seen corresponding path program 10 times [2019-10-01 22:57:18,399 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:18,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:18,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:18,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:18,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:18,547 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-01 22:57:18,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:18,548 INFO L224 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-10-01 22:57:18,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:18,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:18,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:18,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:57:18,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-10-01 22:57:18,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:18,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 22:57:18,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 22:57:18,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 22:57:18,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:57:18,728 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 14 states. [2019-10-01 22:57:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:18,881 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2019-10-01 22:57:18,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:57:18,883 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-10-01 22:57:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:18,884 INFO L225 Difference]: With dead ends: 134 [2019-10-01 22:57:18,884 INFO L226 Difference]: Without dead ends: 79 [2019-10-01 22:57:18,885 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 22:57:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-01 22:57:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-10-01 22:57:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 22:57:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2019-10-01 22:57:18,896 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 67 [2019-10-01 22:57:18,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:18,896 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2019-10-01 22:57:18,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 22:57:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2019-10-01 22:57:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 22:57:18,903 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:18,903 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:18,906 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:18,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:18,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2083114930, now seen corresponding path program 11 times [2019-10-01 22:57:18,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:18,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:18,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:18,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:18,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-10-01 22:57:19,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:19,086 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:19,116 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:57:38,505 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-01 22:57:38,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:38,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:57:38,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:38,553 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-01 22:57:38,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:38,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 22:57:38,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:57:38,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:57:38,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:57:38,570 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 15 states. [2019-10-01 22:57:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:38,690 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2019-10-01 22:57:38,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:57:38,690 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 22:57:38,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:38,691 INFO L225 Difference]: With dead ends: 143 [2019-10-01 22:57:38,691 INFO L226 Difference]: Without dead ends: 84 [2019-10-01 22:57:38,692 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 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-10-01 22:57:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-01 22:57:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-10-01 22:57:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-01 22:57:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2019-10-01 22:57:38,698 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 72 [2019-10-01 22:57:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:38,698 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2019-10-01 22:57:38,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:57:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2019-10-01 22:57:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-01 22:57:38,700 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:38,700 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:38,700 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:38,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:38,701 INFO L82 PathProgramCache]: Analyzing trace with hash 385857002, now seen corresponding path program 12 times [2019-10-01 22:57:38,701 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:38,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:38,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:38,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:38,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 22:57:38,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:38,885 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:57:38,913 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:53,198 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 22:57:53,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:53,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:57:53,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-10-01 22:57:53,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:53,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 22:57:53,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:57:53,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:57:53,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:57:53,255 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 16 states. [2019-10-01 22:57:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:53,400 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-10-01 22:57:53,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:57:53,400 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2019-10-01 22:57:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:53,401 INFO L225 Difference]: With dead ends: 152 [2019-10-01 22:57:53,401 INFO L226 Difference]: Without dead ends: 89 [2019-10-01 22:57:53,402 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 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-10-01 22:57:53,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-01 22:57:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-10-01 22:57:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 22:57:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2019-10-01 22:57:53,408 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 77 [2019-10-01 22:57:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:53,408 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2019-10-01 22:57:53,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:57:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2019-10-01 22:57:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-01 22:57:53,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:53,410 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:53,410 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1239413930, now seen corresponding path program 13 times [2019-10-01 22:57:53,411 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:53,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:53,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-10-01 22:57:53,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:53,571 INFO L224 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-10-01 22:57:53,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:53,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:57:53,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-10-01 22:57:53,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:53,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:57:53,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:57:53,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:57:53,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:57:53,660 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 17 states. [2019-10-01 22:57:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:53,826 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2019-10-01 22:57:53,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:57:53,827 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2019-10-01 22:57:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:53,828 INFO L225 Difference]: With dead ends: 161 [2019-10-01 22:57:53,828 INFO L226 Difference]: Without dead ends: 94 [2019-10-01 22:57:53,829 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:57:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-01 22:57:53,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2019-10-01 22:57:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-01 22:57:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2019-10-01 22:57:53,836 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 82 [2019-10-01 22:57:53,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:53,836 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2019-10-01 22:57:53,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:57:53,836 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2019-10-01 22:57:53,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-01 22:57:53,837 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:53,838 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:53,838 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:53,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:53,839 INFO L82 PathProgramCache]: Analyzing trace with hash -535424030, now seen corresponding path program 14 times [2019-10-01 22:57:53,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:53,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:53,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:53,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:57:53,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:57:54,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:54,079 INFO L224 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-10-01 22:57:54,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:57:54,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:57:54,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:54,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:57:54,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:57:54,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:54,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:57:54,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:57:54,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:57:54,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:57:54,180 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 18 states. [2019-10-01 22:57:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:54,363 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2019-10-01 22:57:54,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:57:54,364 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-10-01 22:57:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:54,365 INFO L225 Difference]: With dead ends: 170 [2019-10-01 22:57:54,365 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 22:57:54,366 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 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-10-01 22:57:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 22:57:54,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-10-01 22:57:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-01 22:57:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2019-10-01 22:57:54,372 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 87 [2019-10-01 22:57:54,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:54,372 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2019-10-01 22:57:54,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:57:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2019-10-01 22:57:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 22:57:54,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:54,374 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:54,374 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:54,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:54,375 INFO L82 PathProgramCache]: Analyzing trace with hash -422313566, now seen corresponding path program 15 times [2019-10-01 22:57:54,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:54,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:54,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:54,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:54,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:54,574 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-10-01 22:57:54,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:54,575 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:54,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:57:57,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:57:57,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:57,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:57:57,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-10-01 22:57:57,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:57,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:57:57,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:57:57,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:57:57,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:57:57,062 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 19 states. [2019-10-01 22:57:57,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:57,249 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2019-10-01 22:57:57,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:57:57,250 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 22:57:57,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:57,251 INFO L225 Difference]: With dead ends: 179 [2019-10-01 22:57:57,251 INFO L226 Difference]: Without dead ends: 104 [2019-10-01 22:57:57,252 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 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-10-01 22:57:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-01 22:57:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2019-10-01 22:57:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-01 22:57:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2019-10-01 22:57:57,257 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 92 [2019-10-01 22:57:57,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:57,257 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2019-10-01 22:57:57,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:57:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2019-10-01 22:57:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-01 22:57:57,258 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:57,259 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:57,259 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:57,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1861215782, now seen corresponding path program 16 times [2019-10-01 22:57:57,259 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:57,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:57,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:57,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:57,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-10-01 22:57:57,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:57,477 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:57:57,498 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:57:57,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:57:57,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:57,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:57:57,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:57:57,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:57,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:57:57,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:57:57,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:57:57,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:57:57,601 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 20 states. [2019-10-01 22:57:57,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:57:57,762 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2019-10-01 22:57:57,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:57:57,763 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-10-01 22:57:57,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:57:57,764 INFO L225 Difference]: With dead ends: 188 [2019-10-01 22:57:57,764 INFO L226 Difference]: Without dead ends: 109 [2019-10-01 22:57:57,765 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 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-10-01 22:57:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-01 22:57:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-10-01 22:57:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 22:57:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2019-10-01 22:57:57,771 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 97 [2019-10-01 22:57:57,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:57:57,771 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2019-10-01 22:57:57,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:57:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2019-10-01 22:57:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-01 22:57:57,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:57:57,772 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:57:57,773 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:57:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:57:57,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1207301786, now seen corresponding path program 17 times [2019-10-01 22:57:57,773 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:57:57,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:57:57,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:57,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:57:57,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:57:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:57:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-10-01 22:57:58,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:57:58,005 INFO L224 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-10-01 22:57:58,048 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:59:17,836 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-10-01 22:59:17,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:59:17,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:59:17,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:59:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-10-01 22:59:17,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:59:17,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 22:59:17,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 22:59:17,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 22:59:17,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:59:17,949 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 21 states. [2019-10-01 22:59:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:59:18,142 INFO L93 Difference]: Finished difference Result 197 states and 205 transitions. [2019-10-01 22:59:18,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:59:18,142 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2019-10-01 22:59:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:59:18,143 INFO L225 Difference]: With dead ends: 197 [2019-10-01 22:59:18,143 INFO L226 Difference]: Without dead ends: 114 [2019-10-01 22:59:18,144 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 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-10-01 22:59:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-01 22:59:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-10-01 22:59:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-01 22:59:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2019-10-01 22:59:18,148 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 102 [2019-10-01 22:59:18,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:59:18,148 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2019-10-01 22:59:18,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 22:59:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2019-10-01 22:59:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-01 22:59:18,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:59:18,149 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:59:18,150 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:59:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:59:18,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1112684590, now seen corresponding path program 18 times [2019-10-01 22:59:18,150 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:59:18,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:59:18,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:18,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:59:18,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:59:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:59:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2019-10-01 22:59:18,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:59:18,433 INFO L224 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-10-01 22:59:18,461 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:00:36,786 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 23:00:36,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:00:36,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:00:36,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 18 proven. 324 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2019-10-01 23:00:36,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:36,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 23 [2019-10-01 23:00:36,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:00:36,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:00:36,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:00:36,912 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand 23 states. [2019-10-01 23:00:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:37,132 INFO L93 Difference]: Finished difference Result 214 states and 225 transitions. [2019-10-01 23:00:37,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:00:37,133 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 107 [2019-10-01 23:00:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:37,135 INFO L225 Difference]: With dead ends: 214 [2019-10-01 23:00:37,135 INFO L226 Difference]: Without dead ends: 127 [2019-10-01 23:00:37,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 106 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-10-01 23:00:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-01 23:00:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2019-10-01 23:00:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-01 23:00:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 120 transitions. [2019-10-01 23:00:37,149 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 120 transitions. Word has length 107 [2019-10-01 23:00:37,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:37,149 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 120 transitions. [2019-10-01 23:00:37,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:00:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 120 transitions. [2019-10-01 23:00:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-01 23:00:37,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:37,150 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:37,150 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:37,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:37,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1010160530, now seen corresponding path program 19 times [2019-10-01 23:00:37,150 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:37,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:37,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:37,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:00:37,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2019-10-01 23:00:37,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:37,433 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:00:37,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:00:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:37,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:00:37,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2019-10-01 23:00:37,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:37,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:00:37,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:00:37,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:00:37,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:00:37,550 INFO L87 Difference]: Start difference. First operand 117 states and 120 transitions. Second operand 23 states. [2019-10-01 23:00:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:37,753 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2019-10-01 23:00:37,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:00:37,757 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 112 [2019-10-01 23:00:37,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:37,758 INFO L225 Difference]: With dead ends: 215 [2019-10-01 23:00:37,758 INFO L226 Difference]: Without dead ends: 124 [2019-10-01 23:00:37,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 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-10-01 23:00:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-01 23:00:37,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-10-01 23:00:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-01 23:00:37,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2019-10-01 23:00:37,765 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 112 [2019-10-01 23:00:37,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:37,765 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2019-10-01 23:00:37,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:00:37,766 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2019-10-01 23:00:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-01 23:00:37,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:37,767 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:37,767 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:37,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:37,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1884348982, now seen corresponding path program 20 times [2019-10-01 23:00:37,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:37,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:37,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:37,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:00:37,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-01 23:00:38,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:38,036 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:00:38,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:00:38,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:00:38,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:00:38,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:00:38,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:00:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-01 23:00:38,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:00:38,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:00:38,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:00:38,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:00:38,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:00:38,148 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand 24 states. [2019-10-01 23:00:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:00:38,397 INFO L93 Difference]: Finished difference Result 224 states and 232 transitions. [2019-10-01 23:00:38,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:00:38,404 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 117 [2019-10-01 23:00:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:00:38,406 INFO L225 Difference]: With dead ends: 224 [2019-10-01 23:00:38,406 INFO L226 Difference]: Without dead ends: 129 [2019-10-01 23:00:38,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:00:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-01 23:00:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2019-10-01 23:00:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 23:00:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2019-10-01 23:00:38,412 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 117 [2019-10-01 23:00:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:00:38,413 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2019-10-01 23:00:38,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:00:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2019-10-01 23:00:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 23:00:38,414 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:00:38,414 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:00:38,415 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:00:38,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:00:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash -326920054, now seen corresponding path program 21 times [2019-10-01 23:00:38,415 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:00:38,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:00:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:38,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:00:38,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:00:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:00:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2019-10-01 23:00:38,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:00:38,733 INFO L224 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-10-01 23:00:38,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:01:06,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:01:06,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:06,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:01:06,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2019-10-01 23:01:06,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:06,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:01:06,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:01:06,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:01:06,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:01:06,192 INFO L87 Difference]: Start difference. First operand 127 states and 130 transitions. Second operand 25 states. [2019-10-01 23:01:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:06,386 INFO L93 Difference]: Finished difference Result 233 states and 241 transitions. [2019-10-01 23:01:06,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:01:06,387 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 122 [2019-10-01 23:01:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:06,388 INFO L225 Difference]: With dead ends: 233 [2019-10-01 23:01:06,388 INFO L226 Difference]: Without dead ends: 134 [2019-10-01 23:01:06,389 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 122 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-10-01 23:01:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-01 23:01:06,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2019-10-01 23:01:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-01 23:01:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2019-10-01 23:01:06,394 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 122 [2019-10-01 23:01:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:06,394 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2019-10-01 23:01:06,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:01:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2019-10-01 23:01:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-01 23:01:06,395 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:06,395 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:06,396 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:06,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1188305858, now seen corresponding path program 22 times [2019-10-01 23:01:06,396 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:06,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:06,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:06,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:06,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 23:01:06,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:06,823 INFO L224 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-10-01 23:01:06,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:01:06,935 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:01:06,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:01:06,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:01:06,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:01:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-10-01 23:01:06,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:01:06,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:01:06,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:01:06,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:01:06,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:01:06,996 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 26 states. [2019-10-01 23:01:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:01:07,183 INFO L93 Difference]: Finished difference Result 242 states and 250 transitions. [2019-10-01 23:01:07,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:01:07,183 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 127 [2019-10-01 23:01:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:01:07,184 INFO L225 Difference]: With dead ends: 242 [2019-10-01 23:01:07,184 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 23:01:07,185 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 127 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-10-01 23:01:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 23:01:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-10-01 23:01:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-01 23:01:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2019-10-01 23:01:07,191 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 127 [2019-10-01 23:01:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:01:07,191 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2019-10-01 23:01:07,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:01:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2019-10-01 23:01:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 23:01:07,192 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:01:07,193 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:01:07,193 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:01:07,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:01:07,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1540310402, now seen corresponding path program 23 times [2019-10-01 23:01:07,194 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:01:07,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:01:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:07,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:01:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:01:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:01:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2019-10-01 23:01:07,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:01:07,717 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:01:07,751 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:03:11,734 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-10-01 23:03:11,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:03:11,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:03:11,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:03:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2019-10-01 23:03:11,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:03:11,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:03:11,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:03:11,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:03:11,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:03:11,875 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand 27 states. [2019-10-01 23:03:12,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:03:12,159 INFO L93 Difference]: Finished difference Result 251 states and 259 transitions. [2019-10-01 23:03:12,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:03:12,160 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 132 [2019-10-01 23:03:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:03:12,161 INFO L225 Difference]: With dead ends: 251 [2019-10-01 23:03:12,161 INFO L226 Difference]: Without dead ends: 144 [2019-10-01 23:03:12,162 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:03:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-01 23:03:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-10-01 23:03:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-01 23:03:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2019-10-01 23:03:12,167 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 132 [2019-10-01 23:03:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:03:12,167 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2019-10-01 23:03:12,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:03:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2019-10-01 23:03:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-01 23:03:12,169 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:03:12,169 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:03:12,169 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:03:12,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:03:12,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1193492038, now seen corresponding path program 24 times [2019-10-01 23:03:12,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:03:12,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:03:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:12,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:03:12,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:03:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:03:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2019-10-01 23:03:12,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:03:12,738 INFO L224 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-10-01 23:03:12,802 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:05:56,351 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 23:05:56,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:05:56,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 23:05:56,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:05:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2019-10-01 23:05:56,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:05:56,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:05:56,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:05:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:05:56,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:05:56,489 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand 28 states. [2019-10-01 23:05:56,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:05:56,799 INFO L93 Difference]: Finished difference Result 260 states and 268 transitions. [2019-10-01 23:05:56,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:05:56,804 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 137 [2019-10-01 23:05:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:05:56,805 INFO L225 Difference]: With dead ends: 260 [2019-10-01 23:05:56,805 INFO L226 Difference]: Without dead ends: 149 [2019-10-01 23:05:56,807 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:05:56,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-01 23:05:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2019-10-01 23:05:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 23:05:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2019-10-01 23:05:56,815 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 150 transitions. Word has length 137 [2019-10-01 23:05:56,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:05:56,815 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 150 transitions. [2019-10-01 23:05:56,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:05:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2019-10-01 23:05:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-01 23:05:56,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:05:56,817 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:05:56,818 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:05:56,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:05:56,818 INFO L82 PathProgramCache]: Analyzing trace with hash -418850182, now seen corresponding path program 25 times [2019-10-01 23:05:56,818 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:05:56,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:05:56,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:56,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:05:56,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:05:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2019-10-01 23:05:57,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:05:57,424 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:05:57,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:05:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:05:57,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:05:57,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:05:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2019-10-01 23:05:57,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:05:57,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:05:57,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:05:57,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:05:57,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:05:57,612 INFO L87 Difference]: Start difference. First operand 147 states and 150 transitions. Second operand 29 states. [2019-10-01 23:05:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:05:57,925 INFO L93 Difference]: Finished difference Result 269 states and 277 transitions. [2019-10-01 23:05:57,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:05:57,925 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 142 [2019-10-01 23:05:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:05:57,926 INFO L225 Difference]: With dead ends: 269 [2019-10-01 23:05:57,927 INFO L226 Difference]: Without dead ends: 154 [2019-10-01 23:05:57,928 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:05:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-01 23:05:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-10-01 23:05:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-01 23:05:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2019-10-01 23:05:57,933 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 142 [2019-10-01 23:05:57,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:05:57,934 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2019-10-01 23:05:57,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:05:57,934 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2019-10-01 23:05:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-01 23:05:57,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:05:57,937 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:05:57,937 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:05:57,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:05:57,938 INFO L82 PathProgramCache]: Analyzing trace with hash -779546702, now seen corresponding path program 26 times [2019-10-01 23:05:57,938 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:05:57,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:05:57,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:57,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:05:57,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:05:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2019-10-01 23:05:58,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:05:58,474 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:05:58,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:05:58,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:05:58,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:05:58,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:05:58,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:05:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2019-10-01 23:05:58,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:05:58,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:05:58,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:05:58,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:05:58,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:05:58,616 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand 30 states. [2019-10-01 23:05:58,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:05:58,964 INFO L93 Difference]: Finished difference Result 278 states and 286 transitions. [2019-10-01 23:05:58,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:05:58,965 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 147 [2019-10-01 23:05:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:05:58,966 INFO L225 Difference]: With dead ends: 278 [2019-10-01 23:05:58,966 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 23:05:58,967 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:05:58,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 23:05:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-10-01 23:05:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 23:05:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2019-10-01 23:05:58,973 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 147 [2019-10-01 23:05:58,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:05:58,973 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2019-10-01 23:05:58,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:05:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2019-10-01 23:05:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 23:05:58,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:05:58,974 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:05:58,974 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:05:58,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:05:58,975 INFO L82 PathProgramCache]: Analyzing trace with hash -987736206, now seen corresponding path program 27 times [2019-10-01 23:05:58,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:05:58,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:05:58,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:58,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:05:58,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:05:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:05:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2019-10-01 23:05:59,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:05:59,401 INFO L224 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) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:05:59,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:07:01,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:07:01,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:01,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:07:01,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2019-10-01 23:07:01,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:01,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:07:01,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:07:01,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:07:01,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:07:01,426 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand 31 states. [2019-10-01 23:07:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:01,762 INFO L93 Difference]: Finished difference Result 287 states and 295 transitions. [2019-10-01 23:07:01,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:07:01,763 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 152 [2019-10-01 23:07:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:01,764 INFO L225 Difference]: With dead ends: 287 [2019-10-01 23:07:01,765 INFO L226 Difference]: Without dead ends: 164 [2019-10-01 23:07:01,767 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:07:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-01 23:07:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2019-10-01 23:07:01,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-01 23:07:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 165 transitions. [2019-10-01 23:07:01,776 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 165 transitions. Word has length 152 [2019-10-01 23:07:01,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:01,776 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 165 transitions. [2019-10-01 23:07:01,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:07:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 165 transitions. [2019-10-01 23:07:01,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-01 23:07:01,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:01,777 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:01,778 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:01,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:01,778 INFO L82 PathProgramCache]: Analyzing trace with hash 312018346, now seen corresponding path program 28 times [2019-10-01 23:07:01,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:01,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:01,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:01,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:01,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2019-10-01 23:07:02,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:02,288 INFO L224 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-10-01 23:07:02,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:07:02,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:07:02,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:07:02,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:07:02,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:07:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:07:02,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:07:02,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:07:02,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:07:02,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:07:02,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:07:02,501 INFO L87 Difference]: Start difference. First operand 162 states and 165 transitions. Second operand 32 states. [2019-10-01 23:07:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:07:02,821 INFO L93 Difference]: Finished difference Result 296 states and 304 transitions. [2019-10-01 23:07:02,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:07:02,822 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 157 [2019-10-01 23:07:02,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:07:02,823 INFO L225 Difference]: With dead ends: 296 [2019-10-01 23:07:02,823 INFO L226 Difference]: Without dead ends: 169 [2019-10-01 23:07:02,824 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:07:02,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-01 23:07:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2019-10-01 23:07:02,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-01 23:07:02,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2019-10-01 23:07:02,829 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 157 [2019-10-01 23:07:02,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:07:02,830 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2019-10-01 23:07:02,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:07:02,830 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2019-10-01 23:07:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-01 23:07:02,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:07:02,831 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:07:02,831 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:07:02,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:07:02,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2029667222, now seen corresponding path program 29 times [2019-10-01 23:07:02,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:07:02,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:07:02,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:02,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:07:02,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:07:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:07:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2019-10-01 23:07:03,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:07:03,292 INFO L224 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-10-01 23:07:03,325 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:09:49,662 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-01 23:09:49,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:09:49,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:09:49,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:09:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2019-10-01 23:09:49,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:09:49,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:09:49,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:09:49,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:09:49,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:09:49,856 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand 33 states. [2019-10-01 23:09:50,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:09:50,219 INFO L93 Difference]: Finished difference Result 305 states and 313 transitions. [2019-10-01 23:09:50,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:09:50,227 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 162 [2019-10-01 23:09:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:09:50,228 INFO L225 Difference]: With dead ends: 305 [2019-10-01 23:09:50,228 INFO L226 Difference]: Without dead ends: 174 [2019-10-01 23:09:50,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:09:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-01 23:09:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-10-01 23:09:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-01 23:09:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 175 transitions. [2019-10-01 23:09:50,235 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 175 transitions. Word has length 162 [2019-10-01 23:09:50,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:09:50,235 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 175 transitions. [2019-10-01 23:09:50,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:09:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 175 transitions. [2019-10-01 23:09:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-01 23:09:50,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:09:50,237 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:09:50,237 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:09:50,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:09:50,237 INFO L82 PathProgramCache]: Analyzing trace with hash 332178338, now seen corresponding path program 30 times [2019-10-01 23:09:50,237 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:09:50,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:09:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:09:50,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:09:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:09:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:09:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2019-10-01 23:09:50,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:09:50,736 INFO L224 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-10-01 23:09:50,773 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE