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_copy4_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:42:48,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:42:48,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:42:48,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:42:48,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:42:48,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:42:48,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:42:48,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:42:48,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:42:48,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:42:48,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:42:48,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:42:48,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:42:48,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:42:48,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:42:48,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:42:48,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:42:48,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:42:48,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:42:48,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:42:48,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:42:48,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:42:48,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:42:48,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:42:48,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:42:48,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:42:48,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:42:48,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:42:48,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:42:48,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:42:48,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:42:48,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:42:48,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:42:48,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:42:48,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:42:48,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:42:48,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:42:48,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:42:48,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:42:48,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:42:48,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:42:48,964 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:42:48,979 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:42:48,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:42:48,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:42:48,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:42:48,981 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:42:48,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:42:48,982 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:42:48,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:42:48,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:42:48,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:42:48,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:42:48,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:42:48,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:42:48,983 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:42:48,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:42:48,983 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:42:48,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:42:48,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:42:48,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:42:48,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:42:48,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:42:48,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:42:48,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:42:48,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:42:48,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:42:48,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:42:48,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:42:48,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:42:48,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:42:49,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:42:49,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:42:49,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:42:49,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:42:49,039 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:42:49,040 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy4_ground-1.i [2019-10-01 22:42:49,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913a0523d/440acd2e08204603982aabd50c434e7e/FLAG0245c057e [2019-10-01 22:42:49,559 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:42:49,560 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy4_ground-1.i [2019-10-01 22:42:49,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913a0523d/440acd2e08204603982aabd50c434e7e/FLAG0245c057e [2019-10-01 22:42:49,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/913a0523d/440acd2e08204603982aabd50c434e7e [2019-10-01 22:42:49,979 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:42:49,981 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:42:49,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:42:49,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:42:49,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:42:49,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:42:49" (1/1) ... [2019-10-01 22:42:49,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7babf457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:49, skipping insertion in model container [2019-10-01 22:42:49,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:42:49" (1/1) ... [2019-10-01 22:42:49,998 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:42:50,017 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:42:50,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:42:50,249 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:42:50,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:42:50,316 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:42:50,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:50 WrapperNode [2019-10-01 22:42:50,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:42:50,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:42:50,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:42:50,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:42:50,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:50" (1/1) ... [2019-10-01 22:42:50,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:50" (1/1) ... [2019-10-01 22:42:50,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:50" (1/1) ... [2019-10-01 22:42:50,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:50" (1/1) ... [2019-10-01 22:42:50,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:50" (1/1) ... [2019-10-01 22:42:50,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:50" (1/1) ... [2019-10-01 22:42:50,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:50" (1/1) ... [2019-10-01 22:42:50,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:42:50,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:42:50,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:42:50,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:42:50,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:50" (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:42:50,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:42:50,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:42:50,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:42:50,519 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:42:50,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:42:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:42:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:42:50,520 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:42:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:42:50,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:42:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:42:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:42:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:42:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:42:50,872 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:42:50,872 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-01 22:42:50,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:42:50 BoogieIcfgContainer [2019-10-01 22:42:50,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:42:50,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:42:50,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:42:50,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:42:50,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:42:49" (1/3) ... [2019-10-01 22:42:50,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6298df30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:42:50, skipping insertion in model container [2019-10-01 22:42:50,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:42:50" (2/3) ... [2019-10-01 22:42:50,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6298df30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:42:50, skipping insertion in model container [2019-10-01 22:42:50,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:42:50" (3/3) ... [2019-10-01 22:42:50,901 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy4_ground-1.i [2019-10-01 22:42:50,921 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:42:50,931 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:42:50,949 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:42:50,979 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:42:50,979 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:42:50,980 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:42:50,980 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:42:50,980 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:42:50,980 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:42:50,980 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:42:50,981 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:42:50,981 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:42:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-10-01 22:42:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-01 22:42:51,002 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:51,004 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] [2019-10-01 22:42:51,006 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:51,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:51,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1010407240, now seen corresponding path program 1 times [2019-10-01 22:42:51,013 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:51,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:51,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:51,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:51,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:51,163 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:42:51,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:42:51,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:42:51,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:42:51,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:42:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:42:51,185 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-10-01 22:42:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:51,212 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2019-10-01 22:42:51,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:42:51,214 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2019-10-01 22:42:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:51,223 INFO L225 Difference]: With dead ends: 64 [2019-10-01 22:42:51,223 INFO L226 Difference]: Without dead ends: 31 [2019-10-01 22:42:51,227 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:42:51,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-01 22:42:51,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-01 22:42:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 22:42:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-01 22:42:51,266 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2019-10-01 22:42:51,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:51,267 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-01 22:42:51,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:42:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-01 22:42:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-01 22:42:51,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:51,268 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] [2019-10-01 22:42:51,269 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:51,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:51,269 INFO L82 PathProgramCache]: Analyzing trace with hash 555030978, now seen corresponding path program 1 times [2019-10-01 22:42:51,269 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:51,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:51,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:51,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:51,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:51,345 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:42:51,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:42:51,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:42:51,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:42:51,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:42:51,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:42:51,349 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2019-10-01 22:42:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:51,376 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-01 22:42:51,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:42:51,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-01 22:42:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:51,379 INFO L225 Difference]: With dead ends: 56 [2019-10-01 22:42:51,379 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 22:42:51,380 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:42:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 22:42:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-01 22:42:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 22:42:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-10-01 22:42:51,388 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 21 [2019-10-01 22:42:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:51,389 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-10-01 22:42:51,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:42:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-10-01 22:42:51,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 22:42:51,390 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:51,390 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, 1] [2019-10-01 22:42:51,391 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:51,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:51,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1099948320, now seen corresponding path program 1 times [2019-10-01 22:42:51,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:51,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:51,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:51,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:51,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:42:51,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:42:51,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:42:51,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:42:51,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:42:51,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:42:51,471 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 3 states. [2019-10-01 22:42:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:51,561 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2019-10-01 22:42:51,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:42:51,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-01 22:42:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:51,563 INFO L225 Difference]: With dead ends: 60 [2019-10-01 22:42:51,564 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 22:42:51,564 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:42:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 22:42:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-10-01 22:42:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-01 22:42:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-10-01 22:42:51,572 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 23 [2019-10-01 22:42:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:51,573 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-10-01 22:42:51,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:42:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-10-01 22:42:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-01 22:42:51,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:51,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:51,575 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:51,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:51,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1986876888, now seen corresponding path program 1 times [2019-10-01 22:42:51,575 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:51,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:51,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:51,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:51,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 22:42:51,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:51,696 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) [2019-10-01 22:42:51,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:42:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:51,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:42:51,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 22:42:51,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:51,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:42:51,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:42:51,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:42:51,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:42:51,846 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2019-10-01 22:42:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:51,897 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2019-10-01 22:42:51,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:42:51,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-01 22:42:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:51,899 INFO L225 Difference]: With dead ends: 66 [2019-10-01 22:42:51,899 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 22:42:51,901 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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:42:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 22:42:51,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-10-01 22:42:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-01 22:42:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-10-01 22:42:51,915 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 31 [2019-10-01 22:42:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:51,915 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-10-01 22:42:51,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:42:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-10-01 22:42:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-01 22:42:51,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:51,917 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:51,918 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:51,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1213402486, now seen corresponding path program 2 times [2019-10-01 22:42:51,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:51,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:51,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:51,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:51,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 22:42:52,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:52,009 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:42:52,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:42:52,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:42:52,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:52,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:42:52,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-01 22:42:52,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:52,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-10-01 22:42:52,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:42:52,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:42:52,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:42:52,133 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 7 states. [2019-10-01 22:42:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:52,297 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2019-10-01 22:42:52,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:42:52,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-10-01 22:42:52,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:52,301 INFO L225 Difference]: With dead ends: 80 [2019-10-01 22:42:52,302 INFO L226 Difference]: Without dead ends: 53 [2019-10-01 22:42:52,302 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:42:52,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-01 22:42:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-10-01 22:42:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-01 22:42:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-10-01 22:42:52,310 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 33 [2019-10-01 22:42:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:52,310 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-10-01 22:42:52,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:42:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-10-01 22:42:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-01 22:42:52,313 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:52,314 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:52,314 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:52,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:52,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1157629812, now seen corresponding path program 3 times [2019-10-01 22:42:52,315 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:52,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:52,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:52,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:52,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-01 22:42:52,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:52,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 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:42:52,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:42:52,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:42:52,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:52,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:42:52,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:52,546 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-01 22:42:52,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:52,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-01 22:42:52,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:42:52,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:42:52,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:42:52,553 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 9 states. [2019-10-01 22:42:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:52,703 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2019-10-01 22:42:52,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:42:52,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-10-01 22:42:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:52,706 INFO L225 Difference]: With dead ends: 98 [2019-10-01 22:42:52,707 INFO L226 Difference]: Without dead ends: 63 [2019-10-01 22:42:52,707 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:42:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-01 22:42:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2019-10-01 22:42:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-01 22:42:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2019-10-01 22:42:52,721 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 43 [2019-10-01 22:42:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:52,721 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2019-10-01 22:42:52,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:42:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2019-10-01 22:42:52,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-01 22:42:52,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:52,723 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:52,724 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:52,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1571995614, now seen corresponding path program 4 times [2019-10-01 22:42:52,726 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:52,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:52,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:52,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:52,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:42:52,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:52,874 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:42:52,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:42:52,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:42:52,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:52,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:42:52,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:42:52,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:52,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:42:52,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:42:52,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:42:52,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:42:52,972 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 8 states. [2019-10-01 22:42:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:53,010 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2019-10-01 22:42:53,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:42:53,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-10-01 22:42:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:53,012 INFO L225 Difference]: With dead ends: 104 [2019-10-01 22:42:53,012 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 22:42:53,013 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 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:42:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 22:42:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-01 22:42:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-01 22:42:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-10-01 22:42:53,020 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 53 [2019-10-01 22:42:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:53,020 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-10-01 22:42:53,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:42:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-10-01 22:42:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-01 22:42:53,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:53,022 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:42:53,023 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:53,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:53,023 INFO L82 PathProgramCache]: Analyzing trace with hash 161238336, now seen corresponding path program 5 times [2019-10-01 22:42:53,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:53,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:53,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:53,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:53,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-01 22:42:53,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:53,140 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:42:53,167 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:42:53,829 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:42:53,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:53,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:42:53,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:42:53,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:53,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-10-01 22:42:53,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:42:53,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:42:53,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:42:53,900 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 12 states. [2019-10-01 22:42:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:54,082 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-10-01 22:42:54,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 22:42:54,084 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-10-01 22:42:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:54,085 INFO L225 Difference]: With dead ends: 118 [2019-10-01 22:42:54,085 INFO L226 Difference]: Without dead ends: 75 [2019-10-01 22:42:54,087 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:42:54,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-01 22:42:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2019-10-01 22:42:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-01 22:42:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2019-10-01 22:42:54,097 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 55 [2019-10-01 22:42:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:54,101 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2019-10-01 22:42:54,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:42:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2019-10-01 22:42:54,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 22:42:54,102 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:54,102 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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:42:54,102 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:54,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:54,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1745421270, now seen corresponding path program 6 times [2019-10-01 22:42:54,103 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:54,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:54,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:54,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:54,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:42:54,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:54,227 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:42:54,255 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:42:54,427 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:42:54,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:54,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:42:54,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-01 22:42:54,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:54,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-10-01 22:42:54,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 22:42:54,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 22:42:54,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-10-01 22:42:54,522 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 16 states. [2019-10-01 22:42:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:54,759 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2019-10-01 22:42:54,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:42:54,759 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-10-01 22:42:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:54,761 INFO L225 Difference]: With dead ends: 137 [2019-10-01 22:42:54,761 INFO L226 Difference]: Without dead ends: 86 [2019-10-01 22:42:54,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:42:54,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-01 22:42:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2019-10-01 22:42:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-01 22:42:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2019-10-01 22:42:54,770 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2019-10-01 22:42:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:54,771 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2019-10-01 22:42:54,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 22:42:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2019-10-01 22:42:54,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-01 22:42:54,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:54,773 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 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:42:54,775 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:54,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1197147766, now seen corresponding path program 7 times [2019-10-01 22:42:54,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:54,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:54,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:54,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:54,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 22:42:54,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:54,904 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:42:54,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:54,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:42:54,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 22:42:55,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:55,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:42:55,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:42:55,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:42:55,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:42:55,029 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 12 states. [2019-10-01 22:42:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:55,082 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2019-10-01 22:42:55,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:42:55,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2019-10-01 22:42:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:55,084 INFO L225 Difference]: With dead ends: 144 [2019-10-01 22:42:55,084 INFO L226 Difference]: Without dead ends: 85 [2019-10-01 22:42:55,085 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:42:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-01 22:42:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-10-01 22:42:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-01 22:42:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2019-10-01 22:42:55,094 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 77 [2019-10-01 22:42:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:55,094 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2019-10-01 22:42:55,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:42:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2019-10-01 22:42:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-01 22:42:55,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:55,096 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 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:42:55,097 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash -729412440, now seen corresponding path program 8 times [2019-10-01 22:42:55,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:55,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:55,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:55,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:42:55,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 22:42:55,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:55,231 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) [2019-10-01 22:42:55,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:42:55,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:42:55,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:55,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:42:55,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 22:42:55,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:55,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 22:42:55,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:42:55,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:42:55,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:42:55,352 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 13 states. [2019-10-01 22:42:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:55,397 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2019-10-01 22:42:55,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 22:42:55,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2019-10-01 22:42:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:55,399 INFO L225 Difference]: With dead ends: 146 [2019-10-01 22:42:55,399 INFO L226 Difference]: Without dead ends: 87 [2019-10-01 22:42:55,400 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:42:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-01 22:42:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-10-01 22:42:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-01 22:42:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2019-10-01 22:42:55,408 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 79 [2019-10-01 22:42:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:55,408 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2019-10-01 22:42:55,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:42:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2019-10-01 22:42:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-01 22:42:55,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:55,410 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 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:42:55,410 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:55,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:55,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2087637062, now seen corresponding path program 9 times [2019-10-01 22:42:55,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:55,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:55,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:55,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:55,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-01 22:42:55,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:55,542 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:42:55,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:42:56,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:42:56,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:56,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:42:56,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-10-01 22:42:56,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:56,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-10-01 22:42:56,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:42:56,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:42:56,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:42:56,184 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 19 states. [2019-10-01 22:42:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:56,354 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2019-10-01 22:42:56,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:42:56,355 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81 [2019-10-01 22:42:56,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:56,356 INFO L225 Difference]: With dead ends: 160 [2019-10-01 22:42:56,356 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 22:42:56,358 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:42:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 22:42:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2019-10-01 22:42:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-01 22:42:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2019-10-01 22:42:56,365 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 81 [2019-10-01 22:42:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:56,366 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2019-10-01 22:42:56,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:42:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2019-10-01 22:42:56,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-01 22:42:56,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:56,367 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 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:42:56,368 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:56,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1658681180, now seen corresponding path program 10 times [2019-10-01 22:42:56,368 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:56,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:56,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:56,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:56,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-01 22:42:56,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:56,596 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:42:56,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:42:56,668 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:42:56,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:42:56,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:42:56,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:42:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-01 22:42:56,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:42:56,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 22:42:56,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:42:56,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:42:56,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:42:56,706 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 15 states. [2019-10-01 22:42:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:42:56,755 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2019-10-01 22:42:56,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 22:42:56,757 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2019-10-01 22:42:56,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:42:56,758 INFO L225 Difference]: With dead ends: 166 [2019-10-01 22:42:56,758 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 22:42:56,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 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:42:56,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 22:42:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-10-01 22:42:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-01 22:42:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2019-10-01 22:42:56,766 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 91 [2019-10-01 22:42:56,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:42:56,767 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2019-10-01 22:42:56,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:42:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2019-10-01 22:42:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-01 22:42:56,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:42:56,768 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 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:42:56,769 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:42:56,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:42:56,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1905769978, now seen corresponding path program 11 times [2019-10-01 22:42:56,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:42:56,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:42:56,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:56,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:42:56,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:42:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:42:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-01 22:42:56,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:42:56,921 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:42:56,945 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:43:26,111 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-10-01 22:43:26,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:26,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:43:26,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-10-01 22:43:26,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:26,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2019-10-01 22:43:26,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:43:26,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:43:26,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:43:26,244 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand 22 states. [2019-10-01 22:43:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:26,427 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2019-10-01 22:43:26,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:43:26,429 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 93 [2019-10-01 22:43:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:26,430 INFO L225 Difference]: With dead ends: 180 [2019-10-01 22:43:26,430 INFO L226 Difference]: Without dead ends: 113 [2019-10-01 22:43:26,434 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:43:26,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-01 22:43:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2019-10-01 22:43:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-01 22:43:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2019-10-01 22:43:26,445 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 93 [2019-10-01 22:43:26,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:26,446 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2019-10-01 22:43:26,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:43:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2019-10-01 22:43:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-01 22:43:26,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:26,447 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 7, 7, 7, 7, 7, 7, 7, 7, 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:43:26,447 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:26,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:26,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1621978096, now seen corresponding path program 12 times [2019-10-01 22:43:26,448 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:26,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:26,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:26,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:26,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-01 22:43:26,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:26,677 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:43:26,721 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:43:42,514 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-10-01 22:43:42,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:42,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:43:42,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-01 22:43:42,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:42,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:43:42,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:43:42,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:43:42,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:43:42,600 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 17 states. [2019-10-01 22:43:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:42,664 INFO L93 Difference]: Finished difference Result 186 states and 196 transitions. [2019-10-01 22:43:42,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:43:42,664 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-10-01 22:43:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:42,666 INFO L225 Difference]: With dead ends: 186 [2019-10-01 22:43:42,666 INFO L226 Difference]: Without dead ends: 111 [2019-10-01 22:43:42,671 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 103 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:43:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-01 22:43:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-10-01 22:43:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-01 22:43:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2019-10-01 22:43:42,678 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 103 [2019-10-01 22:43:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:42,678 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2019-10-01 22:43:42,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:43:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2019-10-01 22:43:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-01 22:43:42,684 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:42,684 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 7, 7, 7, 7, 7, 7, 7, 7, 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:43:42,684 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:42,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:42,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1873927598, now seen corresponding path program 13 times [2019-10-01 22:43:42,685 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:42,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:42,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:42,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:42,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-01 22:43:42,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:42,879 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:43:42,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:43:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:42,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:43:42,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-01 22:43:42,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:42,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:43:42,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:43:42,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:43:42,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:43:42,974 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 18 states. [2019-10-01 22:43:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:43,049 INFO L93 Difference]: Finished difference Result 188 states and 198 transitions. [2019-10-01 22:43:43,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:43:43,053 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 105 [2019-10-01 22:43:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:43,054 INFO L225 Difference]: With dead ends: 188 [2019-10-01 22:43:43,054 INFO L226 Difference]: Without dead ends: 113 [2019-10-01 22:43:43,055 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 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:43:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-01 22:43:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-10-01 22:43:43,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-01 22:43:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2019-10-01 22:43:43,060 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 105 [2019-10-01 22:43:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:43,061 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2019-10-01 22:43:43,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:43:43,061 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2019-10-01 22:43:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-01 22:43:43,062 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:43,062 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 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:43:43,063 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:43,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:43,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1520093236, now seen corresponding path program 14 times [2019-10-01 22:43:43,063 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:43,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:43,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:43,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:43:43,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-01 22:43:43,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:43,248 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:43:43,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:43:43,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:43:43,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:43,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:43:43,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-01 22:43:43,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:43,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 22:43:43,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:43:43,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:43:43,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:43:43,366 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 19 states. [2019-10-01 22:43:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:43,442 INFO L93 Difference]: Finished difference Result 190 states and 200 transitions. [2019-10-01 22:43:43,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 22:43:43,442 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 107 [2019-10-01 22:43:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:43,443 INFO L225 Difference]: With dead ends: 190 [2019-10-01 22:43:43,443 INFO L226 Difference]: Without dead ends: 115 [2019-10-01 22:43:43,444 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 107 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:43:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-01 22:43:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-10-01 22:43:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-01 22:43:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2019-10-01 22:43:43,450 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 107 [2019-10-01 22:43:43,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:43,450 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2019-10-01 22:43:43,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:43:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2019-10-01 22:43:43,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-01 22:43:43,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:43,452 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 7, 7, 7, 7, 7, 7, 7, 7, 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:43:43,452 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:43,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:43,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1001030250, now seen corresponding path program 15 times [2019-10-01 22:43:43,452 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:43,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:43,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:43,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:43,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-01 22:43:43,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:43,693 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:43:43,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:43:47,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-01 22:43:47,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:47,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:43:47,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:47,443 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 31 proven. 49 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-10-01 22:43:47,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:47,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2019-10-01 22:43:47,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:43:47,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:43:47,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:43:47,451 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 29 states. [2019-10-01 22:43:47,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:47,980 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2019-10-01 22:43:47,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:43:47,981 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2019-10-01 22:43:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:47,982 INFO L225 Difference]: With dead ends: 205 [2019-10-01 22:43:47,982 INFO L226 Difference]: Without dead ends: 130 [2019-10-01 22:43:47,983 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=342, Invalid=990, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 22:43:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-01 22:43:47,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-10-01 22:43:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-01 22:43:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2019-10-01 22:43:47,989 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 109 [2019-10-01 22:43:47,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:47,990 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2019-10-01 22:43:47,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:43:47,990 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2019-10-01 22:43:47,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-01 22:43:47,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:47,991 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 8, 8, 8, 8, 8, 8, 8, 8, 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:43:47,992 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:47,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:47,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1189242338, now seen corresponding path program 16 times [2019-10-01 22:43:47,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:47,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:47,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:47,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:47,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-10-01 22:43:48,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:48,246 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:43:48,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:43:48,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:43:48,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:43:48,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:43:48,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:43:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:43:48,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:43:48,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 22:43:48,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:43:48,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:43:48,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:43:48,400 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand 22 states. [2019-10-01 22:43:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:43:48,485 INFO L93 Difference]: Finished difference Result 212 states and 222 transitions. [2019-10-01 22:43:48,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 22:43:48,486 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 121 [2019-10-01 22:43:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:43:48,487 INFO L225 Difference]: With dead ends: 212 [2019-10-01 22:43:48,487 INFO L226 Difference]: Without dead ends: 129 [2019-10-01 22:43:48,488 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:43:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-01 22:43:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-10-01 22:43:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-01 22:43:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2019-10-01 22:43:48,494 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 121 [2019-10-01 22:43:48,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:43:48,494 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2019-10-01 22:43:48,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:43:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2019-10-01 22:43:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-01 22:43:48,496 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:43:48,496 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 8, 8, 8, 8, 8, 8, 8, 8, 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:43:48,496 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:43:48,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:43:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1422194748, now seen corresponding path program 17 times [2019-10-01 22:43:48,497 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:43:48,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:43:48,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:48,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:43:48,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:43:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:43:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-10-01 22:43:48,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:43:48,756 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:43:48,787 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:44:52,196 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-10-01 22:44:52,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:52,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:44:52,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2019-10-01 22:44:52,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:52,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11] total 31 [2019-10-01 22:44:52,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:44:52,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:44:52,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=645, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:44:52,408 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 31 states. [2019-10-01 22:44:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:52,679 INFO L93 Difference]: Finished difference Result 226 states and 240 transitions. [2019-10-01 22:44:52,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 22:44:52,679 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 123 [2019-10-01 22:44:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:52,681 INFO L225 Difference]: With dead ends: 226 [2019-10-01 22:44:52,681 INFO L226 Difference]: Without dead ends: 143 [2019-10-01 22:44:52,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=285, Invalid=645, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:44:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-01 22:44:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 138. [2019-10-01 22:44:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-01 22:44:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2019-10-01 22:44:52,689 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 123 [2019-10-01 22:44:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:52,690 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2019-10-01 22:44:52,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:44:52,691 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2019-10-01 22:44:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-01 22:44:52,692 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:52,692 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 9, 9, 9, 9, 9, 9, 9, 9, 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:44:52,693 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:52,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:52,693 INFO L82 PathProgramCache]: Analyzing trace with hash 34792402, now seen corresponding path program 18 times [2019-10-01 22:44:52,693 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:52,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:52,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:52,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:52,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2019-10-01 22:44:53,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:53,012 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:44:53,038 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:45:58,456 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 22:45:58,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:45:58,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:45:58,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:45:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 34 proven. 81 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2019-10-01 22:45:58,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:45:58,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 35 [2019-10-01 22:45:58,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:45:58,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:45:58,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=847, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:45:58,684 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 35 states. [2019-10-01 22:45:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:45:59,083 INFO L93 Difference]: Finished difference Result 248 states and 266 transitions. [2019-10-01 22:45:59,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:45:59,084 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 133 [2019-10-01 22:45:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:45:59,086 INFO L225 Difference]: With dead ends: 248 [2019-10-01 22:45:59,086 INFO L226 Difference]: Without dead ends: 157 [2019-10-01 22:45:59,087 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=343, Invalid=847, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:45:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-01 22:45:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-10-01 22:45:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-01 22:45:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 161 transitions. [2019-10-01 22:45:59,094 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 161 transitions. Word has length 133 [2019-10-01 22:45:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:45:59,094 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 161 transitions. [2019-10-01 22:45:59,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:45:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 161 transitions. [2019-10-01 22:45:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-01 22:45:59,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:45:59,096 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 11, 11, 11, 11, 11, 11, 11, 11, 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:45:59,097 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:45:59,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:45:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1657537824, now seen corresponding path program 19 times [2019-10-01 22:45:59,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:45:59,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:45:59,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:59,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:45:59,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:45:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-10-01 22:45:59,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:45:59,427 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 22:45:59,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:45:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:45:59,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:45:59,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:45:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-10-01 22:45:59,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:45:59,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 22:45:59,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 22:45:59,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 22:45:59,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:45:59,594 INFO L87 Difference]: Start difference. First operand 156 states and 161 transitions. Second operand 25 states. [2019-10-01 22:45:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:45:59,690 INFO L93 Difference]: Finished difference Result 266 states and 276 transitions. [2019-10-01 22:45:59,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:45:59,694 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 151 [2019-10-01 22:45:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:45:59,696 INFO L225 Difference]: With dead ends: 266 [2019-10-01 22:45:59,696 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 22:45:59,697 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 151 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 22:45:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 22:45:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-10-01 22:45:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-01 22:45:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 163 transitions. [2019-10-01 22:45:59,703 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 163 transitions. Word has length 151 [2019-10-01 22:45:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:45:59,704 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 163 transitions. [2019-10-01 22:45:59,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 22:45:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 163 transitions. [2019-10-01 22:45:59,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-01 22:45:59,705 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:45:59,706 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 11, 11, 11, 11, 11, 11, 11, 11, 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:45:59,706 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:45:59,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:45:59,706 INFO L82 PathProgramCache]: Analyzing trace with hash -2023075714, now seen corresponding path program 20 times [2019-10-01 22:45:59,706 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:45:59,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:45:59,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:59,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:45:59,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:46:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-10-01 22:46:00,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:46:00,148 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 22:46:00,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:46:00,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:46:00,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:46:00,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:46:00,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:46:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-10-01 22:46:00,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:46:00,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 22:46:00,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:46:00,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:46:00,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:46:00,337 INFO L87 Difference]: Start difference. First operand 158 states and 163 transitions. Second operand 26 states. [2019-10-01 22:46:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:46:00,419 INFO L93 Difference]: Finished difference Result 268 states and 278 transitions. [2019-10-01 22:46:00,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:46:00,420 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 153 [2019-10-01 22:46:00,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:46:00,421 INFO L225 Difference]: With dead ends: 268 [2019-10-01 22:46:00,421 INFO L226 Difference]: Without dead ends: 161 [2019-10-01 22:46:00,422 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 153 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 22:46:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-01 22:46:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-10-01 22:46:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-01 22:46:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 165 transitions. [2019-10-01 22:46:00,429 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 165 transitions. Word has length 153 [2019-10-01 22:46:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:46:00,429 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 165 transitions. [2019-10-01 22:46:00,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:46:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 165 transitions. [2019-10-01 22:46:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-01 22:46:00,431 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:46:00,431 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 11, 11, 11, 11, 11, 11, 11, 11, 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:46:00,431 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:46:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:46:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1117669732, now seen corresponding path program 21 times [2019-10-01 22:46:00,432 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:46:00,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:46:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:46:00,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:46:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:46:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:46:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-10-01 22:46:00,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:46:00,905 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 22:46:00,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:46:42,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 22:46:42,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:46:42,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 22:46:42,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:46:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 45 proven. 121 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2019-10-01 22:46:42,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:46:42,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16] total 40 [2019-10-01 22:46:42,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 22:46:42,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 22:46:42,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=1092, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:46:42,369 INFO L87 Difference]: Start difference. First operand 160 states and 165 transitions. Second operand 40 states. [2019-10-01 22:46:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:46:43,027 INFO L93 Difference]: Finished difference Result 283 states and 298 transitions. [2019-10-01 22:46:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:46:43,028 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 155 [2019-10-01 22:46:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:46:43,029 INFO L225 Difference]: With dead ends: 283 [2019-10-01 22:46:43,029 INFO L226 Difference]: Without dead ends: 176 [2019-10-01 22:46:43,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=648, Invalid=2004, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 22:46:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-01 22:46:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2019-10-01 22:46:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-01 22:46:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 177 transitions. [2019-10-01 22:46:43,037 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 177 transitions. Word has length 155 [2019-10-01 22:46:43,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:46:43,038 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 177 transitions. [2019-10-01 22:46:43,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 22:46:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2019-10-01 22:46:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-01 22:46:43,039 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:46:43,040 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 12, 12, 12, 12, 12, 12, 12, 12, 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:46:43,040 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:46:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:46:43,040 INFO L82 PathProgramCache]: Analyzing trace with hash -168914096, now seen corresponding path program 22 times [2019-10-01 22:46:43,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:46:43,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:46:43,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:46:43,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:46:43,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:46:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:46:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-10-01 22:46:43,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:46:43,468 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 22:46:43,543 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:46:43,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:46:43,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:46:43,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:46:43,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:46:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:46:44,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:46:44,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 15] total 41 [2019-10-01 22:46:44,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:46:44,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:46:44,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=1158, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:46:44,123 INFO L87 Difference]: Start difference. First operand 172 states and 177 transitions. Second operand 41 states. [2019-10-01 22:46:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:46:44,555 INFO L93 Difference]: Finished difference Result 302 states and 316 transitions. [2019-10-01 22:46:44,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:46:44,555 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 167 [2019-10-01 22:46:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:46:44,557 INFO L225 Difference]: With dead ends: 302 [2019-10-01 22:46:44,557 INFO L226 Difference]: Without dead ends: 187 [2019-10-01 22:46:44,558 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=482, Invalid=1158, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:46:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-01 22:46:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 182. [2019-10-01 22:46:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-01 22:46:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 187 transitions. [2019-10-01 22:46:44,570 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 187 transitions. Word has length 167 [2019-10-01 22:46:44,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:46:44,570 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 187 transitions. [2019-10-01 22:46:44,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:46:44,570 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 187 transitions. [2019-10-01 22:46:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-01 22:46:44,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:46:44,572 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 13, 13, 13, 13, 13, 13, 13, 13, 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:46:44,573 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:46:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:46:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1882174950, now seen corresponding path program 23 times [2019-10-01 22:46:44,573 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:46:44,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:46:44,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:46:44,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:46:44,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:46:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:46:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-10-01 22:46:45,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:46:45,060 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 22:46:45,127 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:48:56,838 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2019-10-01 22:48:56,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:48:56,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:48:56,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:48:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 1183 trivial. 0 not checked. [2019-10-01 22:48:57,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:48:57,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16] total 43 [2019-10-01 22:48:57,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:48:57,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:48:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=1281, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:48:57,313 INFO L87 Difference]: Start difference. First operand 182 states and 187 transitions. Second operand 43 states. [2019-10-01 22:48:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:48:57,780 INFO L93 Difference]: Finished difference Result 320 states and 334 transitions. [2019-10-01 22:48:57,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:48:57,781 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 177 [2019-10-01 22:48:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:48:57,782 INFO L225 Difference]: With dead ends: 320 [2019-10-01 22:48:57,783 INFO L226 Difference]: Without dead ends: 197 [2019-10-01 22:48:57,784 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=525, Invalid=1281, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:48:57,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-01 22:48:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2019-10-01 22:48:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-01 22:48:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 197 transitions. [2019-10-01 22:48:57,792 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 197 transitions. Word has length 177 [2019-10-01 22:48:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:48:57,792 INFO L475 AbstractCegarLoop]: Abstraction has 192 states and 197 transitions. [2019-10-01 22:48:57,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:48:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 197 transitions. [2019-10-01 22:48:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-01 22:48:57,793 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:48:57,794 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 14, 14, 14, 14, 14, 14, 14, 14, 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:48:57,794 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:48:57,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:48:57,794 INFO L82 PathProgramCache]: Analyzing trace with hash 258594044, now seen corresponding path program 24 times [2019-10-01 22:48:57,794 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:48:57,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:48:57,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:57,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:48:57,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:48:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-10-01 22:48:58,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:48:58,384 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 22:48:58,423 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:51:55,771 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-10-01 22:51:55,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:51:55,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-01 22:51:55,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:51:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-10-01 22:51:55,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:51:55,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 22:51:55,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 22:51:55,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 22:51:55,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:51:55,906 INFO L87 Difference]: Start difference. First operand 192 states and 197 transitions. Second operand 31 states. [2019-10-01 22:51:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:51:56,029 INFO L93 Difference]: Finished difference Result 326 states and 336 transitions. [2019-10-01 22:51:56,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:51:56,030 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 187 [2019-10-01 22:51:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:51:56,031 INFO L225 Difference]: With dead ends: 326 [2019-10-01 22:51:56,032 INFO L226 Difference]: Without dead ends: 195 [2019-10-01 22:51:56,035 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 22:51:56,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-01 22:51:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2019-10-01 22:51:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-01 22:51:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 199 transitions. [2019-10-01 22:51:56,045 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 199 transitions. Word has length 187 [2019-10-01 22:51:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:51:56,046 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 199 transitions. [2019-10-01 22:51:56,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 22:51:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 199 transitions. [2019-10-01 22:51:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-01 22:51:56,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:51:56,048 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 14, 14, 14, 14, 14, 14, 14, 14, 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:51:56,049 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:51:56,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:51:56,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1903047578, now seen corresponding path program 25 times [2019-10-01 22:51:56,051 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:51:56,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:51:56,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:56,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:51:56,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:51:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-10-01 22:51:56,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:51:56,857 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 22:51:56,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:51:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:51:57,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:51:57,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:51:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-10-01 22:51:57,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:51:57,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 22:51:57,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 22:51:57,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 22:51:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:51:57,125 INFO L87 Difference]: Start difference. First operand 194 states and 199 transitions. Second operand 32 states. [2019-10-01 22:51:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:51:57,242 INFO L93 Difference]: Finished difference Result 328 states and 338 transitions. [2019-10-01 22:51:57,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 22:51:57,242 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 189 [2019-10-01 22:51:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:51:57,244 INFO L225 Difference]: With dead ends: 328 [2019-10-01 22:51:57,244 INFO L226 Difference]: Without dead ends: 197 [2019-10-01 22:51:57,245 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:51:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-01 22:51:57,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-10-01 22:51:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-01 22:51:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 201 transitions. [2019-10-01 22:51:57,252 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 201 transitions. Word has length 189 [2019-10-01 22:51:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:51:57,253 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 201 transitions. [2019-10-01 22:51:57,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 22:51:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 201 transitions. [2019-10-01 22:51:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-01 22:51:57,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:51:57,254 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 14, 14, 14, 14, 14, 14, 14, 14, 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:51:57,255 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:51:57,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:51:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1674928824, now seen corresponding path program 26 times [2019-10-01 22:51:57,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:51:57,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:51:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:57,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:51:57,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:51:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-10-01 22:51:57,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:51:57,821 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 22:51:57,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:51:58,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:51:58,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:51:58,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 22:51:58,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:51:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-10-01 22:51:58,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:51:58,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 22:51:58,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 22:51:58,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 22:51:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:51:58,064 INFO L87 Difference]: Start difference. First operand 196 states and 201 transitions. Second operand 33 states. [2019-10-01 22:51:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:51:58,181 INFO L93 Difference]: Finished difference Result 330 states and 340 transitions. [2019-10-01 22:51:58,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 22:51:58,182 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 191 [2019-10-01 22:51:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:51:58,183 INFO L225 Difference]: With dead ends: 330 [2019-10-01 22:51:58,183 INFO L226 Difference]: Without dead ends: 199 [2019-10-01 22:51:58,184 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 22:51:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-01 22:51:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2019-10-01 22:51:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-01 22:51:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 203 transitions. [2019-10-01 22:51:58,192 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 203 transitions. Word has length 191 [2019-10-01 22:51:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:51:58,193 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 203 transitions. [2019-10-01 22:51:58,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 22:51:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 203 transitions. [2019-10-01 22:51:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-01 22:51:58,194 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:51:58,194 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 14, 14, 14, 14, 14, 14, 14, 14, 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:51:58,195 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:51:58,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:51:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1496138326, now seen corresponding path program 27 times [2019-10-01 22:51:58,195 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:51:58,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:51:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:58,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:51:58,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:51:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:51:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1684 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-10-01 22:51:58,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:51:58,831 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 22:51:58,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:53:10,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 22:53:10,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:53:10,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:53:10,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:53:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1684 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 1488 trivial. 0 not checked. [2019-10-01 22:53:10,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:53:10,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 17] total 48 [2019-10-01 22:53:10,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:53:10,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:53:10,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=1593, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:53:10,683 INFO L87 Difference]: Start difference. First operand 198 states and 203 transitions. Second operand 48 states. [2019-10-01 22:53:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:53:11,067 INFO L93 Difference]: Finished difference Result 344 states and 358 transitions. [2019-10-01 22:53:11,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 22:53:11,068 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 193 [2019-10-01 22:53:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:53:11,070 INFO L225 Difference]: With dead ends: 344 [2019-10-01 22:53:11,070 INFO L226 Difference]: Without dead ends: 213 [2019-10-01 22:53:11,071 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=663, Invalid=1593, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:53:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-01 22:53:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 208. [2019-10-01 22:53:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-01 22:53:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 213 transitions. [2019-10-01 22:53:11,081 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 213 transitions. Word has length 193 [2019-10-01 22:53:11,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:53:11,081 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 213 transitions. [2019-10-01 22:53:11,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:53:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 213 transitions. [2019-10-01 22:53:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-01 22:53:11,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:53:11,083 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 15, 15, 15, 15, 15, 15, 15, 15, 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:53:11,085 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:53:11,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:53:11,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1019652756, now seen corresponding path program 28 times [2019-10-01 22:53:11,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:53:11,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:53:11,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:53:11,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:53:11,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:53:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:53:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-10-01 22:53:11,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:53:11,631 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 22:53:11,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:53:11,761 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:53:11,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:53:11,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:53:11,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:53:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-10-01 22:53:11,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:53:11,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 22:53:11,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:53:11,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:53:11,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:53:11,838 INFO L87 Difference]: Start difference. First operand 208 states and 213 transitions. Second operand 35 states. [2019-10-01 22:53:11,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:53:11,968 INFO L93 Difference]: Finished difference Result 350 states and 360 transitions. [2019-10-01 22:53:11,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:53:11,968 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 203 [2019-10-01 22:53:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:53:11,970 INFO L225 Difference]: With dead ends: 350 [2019-10-01 22:53:11,970 INFO L226 Difference]: Without dead ends: 211 [2019-10-01 22:53:11,971 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:53:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-01 22:53:11,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2019-10-01 22:53:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-01 22:53:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 215 transitions. [2019-10-01 22:53:11,979 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 215 transitions. Word has length 203 [2019-10-01 22:53:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:53:11,979 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 215 transitions. [2019-10-01 22:53:11,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:53:11,980 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 215 transitions. [2019-10-01 22:53:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-01 22:53:11,981 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:53:11,981 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 15, 15, 15, 15, 15, 15, 15, 15, 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:53:11,981 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:53:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:53:11,982 INFO L82 PathProgramCache]: Analyzing trace with hash -979847158, now seen corresponding path program 29 times [2019-10-01 22:53:11,982 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:53:11,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:53:11,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:53:11,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:53:11,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:53:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:53:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1924 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-10-01 22:53:12,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:53:12,519 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 22:53:12,573 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:55:50,502 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-10-01 22:55:50,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:55:50,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 22:55:50,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:55:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1924 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-10-01 22:55:50,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:55:50,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 22:55:50,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:55:50,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:55:50,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:55:50,658 INFO L87 Difference]: Start difference. First operand 210 states and 215 transitions. Second operand 36 states. [2019-10-01 22:55:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:55:50,783 INFO L93 Difference]: Finished difference Result 352 states and 362 transitions. [2019-10-01 22:55:50,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:55:50,783 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 205 [2019-10-01 22:55:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:55:50,785 INFO L225 Difference]: With dead ends: 352 [2019-10-01 22:55:50,786 INFO L226 Difference]: Without dead ends: 213 [2019-10-01 22:55:50,790 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:55:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-01 22:55:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2019-10-01 22:55:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-01 22:55:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 217 transitions. [2019-10-01 22:55:50,800 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 217 transitions. Word has length 205 [2019-10-01 22:55:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:55:50,802 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 217 transitions. [2019-10-01 22:55:50,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:55:50,803 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 217 transitions. [2019-10-01 22:55:50,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-01 22:55:50,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:55:50,804 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 15, 15, 15, 15, 15, 15, 15, 15, 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:55:50,804 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:55:50,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:55:50,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1381373144, now seen corresponding path program 30 times [2019-10-01 22:55:50,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:55:50,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:55:50,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:55:50,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:55:50,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:55:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:55:51,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2019-10-01 22:55:51,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:55:51,528 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 22:55:51,574 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE