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_init5_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:11:47,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:11:47,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:11:47,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:11:47,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:11:47,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:11:47,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:11:47,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:11:47,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:11:47,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:11:47,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:11:47,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:11:47,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:11:47,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:11:47,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:11:47,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:11:47,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:11:47,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:11:47,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:11:47,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:11:47,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:11:47,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:11:47,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:11:47,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:11:47,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:11:47,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:11:47,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:11:47,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:11:47,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:11:47,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:11:47,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:11:47,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:11:47,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:11:47,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:11:47,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:11:47,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:11:47,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:11:47,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:11:47,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:11:47,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:11:47,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:11:47,994 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 23:11:48,010 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:11:48,010 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:11:48,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:11:48,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:11:48,012 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:11:48,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:11:48,013 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:11:48,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:11:48,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:11:48,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:11:48,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:11:48,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:11:48,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:11:48,014 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:11:48,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:11:48,014 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:11:48,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:11:48,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:11:48,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:11:48,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:11:48,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:11:48,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:11:48,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:11:48,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:11:48,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:11:48,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:11:48,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:11:48,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:11:48,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:11:48,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:11:48,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:11:48,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:11:48,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:11:48,086 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:11:48,087 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init5_ground-2.i [2019-10-01 23:11:48,151 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33b45d5bf/7e2655180b57422580538694778c6a3b/FLAGade1f3615 [2019-10-01 23:11:48,619 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:11:48,620 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init5_ground-2.i [2019-10-01 23:11:48,627 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33b45d5bf/7e2655180b57422580538694778c6a3b/FLAGade1f3615 [2019-10-01 23:11:49,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33b45d5bf/7e2655180b57422580538694778c6a3b [2019-10-01 23:11:49,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:11:49,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:11:49,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:11:49,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:11:49,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:11:49,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:11:49" (1/1) ... [2019-10-01 23:11:49,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343d4392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:49, skipping insertion in model container [2019-10-01 23:11:49,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:11:49" (1/1) ... [2019-10-01 23:11:49,061 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:11:49,076 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:11:49,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:11:49,268 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:11:49,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:11:49,400 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:11:49,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:49 WrapperNode [2019-10-01 23:11:49,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:11:49,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:11:49,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:11:49,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:11:49,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:49" (1/1) ... [2019-10-01 23:11:49,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:49" (1/1) ... [2019-10-01 23:11:49,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:49" (1/1) ... [2019-10-01 23:11:49,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:49" (1/1) ... [2019-10-01 23:11:49,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:49" (1/1) ... [2019-10-01 23:11:49,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:49" (1/1) ... [2019-10-01 23:11:49,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:49" (1/1) ... [2019-10-01 23:11:49,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:11:49,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:11:49,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:11:49,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:11:49,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:49" (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 23:11:49,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:11:49,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:11:49,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:11:49,518 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:11:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:11:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:11:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:11:49,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:11:49,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:11:49,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:11:49,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:11:49,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:11:49,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:11:49,812 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:11:49,813 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-01 23:11:49,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:11:49 BoogieIcfgContainer [2019-10-01 23:11:49,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:11:49,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:11:49,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:11:49,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:11:49,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:11:49" (1/3) ... [2019-10-01 23:11:49,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103096eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:11:49, skipping insertion in model container [2019-10-01 23:11:49,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:11:49" (2/3) ... [2019-10-01 23:11:49,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103096eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:11:49, skipping insertion in model container [2019-10-01 23:11:49,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:11:49" (3/3) ... [2019-10-01 23:11:49,824 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_init5_ground-2.i [2019-10-01 23:11:49,835 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:11:49,843 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:11:49,865 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:11:49,906 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:11:49,906 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:11:49,906 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:11:49,907 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:11:49,907 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:11:49,907 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:11:49,907 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:11:49,907 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:11:49,907 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:11:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 23:11:49,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-01 23:11:49,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:49,930 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 23:11:49,932 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:49,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:49,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1721973062, now seen corresponding path program 1 times [2019-10-01 23:11:49,939 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:49,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:49,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:49,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:11:49,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:50,078 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 23:11:50,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:11:50,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:11:50,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:11:50,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:11:50,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:11:50,097 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 23:11:50,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:50,120 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-10-01 23:11:50,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:11:50,121 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2019-10-01 23:11:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:50,128 INFO L225 Difference]: With dead ends: 55 [2019-10-01 23:11:50,129 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 23:11:50,132 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 23:11:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 23:11:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 23:11:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 23:11:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-10-01 23:11:50,184 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 21 [2019-10-01 23:11:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:50,185 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-10-01 23:11:50,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:11:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-10-01 23:11:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-01 23:11:50,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:50,187 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 23:11:50,189 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:50,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:50,190 INFO L82 PathProgramCache]: Analyzing trace with hash -13266878, now seen corresponding path program 1 times [2019-10-01 23:11:50,191 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:50,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:50,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:50,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:11:50,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:11:50,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:11:50,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:11:50,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:11:50,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:11:50,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:11:50,265 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2019-10-01 23:11:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:50,333 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2019-10-01 23:11:50,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:11:50,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-01 23:11:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:50,335 INFO L225 Difference]: With dead ends: 50 [2019-10-01 23:11:50,335 INFO L226 Difference]: Without dead ends: 31 [2019-10-01 23:11:50,337 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 23:11:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-01 23:11:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-01 23:11:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 23:11:50,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-01 23:11:50,345 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2019-10-01 23:11:50,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:50,346 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-01 23:11:50,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:11:50,346 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-01 23:11:50,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-01 23:11:50,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:50,348 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] [2019-10-01 23:11:50,348 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:50,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:50,349 INFO L82 PathProgramCache]: Analyzing trace with hash -927642988, now seen corresponding path program 1 times [2019-10-01 23:11:50,349 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:50,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:50,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:50,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:11:50,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:50,444 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 23:11:50,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:50,445 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:11:50,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:11:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:50,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:11:50,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:11:50,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:50,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:11:50,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:11:50,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:11:50,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:11:50,558 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 5 states. [2019-10-01 23:11:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:50,661 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2019-10-01 23:11:50,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:11:50,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-10-01 23:11:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:50,662 INFO L225 Difference]: With dead ends: 59 [2019-10-01 23:11:50,663 INFO L226 Difference]: Without dead ends: 36 [2019-10-01 23:11:50,663 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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 23:11:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-01 23:11:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-01 23:11:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-01 23:11:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-10-01 23:11:50,672 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 26 [2019-10-01 23:11:50,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:50,672 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-10-01 23:11:50,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:11:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-10-01 23:11:50,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-01 23:11:50,676 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:50,676 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:11:50,676 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:50,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:50,677 INFO L82 PathProgramCache]: Analyzing trace with hash -681366654, now seen corresponding path program 2 times [2019-10-01 23:11:50,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:50,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:50,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:50,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:11:50,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 23:11:50,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:50,811 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:11:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:11:50,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:11:50,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:11:50,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:11:50,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:11:50,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:50,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 23:11:50,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:11:50,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:11:50,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:11:50,927 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 6 states. [2019-10-01 23:11:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:51,037 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-10-01 23:11:51,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:11:51,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-10-01 23:11:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:51,039 INFO L225 Difference]: With dead ends: 68 [2019-10-01 23:11:51,039 INFO L226 Difference]: Without dead ends: 41 [2019-10-01 23:11:51,040 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:11:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-01 23:11:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-01 23:11:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-01 23:11:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-10-01 23:11:51,059 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 31 [2019-10-01 23:11:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:51,061 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-10-01 23:11:51,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:11:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-10-01 23:11:51,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-01 23:11:51,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:51,064 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:11:51,065 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:51,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1000479276, now seen corresponding path program 3 times [2019-10-01 23:11:51,066 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:51,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:51,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:51,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:11:51,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-01 23:11:51,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:51,262 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 23:11:51,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:11:51,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:11:51,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:11:51,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:11:51,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-01 23:11:51,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:51,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 23:11:51,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 23:11:51,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 23:11:51,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:11:51,365 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 7 states. [2019-10-01 23:11:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:51,474 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2019-10-01 23:11:51,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 23:11:51,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-10-01 23:11:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:51,476 INFO L225 Difference]: With dead ends: 77 [2019-10-01 23:11:51,476 INFO L226 Difference]: Without dead ends: 46 [2019-10-01 23:11:51,477 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:11:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-01 23:11:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-01 23:11:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-01 23:11:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-10-01 23:11:51,485 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 36 [2019-10-01 23:11:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:51,485 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-10-01 23:11:51,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 23:11:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-10-01 23:11:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-01 23:11:51,487 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:51,487 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:11:51,487 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:51,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:51,488 INFO L82 PathProgramCache]: Analyzing trace with hash 631314114, now seen corresponding path program 4 times [2019-10-01 23:11:51,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:51,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:51,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:51,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:11:51,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-01 23:11:51,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:51,624 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 23:11:51,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:11:51,689 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:11:51,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:11:51,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:11:51,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-01 23:11:51,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:51,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:11:51,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:11:51,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:11:51,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:11:51,737 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 8 states. [2019-10-01 23:11:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:51,858 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2019-10-01 23:11:51,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:11:51,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-10-01 23:11:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:51,864 INFO L225 Difference]: With dead ends: 86 [2019-10-01 23:11:51,864 INFO L226 Difference]: Without dead ends: 51 [2019-10-01 23:11:51,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 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 23:11:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-01 23:11:51,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-01 23:11:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 23:11:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-10-01 23:11:51,882 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 41 [2019-10-01 23:11:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:51,883 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-10-01 23:11:51,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:11:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-10-01 23:11:51,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 23:11:51,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:51,888 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:11:51,888 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:51,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:51,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1809092332, now seen corresponding path program 5 times [2019-10-01 23:11:51,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:51,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:51,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:51,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:11:51,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-01 23:11:51,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:51,996 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:11:52,020 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:11:53,276 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-01 23:11:53,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:11:53,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:11:53,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-01 23:11:53,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:53,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 23:11:53,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:11:53,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:11:53,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:11:53,328 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 9 states. [2019-10-01 23:11:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:53,444 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2019-10-01 23:11:53,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:11:53,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2019-10-01 23:11:53,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:53,449 INFO L225 Difference]: With dead ends: 95 [2019-10-01 23:11:53,449 INFO L226 Difference]: Without dead ends: 56 [2019-10-01 23:11:53,450 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:11:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-01 23:11:53,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-10-01 23:11:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-01 23:11:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2019-10-01 23:11:53,458 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 46 [2019-10-01 23:11:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:53,459 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2019-10-01 23:11:53,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:11:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2019-10-01 23:11:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-01 23:11:53,460 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:53,460 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:11:53,461 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:53,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:53,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2091864578, now seen corresponding path program 6 times [2019-10-01 23:11:53,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:53,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:53,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:53,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:11:53,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-01 23:11:53,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:53,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 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 23:11:53,631 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:11:54,107 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-10-01 23:11:54,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:11:54,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:11:54,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-01 23:11:54,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:54,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 23:11:54,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:11:54,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:11:54,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:11:54,145 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 10 states. [2019-10-01 23:11:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:54,265 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2019-10-01 23:11:54,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:11:54,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-10-01 23:11:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:54,266 INFO L225 Difference]: With dead ends: 104 [2019-10-01 23:11:54,266 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 23:11:54,268 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:11:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 23:11:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-01 23:11:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-01 23:11:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2019-10-01 23:11:54,280 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 51 [2019-10-01 23:11:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:54,282 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2019-10-01 23:11:54,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:11:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2019-10-01 23:11:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 23:11:54,284 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:54,285 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:11:54,285 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:54,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:54,285 INFO L82 PathProgramCache]: Analyzing trace with hash -591532972, now seen corresponding path program 7 times [2019-10-01 23:11:54,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:54,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:54,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:54,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:11:54,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-01 23:11:54,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:54,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 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 23:11:54,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:11:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:54,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:11:54,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-01 23:11:54,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:54,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:11:54,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:11:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:11:54,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:11:54,552 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 11 states. [2019-10-01 23:11:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:54,691 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2019-10-01 23:11:54,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:11:54,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-01 23:11:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:54,693 INFO L225 Difference]: With dead ends: 113 [2019-10-01 23:11:54,693 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 23:11:54,694 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:11:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 23:11:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-01 23:11:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-01 23:11:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2019-10-01 23:11:54,709 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 56 [2019-10-01 23:11:54,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:54,709 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2019-10-01 23:11:54,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:11:54,710 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2019-10-01 23:11:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-01 23:11:54,710 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:54,711 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:11:54,711 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:54,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:54,715 INFO L82 PathProgramCache]: Analyzing trace with hash 642637122, now seen corresponding path program 8 times [2019-10-01 23:11:54,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:54,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:54,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:54,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:11:54,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-01 23:11:54,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:54,847 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:11:54,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:11:54,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:11:54,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:11:54,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:11:54,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:11:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-01 23:11:54,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:11:54,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 23:11:54,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:11:54,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:11:54,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:11:54,946 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 12 states. [2019-10-01 23:11:55,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:11:55,064 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2019-10-01 23:11:55,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:11:55,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-10-01 23:11:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:11:55,066 INFO L225 Difference]: With dead ends: 122 [2019-10-01 23:11:55,066 INFO L226 Difference]: Without dead ends: 71 [2019-10-01 23:11:55,067 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 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 23:11:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-01 23:11:55,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-10-01 23:11:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 23:11:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2019-10-01 23:11:55,082 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 61 [2019-10-01 23:11:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:11:55,083 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2019-10-01 23:11:55,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:11:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2019-10-01 23:11:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-01 23:11:55,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:11:55,085 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:11:55,085 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:11:55,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:11:55,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1682614380, now seen corresponding path program 9 times [2019-10-01 23:11:55,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:11:55,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:11:55,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:55,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:11:55,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:11:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:11:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-01 23:11:55,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:11:55,264 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 23:11:55,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:12:01,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:12:01,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:01,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 23:12:01,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-01 23:12:01,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:01,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 23:12:01,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:12:01,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:12:01,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:12:01,334 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 13 states. [2019-10-01 23:12:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:01,453 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2019-10-01 23:12:01,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 23:12:01,453 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-10-01 23:12:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:01,454 INFO L225 Difference]: With dead ends: 131 [2019-10-01 23:12:01,455 INFO L226 Difference]: Without dead ends: 76 [2019-10-01 23:12:01,459 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 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 23:12:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-01 23:12:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-10-01 23:12:01,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-01 23:12:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2019-10-01 23:12:01,475 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 66 [2019-10-01 23:12:01,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:01,475 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2019-10-01 23:12:01,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:12:01,475 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2019-10-01 23:12:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-01 23:12:01,477 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:01,477 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:12:01,477 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:01,478 INFO L82 PathProgramCache]: Analyzing trace with hash 591181954, now seen corresponding path program 10 times [2019-10-01 23:12:01,478 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:01,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:01,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:01,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:01,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-01 23:12:01,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:01,636 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 23:12:01,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:12:01,737 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:12:01,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:01,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:12:01,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-01 23:12:01,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:01,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:12:01,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:12:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:12:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:12:01,823 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 14 states. [2019-10-01 23:12:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:01,973 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2019-10-01 23:12:01,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:12:01,974 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-10-01 23:12:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:01,975 INFO L225 Difference]: With dead ends: 140 [2019-10-01 23:12:01,975 INFO L226 Difference]: Without dead ends: 81 [2019-10-01 23:12:01,976 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:12:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-01 23:12:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-01 23:12:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 23:12:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2019-10-01 23:12:01,996 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 71 [2019-10-01 23:12:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:01,997 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2019-10-01 23:12:01,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:12:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2019-10-01 23:12:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 23:12:01,998 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:01,999 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:12:01,999 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:01,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:01,999 INFO L82 PathProgramCache]: Analyzing trace with hash 665957076, now seen corresponding path program 11 times [2019-10-01 23:12:02,000 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:02,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:02,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:02,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:02,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:02,226 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-01 23:12:02,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:02,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:12:02,252 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:12:39,960 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-01 23:12:39,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:39,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:12:39,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-01 23:12:40,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:40,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 23:12:40,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:12:40,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:12:40,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:12:40,046 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 15 states. [2019-10-01 23:12:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:40,183 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2019-10-01 23:12:40,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:12:40,185 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2019-10-01 23:12:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:40,186 INFO L225 Difference]: With dead ends: 149 [2019-10-01 23:12:40,186 INFO L226 Difference]: Without dead ends: 86 [2019-10-01 23:12:40,187 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 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 23:12:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-01 23:12:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-10-01 23:12:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-01 23:12:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2019-10-01 23:12:40,202 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 76 [2019-10-01 23:12:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:40,204 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2019-10-01 23:12:40,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:12:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2019-10-01 23:12:40,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-01 23:12:40,205 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:40,205 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:12:40,205 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:40,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:40,206 INFO L82 PathProgramCache]: Analyzing trace with hash 725345218, now seen corresponding path program 12 times [2019-10-01 23:12:40,206 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:40,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:40,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:40,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:40,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-10-01 23:12:40,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:40,380 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 23:12:40,400 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:12:58,237 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 23:12:58,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:58,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:12:58,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 36 proven. 78 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-01 23:12:58,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:58,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2019-10-01 23:12:58,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:12:58,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:12:58,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:12:58,324 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 17 states. [2019-10-01 23:12:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:58,543 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2019-10-01 23:12:58,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:12:58,543 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-10-01 23:12:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:58,544 INFO L225 Difference]: With dead ends: 158 [2019-10-01 23:12:58,545 INFO L226 Difference]: Without dead ends: 91 [2019-10-01 23:12:58,546 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 80 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 23:12:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-01 23:12:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-10-01 23:12:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-01 23:12:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2019-10-01 23:12:58,559 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 81 [2019-10-01 23:12:58,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:58,560 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2019-10-01 23:12:58,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:12:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2019-10-01 23:12:58,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-01 23:12:58,564 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:58,565 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:12:58,565 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash 810745364, now seen corresponding path program 13 times [2019-10-01 23:12:58,565 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:58,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:58,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:58,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:58,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-10-01 23:12:58,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:58,755 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 23:12:58,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:12:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:58,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:12:58,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:12:58,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:58,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:12:58,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:12:58,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:12:58,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:12:58,880 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 17 states. [2019-10-01 23:12:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:59,009 INFO L93 Difference]: Finished difference Result 167 states and 181 transitions. [2019-10-01 23:12:59,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:12:59,012 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-10-01 23:12:59,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:59,013 INFO L225 Difference]: With dead ends: 167 [2019-10-01 23:12:59,013 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 23:12:59,014 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 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 23:12:59,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 23:12:59,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-10-01 23:12:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-01 23:12:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2019-10-01 23:12:59,022 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 86 [2019-10-01 23:12:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:59,023 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2019-10-01 23:12:59,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:12:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2019-10-01 23:12:59,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-01 23:12:59,024 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:59,024 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:12:59,024 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:59,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:59,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1391763710, now seen corresponding path program 14 times [2019-10-01 23:12:59,025 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:59,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:59,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:59,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:12:59,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-10-01 23:12:59,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:59,210 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) [2019-10-01 23:12:59,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:12:59,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:12:59,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:12:59,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:12:59,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:12:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:12:59,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:12:59,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 23:12:59,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:12:59,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:12:59,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:12:59,368 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 18 states. [2019-10-01 23:12:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:12:59,556 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2019-10-01 23:12:59,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:12:59,557 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2019-10-01 23:12:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:12:59,558 INFO L225 Difference]: With dead ends: 176 [2019-10-01 23:12:59,559 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 23:12:59,560 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 91 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 23:12:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 23:12:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-10-01 23:12:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-01 23:12:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2019-10-01 23:12:59,568 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 91 [2019-10-01 23:12:59,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:12:59,568 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2019-10-01 23:12:59,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:12:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2019-10-01 23:12:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 23:12:59,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:12:59,570 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:12:59,570 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:12:59,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:12:59,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1103546028, now seen corresponding path program 15 times [2019-10-01 23:12:59,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:12:59,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:12:59,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:59,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:12:59,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:12:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:12:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-10-01 23:12:59,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:12:59,839 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) [2019-10-01 23:12:59,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:13:26,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:13:26,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:13:26,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 23:13:26,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 30 proven. 120 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-10-01 23:13:26,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:26,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 20 [2019-10-01 23:13:26,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:13:26,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:13:26,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:13:26,912 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 20 states. [2019-10-01 23:13:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:27,122 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2019-10-01 23:13:27,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:13:27,122 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2019-10-01 23:13:27,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:27,124 INFO L225 Difference]: With dead ends: 185 [2019-10-01 23:13:27,124 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 23:13:27,125 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:13:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 23:13:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-10-01 23:13:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-01 23:13:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2019-10-01 23:13:27,131 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 96 [2019-10-01 23:13:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:27,131 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2019-10-01 23:13:27,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:13:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2019-10-01 23:13:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-01 23:13:27,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:27,133 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:13:27,133 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:27,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:27,133 INFO L82 PathProgramCache]: Analyzing trace with hash -831837630, now seen corresponding path program 16 times [2019-10-01 23:13:27,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:27,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:27,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:27,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:13:27,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-01 23:13:27,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:27,339 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 23:13:27,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:13:27,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:13:27,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:13:27,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:13:27,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 544 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 23:13:27,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:27,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:13:27,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:13:27,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:13:27,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:13:27,469 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 20 states. [2019-10-01 23:13:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:27,660 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2019-10-01 23:13:27,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:13:27,662 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 101 [2019-10-01 23:13:27,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:27,663 INFO L225 Difference]: With dead ends: 194 [2019-10-01 23:13:27,663 INFO L226 Difference]: Without dead ends: 111 [2019-10-01 23:13:27,663 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:13:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-01 23:13:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-01 23:13:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 23:13:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2019-10-01 23:13:27,669 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 101 [2019-10-01 23:13:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:27,670 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2019-10-01 23:13:27,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:13:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2019-10-01 23:13:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-01 23:13:27,671 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:27,671 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:13:27,671 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:27,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:27,672 INFO L82 PathProgramCache]: Analyzing trace with hash 855925908, now seen corresponding path program 17 times [2019-10-01 23:13:27,672 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:27,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:27,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:27,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:13:27,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-10-01 23:13:28,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:28,001 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 23:13:28,032 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:14:45,801 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-10-01 23:14:45,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:14:45,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:14:45,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:14:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-10-01 23:14:45,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:14:45,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:14:45,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:14:45,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:14:45,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:14:45,903 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 21 states. [2019-10-01 23:14:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:14:46,074 INFO L93 Difference]: Finished difference Result 203 states and 217 transitions. [2019-10-01 23:14:46,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:14:46,075 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2019-10-01 23:14:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:14:46,076 INFO L225 Difference]: With dead ends: 203 [2019-10-01 23:14:46,076 INFO L226 Difference]: Without dead ends: 116 [2019-10-01 23:14:46,077 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:14:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-01 23:14:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-10-01 23:14:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-01 23:14:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2019-10-01 23:14:46,086 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 106 [2019-10-01 23:14:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:14:46,086 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2019-10-01 23:14:46,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:14:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2019-10-01 23:14:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-01 23:14:46,087 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:14:46,088 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:14:46,088 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:14:46,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:14:46,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1813726594, now seen corresponding path program 18 times [2019-10-01 23:14:46,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:14:46,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:14:46,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:46,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:14:46,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:14:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-01 23:14:46,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:14:46,422 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 23:14:46,442 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:15:41,816 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-10-01 23:15:41,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:15:41,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:15:41,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:15:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-01 23:15:41,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:15:41,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-10-01 23:15:41,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 23:15:41,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 23:15:41,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:15:41,923 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 22 states. [2019-10-01 23:15:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:15:42,132 INFO L93 Difference]: Finished difference Result 212 states and 226 transitions. [2019-10-01 23:15:42,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:15:42,132 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2019-10-01 23:15:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:15:42,133 INFO L225 Difference]: With dead ends: 212 [2019-10-01 23:15:42,134 INFO L226 Difference]: Without dead ends: 121 [2019-10-01 23:15:42,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-10-01 23:15:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-01 23:15:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-10-01 23:15:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-01 23:15:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2019-10-01 23:15:42,142 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 111 [2019-10-01 23:15:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:15:42,142 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2019-10-01 23:15:42,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 23:15:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2019-10-01 23:15:42,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-01 23:15:42,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:15:42,144 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:15:42,144 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:15:42,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:15:42,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1230274516, now seen corresponding path program 19 times [2019-10-01 23:15:42,145 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:15:42,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:15:42,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:42,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:15:42,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:15:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-10-01 23:15:42,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:15:42,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:15:42,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:15:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:15:42,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:15:42,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:15:42,586 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:15:42,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:15:42,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:15:42,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:15:42,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:15:42,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:15:42,601 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 23 states. [2019-10-01 23:15:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:15:42,773 INFO L93 Difference]: Finished difference Result 221 states and 235 transitions. [2019-10-01 23:15:42,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:15:42,774 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 116 [2019-10-01 23:15:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:15:42,775 INFO L225 Difference]: With dead ends: 221 [2019-10-01 23:15:42,775 INFO L226 Difference]: Without dead ends: 126 [2019-10-01 23:15:42,776 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:15:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-01 23:15:42,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-10-01 23:15:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-01 23:15:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2019-10-01 23:15:42,783 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 116 [2019-10-01 23:15:42,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:15:42,783 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2019-10-01 23:15:42,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:15:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2019-10-01 23:15:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-01 23:15:42,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:15:42,784 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:15:42,785 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:15:42,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:15:42,785 INFO L82 PathProgramCache]: Analyzing trace with hash 433828034, now seen corresponding path program 20 times [2019-10-01 23:15:42,785 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:15:42,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:15:42,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:42,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:15:42,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:15:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-01 23:15:43,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:15:43,192 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:15:43,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:15:43,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:15:43,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:15:43,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:15:43,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:15:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-01 23:15:43,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:15:43,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:15:43,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:15:43,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:15:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:15:43,363 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand 24 states. [2019-10-01 23:15:43,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:15:43,593 INFO L93 Difference]: Finished difference Result 230 states and 244 transitions. [2019-10-01 23:15:43,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:15:43,596 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 121 [2019-10-01 23:15:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:15:43,597 INFO L225 Difference]: With dead ends: 230 [2019-10-01 23:15:43,597 INFO L226 Difference]: Without dead ends: 131 [2019-10-01 23:15:43,598 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:15:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-01 23:15:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-10-01 23:15:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-01 23:15:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2019-10-01 23:15:43,606 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 121 [2019-10-01 23:15:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:15:43,606 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2019-10-01 23:15:43,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:15:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2019-10-01 23:15:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 23:15:43,608 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:15:43,608 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:15:43,608 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:15:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:15:43,608 INFO L82 PathProgramCache]: Analyzing trace with hash 348752660, now seen corresponding path program 21 times [2019-10-01 23:15:43,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:15:43,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:15:43,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:43,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:15:43,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:15:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-10-01 23:15:44,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:15:44,067 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:15:44,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:16:55,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:16:55,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:16:55,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:16:55,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:16:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2019-10-01 23:16:55,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:16:55,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:16:55,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:16:55,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:16:55,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:16:55,723 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand 25 states. [2019-10-01 23:16:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:16:55,897 INFO L93 Difference]: Finished difference Result 239 states and 253 transitions. [2019-10-01 23:16:55,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:16:55,898 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 126 [2019-10-01 23:16:55,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:16:55,899 INFO L225 Difference]: With dead ends: 239 [2019-10-01 23:16:55,899 INFO L226 Difference]: Without dead ends: 136 [2019-10-01 23:16:55,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:16:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-01 23:16:55,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-10-01 23:16:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-01 23:16:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2019-10-01 23:16:55,905 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 126 [2019-10-01 23:16:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:16:55,906 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2019-10-01 23:16:55,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:16:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2019-10-01 23:16:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-01 23:16:55,907 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:16:55,907 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:16:55,907 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:16:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:16:55,907 INFO L82 PathProgramCache]: Analyzing trace with hash 577530882, now seen corresponding path program 22 times [2019-10-01 23:16:55,908 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:16:55,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:16:55,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:16:55,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:16:55,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:16:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:16:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-10-01 23:16:56,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:16:56,510 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:16:56,557 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:16:56,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:16:56,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:16:56,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:16:56,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:16:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2019-10-01 23:16:56,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:16:56,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:16:56,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:16:56,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:16:56,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:16:56,738 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 26 states. [2019-10-01 23:16:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:16:57,030 INFO L93 Difference]: Finished difference Result 248 states and 262 transitions. [2019-10-01 23:16:57,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:16:57,031 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 131 [2019-10-01 23:16:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:16:57,032 INFO L225 Difference]: With dead ends: 248 [2019-10-01 23:16:57,033 INFO L226 Difference]: Without dead ends: 141 [2019-10-01 23:16:57,034 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:16:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-01 23:16:57,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-10-01 23:16:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-01 23:16:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2019-10-01 23:16:57,044 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 131 [2019-10-01 23:16:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:16:57,044 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2019-10-01 23:16:57,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:16:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2019-10-01 23:16:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-01 23:16:57,046 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:16:57,046 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:16:57,046 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:16:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:16:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash 33785428, now seen corresponding path program 23 times [2019-10-01 23:16:57,047 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:16:57,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:16:57,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:16:57,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:16:57,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:16:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:16:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-10-01 23:16:57,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:16:57,475 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:16:57,526 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:18:50,983 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-10-01 23:18:50,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:18:51,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:18:51,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:18:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-10-01 23:18:51,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:18:51,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:18:51,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:18:51,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:18:51,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:18:51,175 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 27 states. [2019-10-01 23:18:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:18:51,473 INFO L93 Difference]: Finished difference Result 257 states and 271 transitions. [2019-10-01 23:18:51,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:18:51,479 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 136 [2019-10-01 23:18:51,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:18:51,480 INFO L225 Difference]: With dead ends: 257 [2019-10-01 23:18:51,481 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 23:18:51,482 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:18:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 23:18:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-10-01 23:18:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-01 23:18:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 151 transitions. [2019-10-01 23:18:51,491 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 151 transitions. Word has length 136 [2019-10-01 23:18:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:18:51,492 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 151 transitions. [2019-10-01 23:18:51,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:18:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 151 transitions. [2019-10-01 23:18:51,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-01 23:18:51,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:18:51,494 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:18:51,494 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:18:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:18:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2020772030, now seen corresponding path program 24 times [2019-10-01 23:18:51,495 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:18:51,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:18:51,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:18:51,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:18:51,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:18:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:18:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-10-01 23:18:52,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:18:52,127 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:18:52,180 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:20:21,741 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:20:21,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:20:21,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 23:20:21,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:20:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2019-10-01 23:20:21,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:20:21,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-10-01 23:20:21,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-01 23:20:21,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-01 23:20:21,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:20:21,841 INFO L87 Difference]: Start difference. First operand 146 states and 151 transitions. Second operand 28 states. [2019-10-01 23:20:22,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:20:22,105 INFO L93 Difference]: Finished difference Result 266 states and 280 transitions. [2019-10-01 23:20:22,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 23:20:22,105 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 141 [2019-10-01 23:20:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:20:22,107 INFO L225 Difference]: With dead ends: 266 [2019-10-01 23:20:22,107 INFO L226 Difference]: Without dead ends: 151 [2019-10-01 23:20:22,108 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-10-01 23:20:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-01 23:20:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-10-01 23:20:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-01 23:20:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 156 transitions. [2019-10-01 23:20:22,116 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 156 transitions. Word has length 141 [2019-10-01 23:20:22,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:20:22,116 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 156 transitions. [2019-10-01 23:20:22,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-01 23:20:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 156 transitions. [2019-10-01 23:20:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 23:20:22,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:20:22,118 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:20:22,118 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:20:22,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:20:22,118 INFO L82 PathProgramCache]: Analyzing trace with hash -693997164, now seen corresponding path program 25 times [2019-10-01 23:20:22,118 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:20:22,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:20:22,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:20:22,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:20:22,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:20:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:20:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-10-01 23:20:22,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:20:22,584 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:20:22,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:20:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:20:22,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:20:22,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:20:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2019-10-01 23:20:22,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:20:22,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:20:22,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:20:22,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:20:22,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:20:22,745 INFO L87 Difference]: Start difference. First operand 151 states and 156 transitions. Second operand 29 states. [2019-10-01 23:20:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:20:23,032 INFO L93 Difference]: Finished difference Result 275 states and 289 transitions. [2019-10-01 23:20:23,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:20:23,033 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 146 [2019-10-01 23:20:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:20:23,034 INFO L225 Difference]: With dead ends: 275 [2019-10-01 23:20:23,034 INFO L226 Difference]: Without dead ends: 156 [2019-10-01 23:20:23,035 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:20:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-01 23:20:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-10-01 23:20:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-01 23:20:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 161 transitions. [2019-10-01 23:20:23,042 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 161 transitions. Word has length 146 [2019-10-01 23:20:23,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:20:23,042 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 161 transitions. [2019-10-01 23:20:23,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:20:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 161 transitions. [2019-10-01 23:20:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-01 23:20:23,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:20:23,043 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:20:23,044 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:20:23,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:20:23,044 INFO L82 PathProgramCache]: Analyzing trace with hash 33477250, now seen corresponding path program 26 times [2019-10-01 23:20:23,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:20:23,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:20:23,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:20:23,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:20:23,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:20:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:20:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-10-01 23:20:23,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:20:23,539 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:20:23,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:20:23,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:20:23,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:20:23,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:20:23,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:20:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-10-01 23:20:23,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:20:23,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:20:23,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:20:23,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:20:23,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:20:23,705 INFO L87 Difference]: Start difference. First operand 156 states and 161 transitions. Second operand 30 states. [2019-10-01 23:20:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:20:24,025 INFO L93 Difference]: Finished difference Result 284 states and 298 transitions. [2019-10-01 23:20:24,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:20:24,026 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 151 [2019-10-01 23:20:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:20:24,028 INFO L225 Difference]: With dead ends: 284 [2019-10-01 23:20:24,028 INFO L226 Difference]: Without dead ends: 161 [2019-10-01 23:20:24,029 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:20:24,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-01 23:20:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-10-01 23:20:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-01 23:20:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 166 transitions. [2019-10-01 23:20:24,039 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 166 transitions. Word has length 151 [2019-10-01 23:20:24,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:20:24,039 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 166 transitions. [2019-10-01 23:20:24,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:20:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 166 transitions. [2019-10-01 23:20:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-01 23:20:24,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:20:24,042 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:20:24,042 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:20:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:20:24,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1320792876, now seen corresponding path program 27 times [2019-10-01 23:20:24,043 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:20:24,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:20:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:20:24,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:20:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:20:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:20:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-10-01 23:20:24,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:20:24,632 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:20:24,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:21:51,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:21:51,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:21:51,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:21:51,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:21:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-10-01 23:21:51,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:21:51,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:21:51,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:21:51,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:21:51,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:21:51,521 INFO L87 Difference]: Start difference. First operand 161 states and 166 transitions. Second operand 31 states. [2019-10-01 23:21:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:21:51,859 INFO L93 Difference]: Finished difference Result 293 states and 307 transitions. [2019-10-01 23:21:51,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:21:51,859 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 156 [2019-10-01 23:21:51,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:21:51,860 INFO L225 Difference]: With dead ends: 293 [2019-10-01 23:21:51,860 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 23:21:51,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 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 23:21:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 23:21:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-10-01 23:21:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-01 23:21:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 171 transitions. [2019-10-01 23:21:51,877 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 171 transitions. Word has length 156 [2019-10-01 23:21:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:21:51,877 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 171 transitions. [2019-10-01 23:21:51,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:21:51,878 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 171 transitions. [2019-10-01 23:21:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-01 23:21:51,879 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:21:51,880 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:21:51,880 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:21:51,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:21:51,881 INFO L82 PathProgramCache]: Analyzing trace with hash 25198018, now seen corresponding path program 28 times [2019-10-01 23:21:51,881 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:21:51,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:21:51,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:51,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:21:51,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:21:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-10-01 23:21:52,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:21:52,750 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:21:52,809 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:21:52,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:21:52,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:21:52,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:21:52,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:21:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2019-10-01 23:21:53,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:21:53,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:21:53,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:21:53,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:21:53,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:21:53,026 INFO L87 Difference]: Start difference. First operand 166 states and 171 transitions. Second operand 32 states. [2019-10-01 23:21:53,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:21:53,403 INFO L93 Difference]: Finished difference Result 302 states and 316 transitions. [2019-10-01 23:21:53,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:21:53,404 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 161 [2019-10-01 23:21:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:21:53,405 INFO L225 Difference]: With dead ends: 302 [2019-10-01 23:21:53,405 INFO L226 Difference]: Without dead ends: 171 [2019-10-01 23:21:53,408 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 161 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 23:21:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-01 23:21:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-10-01 23:21:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 23:21:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 176 transitions. [2019-10-01 23:21:53,417 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 176 transitions. Word has length 161 [2019-10-01 23:21:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:21:53,418 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 176 transitions. [2019-10-01 23:21:53,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:21:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 176 transitions. [2019-10-01 23:21:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-01 23:21:53,420 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:21:53,420 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:21:53,421 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:21:53,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:21:53,421 INFO L82 PathProgramCache]: Analyzing trace with hash 160372756, now seen corresponding path program 29 times [2019-10-01 23:21:53,421 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:21:53,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:21:53,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:53,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:21:53,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:21:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2175 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-10-01 23:21:54,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:21:54,002 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:21:54,048 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:24:20,581 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-10-01 23:24:20,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:24:20,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:24:20,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:24:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2175 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-10-01 23:24:20,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:24:20,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:24:20,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:24:20,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:24:20,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:24:20,726 INFO L87 Difference]: Start difference. First operand 171 states and 176 transitions. Second operand 33 states. [2019-10-01 23:24:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:24:21,026 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2019-10-01 23:24:21,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:24:21,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 166 [2019-10-01 23:24:21,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:24:21,028 INFO L225 Difference]: With dead ends: 311 [2019-10-01 23:24:21,029 INFO L226 Difference]: Without dead ends: 176 [2019-10-01 23:24:21,030 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 166 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 23:24:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-01 23:24:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-10-01 23:24:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-10-01 23:24:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 181 transitions. [2019-10-01 23:24:21,041 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 181 transitions. Word has length 166 [2019-10-01 23:24:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:24:21,041 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 181 transitions. [2019-10-01 23:24:21,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:24:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 181 transitions. [2019-10-01 23:24:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-01 23:24:21,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:24:21,043 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:24:21,044 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:24:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:24:21,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1395492606, now seen corresponding path program 30 times [2019-10-01 23:24:21,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:24:21,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:24:21,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:24:21,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:24:21,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:24:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:24:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-10-01 23:24:21,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:24:21,885 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:24:21,920 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE