java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/mapavg2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 21:46:30,166 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 21:46:30,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 21:46:30,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 21:46:30,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 21:46:30,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 21:46:30,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 21:46:30,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 21:46:30,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 21:46:30,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 21:46:30,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 21:46:30,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 21:46:30,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 21:46:30,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 21:46:30,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 21:46:30,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 21:46:30,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 21:46:30,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 21:46:30,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 21:46:30,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 21:46:30,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 21:46:30,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 21:46:30,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 21:46:30,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 21:46:30,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 21:46:30,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 21:46:30,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 21:46:30,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 21:46:30,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 21:46:30,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 21:46:30,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 21:46:30,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 21:46:30,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 21:46:30,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 21:46:30,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 21:46:30,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 21:46:30,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 21:46:30,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 21:46:30,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 21:46:30,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 21:46:30,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 21:46:30,214 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 21:46:30,228 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 21:46:30,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 21:46:30,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 21:46:30,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 21:46:30,233 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 21:46:30,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 21:46:30,234 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 21:46:30,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 21:46:30,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 21:46:30,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 21:46:30,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 21:46:30,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 21:46:30,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 21:46:30,235 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 21:46:30,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 21:46:30,236 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 21:46:30,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 21:46:30,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 21:46:30,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 21:46:30,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 21:46:30,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 21:46:30,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 21:46:30,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 21:46:30,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 21:46:30,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 21:46:30,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 21:46:30,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 21:46:30,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 21:46:30,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 21:46:30,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 21:46:30,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 21:46:30,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 21:46:30,296 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 21:46:30,296 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 21:46:30,297 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapavg2.i [2019-10-01 21:46:30,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c602024/48c8d66fef5e4412b6bfa11524413826/FLAGa6f5f4370 [2019-10-01 21:46:30,814 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 21:46:30,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapavg2.i [2019-10-01 21:46:30,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c602024/48c8d66fef5e4412b6bfa11524413826/FLAGa6f5f4370 [2019-10-01 21:46:31,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c602024/48c8d66fef5e4412b6bfa11524413826 [2019-10-01 21:46:31,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 21:46:31,191 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 21:46:31,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 21:46:31,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 21:46:31,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 21:46:31,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ba2018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31, skipping insertion in model container [2019-10-01 21:46:31,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,207 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 21:46:31,223 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 21:46:31,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 21:46:31,391 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 21:46:31,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 21:46:31,432 INFO L192 MainTranslator]: Completed translation [2019-10-01 21:46:31,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31 WrapperNode [2019-10-01 21:46:31,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 21:46:31,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 21:46:31,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 21:46:31,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 21:46:31,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (1/1) ... [2019-10-01 21:46:31,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 21:46:31,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 21:46:31,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 21:46:31,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 21:46:31,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (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 21:46:31,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 21:46:31,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 21:46:31,643 INFO L138 BoogieDeclarations]: Found implementation of procedure mapavg [2019-10-01 21:46:31,643 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 21:46:31,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 21:46:31,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 21:46:31,643 INFO L130 BoogieDeclarations]: Found specification of procedure mapavg [2019-10-01 21:46:31,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 21:46:31,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 21:46:31,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 21:46:31,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 21:46:31,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 21:46:31,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 21:46:31,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 21:46:31,971 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 21:46:31,971 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 21:46:31,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 09:46:31 BoogieIcfgContainer [2019-10-01 21:46:31,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 21:46:31,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 21:46:31,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 21:46:31,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 21:46:31,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 09:46:31" (1/3) ... [2019-10-01 21:46:31,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8e6e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 09:46:31, skipping insertion in model container [2019-10-01 21:46:31,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 09:46:31" (2/3) ... [2019-10-01 21:46:31,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8e6e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 09:46:31, skipping insertion in model container [2019-10-01 21:46:31,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 09:46:31" (3/3) ... [2019-10-01 21:46:31,981 INFO L109 eAbstractionObserver]: Analyzing ICFG mapavg2.i [2019-10-01 21:46:31,988 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 21:46:31,994 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 21:46:32,015 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 21:46:32,044 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 21:46:32,045 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 21:46:32,045 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 21:46:32,045 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 21:46:32,045 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 21:46:32,045 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 21:46:32,046 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 21:46:32,046 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 21:46:32,046 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 21:46:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 21:46:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 21:46:32,067 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,068 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:32,070 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1234592251, now seen corresponding path program 1 times [2019-10-01 21:46:32,076 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 21:46:32,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:32,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 21:46:32,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 21:46:32,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 21:46:32,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 21:46:32,264 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 21:46:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,296 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-01 21:46:32,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 21:46:32,297 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-01 21:46:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,310 INFO L225 Difference]: With dead ends: 54 [2019-10-01 21:46:32,310 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 21:46:32,315 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 21:46:32,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 21:46:32,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 21:46:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 21:46:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-01 21:46:32,358 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-10-01 21:46:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,359 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-01 21:46:32,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 21:46:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-01 21:46:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 21:46:32,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,362 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:32,362 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1054720325, now seen corresponding path program 1 times [2019-10-01 21:46:32,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 21:46:32,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:32,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 21:46:32,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 21:46:32,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 21:46:32,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:32,469 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-10-01 21:46:32,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,525 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 21:46:32,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:32,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-01 21:46:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,527 INFO L225 Difference]: With dead ends: 46 [2019-10-01 21:46:32,527 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 21:46:32,528 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 21:46:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 21:46:32,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 21:46:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 21:46:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-01 21:46:32,536 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-01 21:46:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,536 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-01 21:46:32,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 21:46:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-01 21:46:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 21:46:32,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,538 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:32,539 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1286970653, now seen corresponding path program 1 times [2019-10-01 21:46:32,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 21:46:32,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:32,619 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 21:46:32,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-01 21:46:32,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 21:46:32,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 21:46:32,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-01 21:46:32,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 21:46:32,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 21:46:32,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 21:46:32,787 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-01 21:46:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,831 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 21:46:32,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:32,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-01 21:46:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,834 INFO L225 Difference]: With dead ends: 46 [2019-10-01 21:46:32,834 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 21:46:32,836 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 21:46:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 21:46:32,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 21:46:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 21:46:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 21:46:32,845 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-10-01 21:46:32,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,845 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 21:46:32,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 21:46:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 21:46:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 21:46:32,848 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,848 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:32,849 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,851 INFO L82 PathProgramCache]: Analyzing trace with hash -631694085, now seen corresponding path program 1 times [2019-10-01 21:46:32,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:32,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 21:46:32,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 21:46:32,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 21:46:32,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 21:46:32,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 21:46:32,953 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-01 21:46:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:32,971 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-01 21:46:32,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 21:46:32,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-01 21:46:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:32,973 INFO L225 Difference]: With dead ends: 43 [2019-10-01 21:46:32,973 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 21:46:32,974 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 21:46:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 21:46:32,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-01 21:46:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 21:46:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-01 21:46:32,985 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-10-01 21:46:32,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:32,988 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-01 21:46:32,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 21:46:32,988 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-01 21:46:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 21:46:32,991 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:32,991 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:32,991 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:32,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:32,992 INFO L82 PathProgramCache]: Analyzing trace with hash -490156423, now seen corresponding path program 1 times [2019-10-01 21:46:32,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:32,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:32,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:32,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:32,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,090 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:33,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:33,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 21:46:33,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 21:46:33,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 21:46:33,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 21:46:33,220 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-01 21:46:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,277 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-01 21:46:33,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 21:46:33,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-01 21:46:33,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,281 INFO L225 Difference]: With dead ends: 52 [2019-10-01 21:46:33,281 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 21:46:33,281 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 21:46:33,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 21:46:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-01 21:46:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 21:46:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-01 21:46:33,293 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-10-01 21:46:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,293 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-01 21:46:33,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 21:46:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-01 21:46:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 21:46:33,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,295 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:33,295 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1271601755, now seen corresponding path program 2 times [2019-10-01 21:46:33,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:33,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,398 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 21:46:33,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:33,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:33,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:33,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,500 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:33,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 21:46:33,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 21:46:33,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 21:46:33,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 21:46:33,509 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-01 21:46:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,534 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-01 21:46:33,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 21:46:33,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-01 21:46:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,535 INFO L225 Difference]: With dead ends: 54 [2019-10-01 21:46:33,535 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 21:46:33,536 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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 21:46:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 21:46:33,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-01 21:46:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 21:46:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-01 21:46:33,542 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2019-10-01 21:46:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,542 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-01 21:46:33,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 21:46:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-01 21:46:33,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 21:46:33,545 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,545 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:33,546 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2104096189, now seen corresponding path program 3 times [2019-10-01 21:46:33,546 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:33,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 21:46:33,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,682 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 21:46:33,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:33,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 21:46:33,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:33,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:33,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 21:46:33,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:33,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 21:46:33,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 21:46:33,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 21:46:33,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:33,782 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-01 21:46:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:33,850 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-01 21:46:33,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 21:46:33,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-01 21:46:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:33,852 INFO L225 Difference]: With dead ends: 59 [2019-10-01 21:46:33,852 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 21:46:33,855 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:33,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 21:46:33,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 21:46:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 21:46:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-01 21:46:33,863 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2019-10-01 21:46:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:33,863 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-01 21:46:33,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 21:46:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-01 21:46:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 21:46:33,864 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:33,865 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:33,865 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:33,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:33,865 INFO L82 PathProgramCache]: Analyzing trace with hash 780809725, now seen corresponding path program 4 times [2019-10-01 21:46:33,865 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:33,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:33,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:33,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 21:46:33,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:33,936 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:33,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:34,011 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:34,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,035 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 21:46:34,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 21:46:34,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 21:46:34,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 21:46:34,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 21:46:34,052 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-10-01 21:46:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,099 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 21:46:34,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 21:46:34,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-01 21:46:34,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,103 INFO L225 Difference]: With dead ends: 62 [2019-10-01 21:46:34,103 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 21:46:34,104 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 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 21:46:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 21:46:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 21:46:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 21:46:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-01 21:46:34,110 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2019-10-01 21:46:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,110 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-01 21:46:34,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 21:46:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-01 21:46:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 21:46:34,111 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,112 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:34,112 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,112 INFO L82 PathProgramCache]: Analyzing trace with hash 387956447, now seen corresponding path program 5 times [2019-10-01 21:46:34,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 21:46:34,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,198 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 21:46:34,223 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:34,276 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 21:46:34,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-01 21:46:34,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 21:46:34,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:34,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:34,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,337 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-10-01 21:46:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,396 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-10-01 21:46:34,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:34,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-01 21:46:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,398 INFO L225 Difference]: With dead ends: 67 [2019-10-01 21:46:34,398 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 21:46:34,399 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 21:46:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-01 21:46:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 21:46:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-01 21:46:34,404 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2019-10-01 21:46:34,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,405 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-01 21:46:34,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-01 21:46:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 21:46:34,406 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,406 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:34,406 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,407 INFO L82 PathProgramCache]: Analyzing trace with hash -482079969, now seen corresponding path program 6 times [2019-10-01 21:46:34,407 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-01 21:46:34,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,516 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 21:46:34,538 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:34,585 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 21:46:34,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:34,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:34,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-01 21:46:34,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:34,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:34,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,633 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2019-10-01 21:46:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,703 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-10-01 21:46:34,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:34,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-01 21:46:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,705 INFO L225 Difference]: With dead ends: 73 [2019-10-01 21:46:34,705 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 21:46:34,706 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 21:46:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 21:46:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 21:46:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-01 21:46:34,719 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2019-10-01 21:46:34,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,720 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-01 21:46:34,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:34,720 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-01 21:46:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 21:46:34,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,722 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:34,723 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1276959103, now seen corresponding path program 7 times [2019-10-01 21:46:34,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:34,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:34,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:34,852 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 21:46:34,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:34,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:34,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:34,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:34,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 21:46:34,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 21:46:34,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 21:46:34,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 21:46:34,940 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2019-10-01 21:46:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:34,987 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-01 21:46:34,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 21:46:34,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-01 21:46:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:34,989 INFO L225 Difference]: With dead ends: 76 [2019-10-01 21:46:34,989 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 21:46:34,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 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 21:46:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 21:46:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-01 21:46:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 21:46:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-01 21:46:34,995 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2019-10-01 21:46:34,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:34,995 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-01 21:46:34,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 21:46:34,996 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-01 21:46:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 21:46:34,997 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:34,997 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:34,997 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash -266850591, now seen corresponding path program 8 times [2019-10-01 21:46:34,998 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:34,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:34,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:34,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:34,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,125 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 21:46:35,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:35,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:35,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:35,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:35,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 21:46:35,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 21:46:35,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 21:46:35,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 21:46:35,231 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2019-10-01 21:46:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,287 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-01 21:46:35,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 21:46:35,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-10-01 21:46:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,289 INFO L225 Difference]: With dead ends: 78 [2019-10-01 21:46:35,289 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 21:46:35,290 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 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 21:46:35,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 21:46:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-01 21:46:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 21:46:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-01 21:46:35,295 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2019-10-01 21:46:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,296 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-01 21:46:35,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 21:46:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-01 21:46:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 21:46:35,297 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,297 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:35,297 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2104249405, now seen corresponding path program 9 times [2019-10-01 21:46:35,298 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:35,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 21:46:35,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,415 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 21:46:35,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:35,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 21:46:35,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:35,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-01 21:46:35,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:35,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-01 21:46:35,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 21:46:35,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 21:46:35,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 21:46:35,535 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2019-10-01 21:46:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,601 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-01 21:46:35,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 21:46:35,602 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 21:46:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,602 INFO L225 Difference]: With dead ends: 83 [2019-10-01 21:46:35,602 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 21:46:35,603 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 21:46:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 21:46:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-01 21:46:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 21:46:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-01 21:46:35,609 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2019-10-01 21:46:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,609 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-01 21:46:35,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 21:46:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-01 21:46:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 21:46:35,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,610 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:35,610 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1485183197, now seen corresponding path program 10 times [2019-10-01 21:46:35,611 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:35,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-01 21:46:35,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:35,734 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 21:46:35,756 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:35,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:35,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:35,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 21:46:35,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Stream closed [2019-10-01 21:46:35,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:35,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-01 21:46:35,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 21:46:35,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 21:46:35,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:35,861 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2019-10-01 21:46:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:35,938 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-01 21:46:35,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 21:46:35,939 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-01 21:46:35,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:35,940 INFO L225 Difference]: With dead ends: 89 [2019-10-01 21:46:35,940 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 21:46:35,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 21:46:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-01 21:46:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 21:46:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-01 21:46:35,946 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2019-10-01 21:46:35,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:35,947 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-01 21:46:35,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 21:46:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-01 21:46:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 21:46:35,948 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:35,948 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:35,948 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:35,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1828841827, now seen corresponding path program 11 times [2019-10-01 21:46:35,949 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:35,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:35,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:35,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-01 21:46:36,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:36,112 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 21:46:36,138 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:36,273 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 21:46:36,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:36,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:36,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-01 21:46:36,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:36,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-01 21:46:36,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 21:46:36,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 21:46:36,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:36,358 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2019-10-01 21:46:36,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:36,426 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-01 21:46:36,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:36,426 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-10-01 21:46:36,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:36,427 INFO L225 Difference]: With dead ends: 95 [2019-10-01 21:46:36,427 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 21:46:36,428 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 21:46:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-01 21:46:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 21:46:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-01 21:46:36,434 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2019-10-01 21:46:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:36,434 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-01 21:46:36,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 21:46:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-01 21:46:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 21:46:36,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:36,435 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:36,436 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:36,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:36,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1538721373, now seen corresponding path program 12 times [2019-10-01 21:46:36,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:36,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:36,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:36,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-01 21:46:36,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:36,603 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 21:46:36,627 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:36,826 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 21:46:36,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:36,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 21:46:36,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-10-01 21:46:36,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:36,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-01 21:46:36,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 21:46:36,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 21:46:36,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:36,899 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2019-10-01 21:46:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:36,986 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-10-01 21:46:36,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:36,987 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 21:46:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:36,988 INFO L225 Difference]: With dead ends: 101 [2019-10-01 21:46:36,988 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 21:46:36,989 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 21:46:36,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 21:46:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 21:46:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 21:46:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-01 21:46:36,994 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2019-10-01 21:46:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:36,994 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-01 21:46:36,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 21:46:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-01 21:46:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 21:46:36,995 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:36,995 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:36,996 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:36,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash 713900035, now seen corresponding path program 13 times [2019-10-01 21:46:36,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:36,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:36,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:36,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:36,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:37,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:37,193 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:37,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:46:37,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:37,339 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 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 21:46:37,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:37,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 21:46:37,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 21:46:37,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 21:46:37,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 21:46:37,344 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2019-10-01 21:46:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:37,410 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-10-01 21:46:37,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 21:46:37,412 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-01 21:46:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:37,413 INFO L225 Difference]: With dead ends: 104 [2019-10-01 21:46:37,413 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 21:46:37,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 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 21:46:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 21:46:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-01 21:46:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 21:46:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-01 21:46:37,419 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2019-10-01 21:46:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:37,421 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-01 21:46:37,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 21:46:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-01 21:46:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 21:46:37,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:37,423 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:37,423 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:37,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:37,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1350791579, now seen corresponding path program 14 times [2019-10-01 21:46:37,424 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:37,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:37,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:37,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:37,635 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:37,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:37,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:37,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:37,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:46:37,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:37,766 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:37,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:37,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 21:46:37,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 21:46:37,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 21:46:37,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 21:46:37,774 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2019-10-01 21:46:37,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:37,850 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-10-01 21:46:37,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 21:46:37,850 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-10-01 21:46:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:37,851 INFO L225 Difference]: With dead ends: 106 [2019-10-01 21:46:37,851 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 21:46:37,852 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 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 21:46:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 21:46:37,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-01 21:46:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 21:46:37,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-01 21:46:37,864 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2019-10-01 21:46:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:37,865 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-01 21:46:37,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 21:46:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-01 21:46:37,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-01 21:46:37,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:37,867 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:37,867 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:37,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:37,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1244541881, now seen corresponding path program 15 times [2019-10-01 21:46:37,868 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:37,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:37,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:37,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 21:46:38,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:38,093 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) [2019-10-01 21:46:38,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:38,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 21:46:38,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:38,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 21:46:38,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-10-01 21:46:38,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:38,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-01 21:46:38,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 21:46:38,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 21:46:38,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:38,275 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2019-10-01 21:46:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:38,381 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-01 21:46:38,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 21:46:38,382 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2019-10-01 21:46:38,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:38,383 INFO L225 Difference]: With dead ends: 111 [2019-10-01 21:46:38,383 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 21:46:38,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:38,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 21:46:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-01 21:46:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 21:46:38,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-01 21:46:38,404 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2019-10-01 21:46:38,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:38,404 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-01 21:46:38,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 21:46:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-01 21:46:38,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 21:46:38,406 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:38,406 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:38,406 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:38,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:38,406 INFO L82 PathProgramCache]: Analyzing trace with hash -261735289, now seen corresponding path program 16 times [2019-10-01 21:46:38,407 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:38,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:38,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:38,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:38,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:38,622 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 21:46:38,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:38,737 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:38,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:38,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:46:38,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:38,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:38,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 21:46:38,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 21:46:38,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 21:46:38,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 21:46:38,789 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-10-01 21:46:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:38,861 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-10-01 21:46:38,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 21:46:38,862 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-01 21:46:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:38,863 INFO L225 Difference]: With dead ends: 114 [2019-10-01 21:46:38,863 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 21:46:38,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 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 21:46:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 21:46:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 21:46:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 21:46:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-01 21:46:38,870 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2019-10-01 21:46:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:38,870 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-01 21:46:38,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 21:46:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-01 21:46:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 21:46:38,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:38,872 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:38,873 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:38,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:38,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1057421335, now seen corresponding path program 17 times [2019-10-01 21:46:38,873 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:38,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:38,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:38,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 21:46:39,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:39,135 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 21:46:39,169 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:39,701 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 21:46:39,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:39,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 21:46:39,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2019-10-01 21:46:39,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:39,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-01 21:46:39,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 21:46:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 21:46:39,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 21:46:39,853 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2019-10-01 21:46:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:39,975 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-01 21:46:39,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 21:46:39,976 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-10-01 21:46:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:39,977 INFO L225 Difference]: With dead ends: 119 [2019-10-01 21:46:39,977 INFO L226 Difference]: Without dead ends: 83 [2019-10-01 21:46:39,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 21:46:39,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-01 21:46:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-01 21:46:39,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 21:46:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-01 21:46:39,982 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2019-10-01 21:46:39,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:39,982 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-01 21:46:39,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 21:46:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-01 21:46:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 21:46:39,984 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:39,984 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:39,984 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:39,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:39,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1308787753, now seen corresponding path program 18 times [2019-10-01 21:46:39,985 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:39,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:39,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:39,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:39,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-10-01 21:46:40,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:40,271 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 21:46:40,298 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:40,556 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 21:46:40,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:40,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 21:46:40,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 234 proven. 16 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-10-01 21:46:40,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:40,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2019-10-01 21:46:40,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 21:46:40,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 21:46:40,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:40,666 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2019-10-01 21:46:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:40,774 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-10-01 21:46:40,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 21:46:40,777 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2019-10-01 21:46:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:40,777 INFO L225 Difference]: With dead ends: 125 [2019-10-01 21:46:40,778 INFO L226 Difference]: Without dead ends: 87 [2019-10-01 21:46:40,778 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-01 21:46:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-01 21:46:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 21:46:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-01 21:46:40,783 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2019-10-01 21:46:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:40,783 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-01 21:46:40,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 21:46:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-01 21:46:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 21:46:40,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:40,785 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 19, 19, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:40,785 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:40,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:40,785 INFO L82 PathProgramCache]: Analyzing trace with hash -242984311, now seen corresponding path program 19 times [2019-10-01 21:46:40,785 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:40,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:40,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:40,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:41,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:41,091 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 21:46:41,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 21:46:41,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:41,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:41,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 21:46:41,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 21:46:41,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 21:46:41,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 21:46:41,233 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2019-10-01 21:46:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:41,297 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-10-01 21:46:41,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 21:46:41,298 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2019-10-01 21:46:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:41,298 INFO L225 Difference]: With dead ends: 128 [2019-10-01 21:46:41,298 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 21:46:41,299 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 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 21:46:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 21:46:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-01 21:46:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 21:46:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-01 21:46:41,303 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2019-10-01 21:46:41,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:41,303 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-01 21:46:41,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 21:46:41,304 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-01 21:46:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 21:46:41,305 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:41,305 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:41,305 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:41,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:41,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1110011285, now seen corresponding path program 20 times [2019-10-01 21:46:41,306 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:41,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:41,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:41,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:41,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:41,599 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 21:46:41,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:41,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:41,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:41,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 21:46:41,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:41,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:41,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 21:46:41,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 21:46:41,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 21:46:41,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:41,742 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2019-10-01 21:46:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:41,805 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-10-01 21:46:41,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 21:46:41,806 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2019-10-01 21:46:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:41,807 INFO L225 Difference]: With dead ends: 130 [2019-10-01 21:46:41,807 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 21:46:41,807 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 21:46:41,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 21:46:41,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-01 21:46:41,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 21:46:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-01 21:46:41,811 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2019-10-01 21:46:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:41,811 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-01 21:46:41,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 21:46:41,811 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-01 21:46:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 21:46:41,812 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:41,813 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:41,813 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:41,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:41,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1099277875, now seen corresponding path program 21 times [2019-10-01 21:46:41,813 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:41,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:41,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:41,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 21:46:42,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:42,128 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 21:46:42,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:42,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 21:46:42,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:42,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:46:42,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2019-10-01 21:46:42,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:42,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2019-10-01 21:46:42,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 21:46:42,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 21:46:42,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:42,348 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2019-10-01 21:46:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:42,478 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-10-01 21:46:42,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 21:46:42,478 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2019-10-01 21:46:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:42,479 INFO L225 Difference]: With dead ends: 135 [2019-10-01 21:46:42,479 INFO L226 Difference]: Without dead ends: 95 [2019-10-01 21:46:42,481 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-01 21:46:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-10-01 21:46:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 21:46:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-10-01 21:46:42,486 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2019-10-01 21:46:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:42,486 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-10-01 21:46:42,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 21:46:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-10-01 21:46:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-01 21:46:42,487 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:42,488 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:42,488 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:42,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:42,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1514657069, now seen corresponding path program 22 times [2019-10-01 21:46:42,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:42,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:42,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:42,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:43,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:43,023 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 21:46:43,050 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:43,124 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:43,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:43,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 21:46:43,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:43,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:43,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 21:46:43,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 21:46:43,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 21:46:43,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 21:46:43,178 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2019-10-01 21:46:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:43,266 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-10-01 21:46:43,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 21:46:43,267 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2019-10-01 21:46:43,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:43,268 INFO L225 Difference]: With dead ends: 138 [2019-10-01 21:46:43,268 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 21:46:43,269 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 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 21:46:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 21:46:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-01 21:46:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 21:46:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-01 21:46:43,274 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2019-10-01 21:46:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:43,275 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-01 21:46:43,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 21:46:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-01 21:46:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 21:46:43,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:43,276 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:43,276 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:43,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1289554703, now seen corresponding path program 23 times [2019-10-01 21:46:43,276 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:43,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:43,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:43,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 21:46:43,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:43,615 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 21:46:43,646 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:44,585 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-01 21:46:44,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:44,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 21:46:44,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (25)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:46:44,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:44,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2019-10-01 21:46:44,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 21:46:44,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 21:46:44,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:44,749 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2019-10-01 21:46:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:44,920 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-10-01 21:46:44,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 21:46:44,921 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2019-10-01 21:46:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:44,922 INFO L225 Difference]: With dead ends: 143 [2019-10-01 21:46:44,922 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 21:46:44,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 21:46:44,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 21:46:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-10-01 21:46:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 21:46:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-10-01 21:46:44,930 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2019-10-01 21:46:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:44,931 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-10-01 21:46:44,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 21:46:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-10-01 21:46:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-01 21:46:44,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:44,937 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:44,937 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:44,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:44,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1283933361, now seen corresponding path program 24 times [2019-10-01 21:46:44,938 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:44,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:44,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:44,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:44,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 21:46:45,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:45,306 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 21:46:45,335 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:45,776 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 21:46:45,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:45,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 21:46:45,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 345 proven. 36 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Stream closed [2019-10-01 21:46:46,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:46,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11] total 36 [2019-10-01 21:46:46,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 21:46:46,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 21:46:46,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=819, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 21:46:46,071 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 36 states. [2019-10-01 21:46:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:46,348 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2019-10-01 21:46:46,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 21:46:46,349 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 140 [2019-10-01 21:46:46,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:46,350 INFO L225 Difference]: With dead ends: 150 [2019-10-01 21:46:46,350 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 21:46:46,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=511, Invalid=1295, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 21:46:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 21:46:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-10-01 21:46:46,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-01 21:46:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-01 21:46:46,356 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 140 [2019-10-01 21:46:46,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:46,356 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-01 21:46:46,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 21:46:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-01 21:46:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 21:46:46,357 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:46,357 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:46,358 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:46,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:46,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1736133359, now seen corresponding path program 25 times [2019-10-01 21:46:46,358 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:46,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:46,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:46,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:46,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:46,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:46,792 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 21:46:46,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:46,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 21:46:46,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (27)] Exception during sending of exit command (exit): Stream closed [2019-10-01 21:46:46,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:46,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 21:46:46,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 21:46:46,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 21:46:46,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 21:46:46,942 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2019-10-01 21:46:47,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:47,027 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-10-01 21:46:47,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 21:46:47,032 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-10-01 21:46:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:47,033 INFO L225 Difference]: With dead ends: 154 [2019-10-01 21:46:47,033 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 21:46:47,034 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 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 21:46:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 21:46:47,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-01 21:46:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 21:46:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-01 21:46:47,039 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2019-10-01 21:46:47,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:47,039 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-01 21:46:47,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 21:46:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-01 21:46:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-01 21:46:47,040 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:47,040 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:47,041 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:47,041 INFO L82 PathProgramCache]: Analyzing trace with hash 570812147, now seen corresponding path program 26 times [2019-10-01 21:46:47,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:47,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:47,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:46:47,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:47,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:47,455 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 21:46:47,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:46:47,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:46:47,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:47,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 21:46:47,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:47,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:47,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 21:46:47,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 21:46:47,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 21:46:47,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 21:46:47,606 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 31 states. [2019-10-01 21:46:47,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:47,706 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2019-10-01 21:46:47,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 21:46:47,706 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 148 [2019-10-01 21:46:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:47,707 INFO L225 Difference]: With dead ends: 156 [2019-10-01 21:46:47,707 INFO L226 Difference]: Without dead ends: 110 [2019-10-01 21:46:47,709 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 21:46:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-01 21:46:47,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-10-01 21:46:47,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-01 21:46:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2019-10-01 21:46:47,713 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 148 [2019-10-01 21:46:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:47,713 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2019-10-01 21:46:47,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 21:46:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2019-10-01 21:46:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-01 21:46:47,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:47,714 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:47,715 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:47,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1342318677, now seen corresponding path program 27 times [2019-10-01 21:46:47,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:47,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:47,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:47,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 21:46:48,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:48,382 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 21:46:48,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:46:48,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 21:46:48,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:48,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:46:48,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2019-10-01 21:46:48,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:48,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 10] total 39 [2019-10-01 21:46:48,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 21:46:48,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 21:46:48,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 21:46:48,804 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand 39 states. [2019-10-01 21:46:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:48,975 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2019-10-01 21:46:48,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-01 21:46:48,976 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2019-10-01 21:46:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:48,977 INFO L225 Difference]: With dead ends: 161 [2019-10-01 21:46:48,978 INFO L226 Difference]: Without dead ends: 115 [2019-10-01 21:46:48,979 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 21:46:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-01 21:46:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2019-10-01 21:46:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-01 21:46:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2019-10-01 21:46:48,985 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 150 [2019-10-01 21:46:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:48,986 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2019-10-01 21:46:48,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 21:46:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2019-10-01 21:46:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-01 21:46:48,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:48,988 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 24, 24, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:48,988 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:48,989 INFO L82 PathProgramCache]: Analyzing trace with hash 740164533, now seen corresponding path program 28 times [2019-10-01 21:46:48,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:48,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:48,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:48,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:48,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 21:46:49,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:49,538 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 21:46:49,582 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:46:49,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:46:49,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:49,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:49,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2019-10-01 21:46:49,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:49,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 11] total 41 [2019-10-01 21:46:49,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 21:46:49,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 21:46:49,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 21:46:49,855 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 41 states. [2019-10-01 21:46:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:50,020 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2019-10-01 21:46:50,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 21:46:50,023 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 154 [2019-10-01 21:46:50,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:50,024 INFO L225 Difference]: With dead ends: 167 [2019-10-01 21:46:50,024 INFO L226 Difference]: Without dead ends: 119 [2019-10-01 21:46:50,028 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=1090, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 21:46:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-10-01 21:46:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-10-01 21:46:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-01 21:46:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 121 transitions. [2019-10-01 21:46:50,035 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 121 transitions. Word has length 154 [2019-10-01 21:46:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:50,036 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 121 transitions. [2019-10-01 21:46:50,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 21:46:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2019-10-01 21:46:50,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-01 21:46:50,040 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:50,040 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 27, 27, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:50,040 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:50,041 INFO L82 PathProgramCache]: Analyzing trace with hash -469800971, now seen corresponding path program 29 times [2019-10-01 21:46:50,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:50,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:50,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:50,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:50,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-10-01 21:46:50,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:50,576 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 21:46:50,617 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:46:55,399 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-10-01 21:46:55,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:55,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 21:46:55,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2019-10-01 21:46:55,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:55,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12] total 43 [2019-10-01 21:46:55,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 21:46:55,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 21:46:55,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 21:46:55,612 INFO L87 Difference]: Start difference. First operand 117 states and 121 transitions. Second operand 43 states. [2019-10-01 21:46:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:55,792 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2019-10-01 21:46:55,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 21:46:55,792 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 162 [2019-10-01 21:46:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:55,793 INFO L225 Difference]: With dead ends: 173 [2019-10-01 21:46:55,794 INFO L226 Difference]: Without dead ends: 123 [2019-10-01 21:46:55,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 21:46:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-01 21:46:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-10-01 21:46:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-01 21:46:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2019-10-01 21:46:55,803 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 162 [2019-10-01 21:46:55,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:55,804 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2019-10-01 21:46:55,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 21:46:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2019-10-01 21:46:55,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-01 21:46:55,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:55,806 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:55,806 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:55,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:55,806 INFO L82 PathProgramCache]: Analyzing trace with hash 588995125, now seen corresponding path program 30 times [2019-10-01 21:46:55,806 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:55,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:55,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:55,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:55,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:46:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2019-10-01 21:46:56,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:46:56,467 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:46:56,515 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:46:59,543 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 21:46:59,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:46:59,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 21:46:59,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:46:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2000 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1486 trivial. 0 not checked. [2019-10-01 21:46:59,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:46:59,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 11] total 43 [2019-10-01 21:46:59,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 21:46:59,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 21:46:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 21:46:59,729 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand 43 states. [2019-10-01 21:46:59,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:46:59,937 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2019-10-01 21:46:59,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 21:46:59,938 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 170 [2019-10-01 21:46:59,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:46:59,939 INFO L225 Difference]: With dead ends: 179 [2019-10-01 21:46:59,939 INFO L226 Difference]: Without dead ends: 127 [2019-10-01 21:46:59,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=615, Invalid=1191, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 21:46:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-01 21:46:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-10-01 21:46:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 21:46:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-01 21:46:59,945 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 170 [2019-10-01 21:46:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:46:59,946 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-01 21:46:59,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 21:46:59,946 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-01 21:46:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 21:46:59,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:46:59,947 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:46:59,947 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:46:59,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:46:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1888810859, now seen corresponding path program 31 times [2019-10-01 21:46:59,948 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:46:59,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:46:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:59,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:46:59,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:46:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:00,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:00,444 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:00,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:00,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 21:47:00,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:00,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:00,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 21:47:00,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 21:47:00,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 21:47:00,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 21:47:00,622 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2019-10-01 21:47:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:00,724 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2019-10-01 21:47:00,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 21:47:00,725 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-10-01 21:47:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:00,726 INFO L225 Difference]: With dead ends: 182 [2019-10-01 21:47:00,726 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 21:47:00,727 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 21:47:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 21:47:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-01 21:47:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 21:47:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-01 21:47:00,732 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2019-10-01 21:47:00,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:00,732 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-01 21:47:00,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 21:47:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-01 21:47:00,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 21:47:00,733 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:00,734 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:00,734 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:00,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:00,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2135919753, now seen corresponding path program 32 times [2019-10-01 21:47:00,734 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:00,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:00,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:00,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:00,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:01,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:01,277 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:01,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:47:01,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:47:01,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:01,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 21:47:01,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:01,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:01,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-10-01 21:47:01,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-01 21:47:01,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-01 21:47:01,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 21:47:01,446 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 37 states. [2019-10-01 21:47:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:01,526 INFO L93 Difference]: Finished difference Result 184 states and 192 transitions. [2019-10-01 21:47:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-01 21:47:01,526 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 176 [2019-10-01 21:47:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:01,527 INFO L225 Difference]: With dead ends: 184 [2019-10-01 21:47:01,527 INFO L226 Difference]: Without dead ends: 130 [2019-10-01 21:47:01,528 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-10-01 21:47:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-01 21:47:01,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-10-01 21:47:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-01 21:47:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2019-10-01 21:47:01,533 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 176 [2019-10-01 21:47:01,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:01,533 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2019-10-01 21:47:01,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-01 21:47:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2019-10-01 21:47:01,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-01 21:47:01,534 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:01,534 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:01,535 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:01,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:01,535 INFO L82 PathProgramCache]: Analyzing trace with hash 910601689, now seen corresponding path program 33 times [2019-10-01 21:47:01,535 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:01,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:01,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:01,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:01,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 21:47:02,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:02,296 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:02,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:47:02,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 21:47:02,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:02,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 21:47:02,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 448 proven. 100 refuted. 0 times theorem prover too weak. 1664 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:47:02,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:02,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-01 21:47:02,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 21:47:02,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 21:47:02,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:47:02,828 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 48 states. [2019-10-01 21:47:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:03,030 INFO L93 Difference]: Finished difference Result 189 states and 201 transitions. [2019-10-01 21:47:03,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 21:47:03,030 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 178 [2019-10-01 21:47:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:03,032 INFO L225 Difference]: With dead ends: 189 [2019-10-01 21:47:03,032 INFO L226 Difference]: Without dead ends: 135 [2019-10-01 21:47:03,034 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:47:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-01 21:47:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2019-10-01 21:47:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-01 21:47:03,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2019-10-01 21:47:03,040 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 178 [2019-10-01 21:47:03,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:03,043 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2019-10-01 21:47:03,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 21:47:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2019-10-01 21:47:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-01 21:47:03,045 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:03,045 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 33, 33, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:03,045 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:03,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:03,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1957396505, now seen corresponding path program 34 times [2019-10-01 21:47:03,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:03,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:03,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:03,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:03,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2019-10-01 21:47:04,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:04,007 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:04,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:47:04,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:47:04,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:04,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 21:47:04,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 803 proven. 121 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-10-01 21:47:04,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:04,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 14] total 50 [2019-10-01 21:47:04,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 21:47:04,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 21:47:04,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:47:04,400 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 50 states. [2019-10-01 21:47:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:04,631 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2019-10-01 21:47:04,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 21:47:04,635 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 186 [2019-10-01 21:47:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:04,637 INFO L225 Difference]: With dead ends: 195 [2019-10-01 21:47:04,637 INFO L226 Difference]: Without dead ends: 139 [2019-10-01 21:47:04,638 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=793, Invalid=1657, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:47:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-01 21:47:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-10-01 21:47:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-01 21:47:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2019-10-01 21:47:04,643 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 186 [2019-10-01 21:47:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:04,643 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2019-10-01 21:47:04,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 21:47:04,644 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2019-10-01 21:47:04,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-01 21:47:04,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:04,645 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:04,645 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:04,645 INFO L82 PathProgramCache]: Analyzing trace with hash -357998503, now seen corresponding path program 35 times [2019-10-01 21:47:04,645 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:04,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:04,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:04,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:04,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2019-10-01 21:47:05,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:05,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:05,386 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:47:35,248 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-10-01 21:47:35,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:35,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 21:47:35,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 628 proven. 144 refuted. 0 times theorem prover too weak. 1988 trivial. 0 not checked. [2019-10-01 21:47:35,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:35,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15] total 52 [2019-10-01 21:47:35,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-01 21:47:35,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-01 21:47:35,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 21:47:35,624 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 52 states. [2019-10-01 21:47:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:35,853 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2019-10-01 21:47:35,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 21:47:35,853 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 194 [2019-10-01 21:47:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:35,854 INFO L225 Difference]: With dead ends: 201 [2019-10-01 21:47:35,854 INFO L226 Difference]: Without dead ends: 143 [2019-10-01 21:47:35,855 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=845, Invalid=1807, Unknown=0, NotChecked=0, Total=2652 [2019-10-01 21:47:35,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-01 21:47:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-10-01 21:47:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-10-01 21:47:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2019-10-01 21:47:35,861 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 194 [2019-10-01 21:47:35,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:35,862 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2019-10-01 21:47:35,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-01 21:47:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2019-10-01 21:47:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 21:47:35,863 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:35,863 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 37, 37, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:35,864 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:35,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:35,864 INFO L82 PathProgramCache]: Analyzing trace with hash 622808729, now seen corresponding path program 36 times [2019-10-01 21:47:35,864 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:35,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:35,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:35,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:35,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1695 trivial. 0 not checked. [2019-10-01 21:47:36,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:36,642 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:36,701 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:47:38,494 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-10-01 21:47:38,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:38,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 21:47:38,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 738 proven. 81 refuted. 0 times theorem prover too weak. 2245 trivial. 0 not checked. [2019-10-01 21:47:38,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:38,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 12] total 50 [2019-10-01 21:47:38,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 21:47:38,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 21:47:38,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:47:38,718 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 50 states. [2019-10-01 21:47:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:38,949 INFO L93 Difference]: Finished difference Result 207 states and 216 transitions. [2019-10-01 21:47:38,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 21:47:38,949 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 202 [2019-10-01 21:47:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:38,950 INFO L225 Difference]: With dead ends: 207 [2019-10-01 21:47:38,951 INFO L226 Difference]: Without dead ends: 147 [2019-10-01 21:47:38,952 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=845, Invalid=1605, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 21:47:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-01 21:47:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2019-10-01 21:47:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 21:47:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2019-10-01 21:47:38,957 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 202 [2019-10-01 21:47:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:38,958 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2019-10-01 21:47:38,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 21:47:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2019-10-01 21:47:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-01 21:47:38,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:38,959 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:38,960 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:38,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1268079623, now seen corresponding path program 37 times [2019-10-01 21:47:38,960 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:38,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:38,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 21:47:39,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:39,676 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:39,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:39,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 21:47:39,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3158 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (39)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:47:39,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:39,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 21:47:39,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 21:47:39,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 21:47:39,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:39,867 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2019-10-01 21:47:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:40,000 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-10-01 21:47:40,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 21:47:40,001 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 206 [2019-10-01 21:47:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:40,002 INFO L225 Difference]: With dead ends: 210 [2019-10-01 21:47:40,002 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 21:47:40,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 21:47:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 21:47:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-01 21:47:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 21:47:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-01 21:47:40,007 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 206 [2019-10-01 21:47:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:40,007 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-01 21:47:40,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 21:47:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-01 21:47:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-01 21:47:40,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:40,009 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:40,009 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:40,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:40,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1107556645, now seen corresponding path program 38 times [2019-10-01 21:47:40,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:40,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:40,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:40,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:47:40,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 21:47:40,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:40,762 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:40,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:47:40,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:47:40,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:40,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 21:47:40,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3235 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:47:40,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:40,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-10-01 21:47:40,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 21:47:40,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 21:47:40,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 21:47:40,963 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 43 states. [2019-10-01 21:47:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:41,100 INFO L93 Difference]: Finished difference Result 212 states and 220 transitions. [2019-10-01 21:47:41,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 21:47:41,101 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 208 [2019-10-01 21:47:41,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:41,102 INFO L225 Difference]: With dead ends: 212 [2019-10-01 21:47:41,102 INFO L226 Difference]: Without dead ends: 150 [2019-10-01 21:47:41,103 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 21:47:41,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-01 21:47:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-10-01 21:47:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-01 21:47:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2019-10-01 21:47:41,108 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 208 [2019-10-01 21:47:41,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:41,109 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2019-10-01 21:47:41,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 21:47:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2019-10-01 21:47:41,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-01 21:47:41,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:41,110 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:41,110 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:41,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:41,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1463797443, now seen corresponding path program 39 times [2019-10-01 21:47:41,111 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:41,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:41,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:41,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:41,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2019-10-01 21:47:41,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:41,825 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:41,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:47:42,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 21:47:42,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:42,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 21:47:42,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3314 backedges. 738 proven. 100 refuted. 0 times theorem prover too weak. 2476 trivial. 0 not checked. [2019-10-01 21:47:42,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:42,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 13] total 54 [2019-10-01 21:47:42,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 21:47:42,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 21:47:42,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=980, Invalid=1882, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:47:42,433 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 54 states. [2019-10-01 21:47:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:42,676 INFO L93 Difference]: Finished difference Result 217 states and 226 transitions. [2019-10-01 21:47:42,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 21:47:42,676 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2019-10-01 21:47:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:42,677 INFO L225 Difference]: With dead ends: 217 [2019-10-01 21:47:42,677 INFO L226 Difference]: Without dead ends: 155 [2019-10-01 21:47:42,678 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=980, Invalid=1882, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:47:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-01 21:47:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2019-10-01 21:47:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-01 21:47:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-10-01 21:47:42,683 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 210 [2019-10-01 21:47:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:42,683 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-10-01 21:47:42,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 21:47:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-10-01 21:47:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 21:47:42,684 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:42,684 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:42,684 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:42,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:42,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2135618461, now seen corresponding path program 40 times [2019-10-01 21:47:42,685 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:42,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:42,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:42,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:42,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 21:47:43,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:43,434 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:43,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:47:43,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:47:43,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:47:43,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 21:47:43,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:47:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:47:43,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:47:43,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-10-01 21:47:43,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 21:47:43,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 21:47:43,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 21:47:43,652 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 45 states. [2019-10-01 21:47:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:47:43,772 INFO L93 Difference]: Finished difference Result 220 states and 228 transitions. [2019-10-01 21:47:43,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-01 21:47:43,773 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 214 [2019-10-01 21:47:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:47:43,774 INFO L225 Difference]: With dead ends: 220 [2019-10-01 21:47:43,774 INFO L226 Difference]: Without dead ends: 156 [2019-10-01 21:47:43,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 21:47:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-01 21:47:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2019-10-01 21:47:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-01 21:47:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2019-10-01 21:47:43,783 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 214 [2019-10-01 21:47:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:47:43,790 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2019-10-01 21:47:43,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 21:47:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2019-10-01 21:47:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-01 21:47:43,791 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:47:43,791 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:47:43,792 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:47:43,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:47:43,792 INFO L82 PathProgramCache]: Analyzing trace with hash 2126795903, now seen corresponding path program 41 times [2019-10-01 21:47:43,792 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:47:43,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:47:43,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:43,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:47:43,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:47:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:47:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3499 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 21:47:44,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:47:44,546 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:47:44,606 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:49:15,058 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-10-01 21:49:15,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:15,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 21:49:15,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3499 backedges. 732 proven. 169 refuted. 0 times theorem prover too weak. 2598 trivial. 0 not checked. [2019-10-01 21:49:15,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:15,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 16] total 59 [2019-10-01 21:49:15,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 21:49:15,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 21:49:15,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 21:49:15,461 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 59 states. [2019-10-01 21:49:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:15,723 INFO L93 Difference]: Finished difference Result 225 states and 237 transitions. [2019-10-01 21:49:15,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 21:49:15,723 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 216 [2019-10-01 21:49:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:15,724 INFO L225 Difference]: With dead ends: 225 [2019-10-01 21:49:15,724 INFO L226 Difference]: Without dead ends: 161 [2019-10-01 21:49:15,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 21:49:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-01 21:49:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2019-10-01 21:49:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-01 21:49:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2019-10-01 21:49:15,730 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 216 [2019-10-01 21:49:15,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:15,731 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2019-10-01 21:49:15,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 21:49:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2019-10-01 21:49:15,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-01 21:49:15,732 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:15,732 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:49:15,733 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:15,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:15,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1411184319, now seen corresponding path program 42 times [2019-10-01 21:49:15,733 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:15,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:15,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:15,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:15,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3833 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-10-01 21:49:16,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:16,548 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:49:16,611 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:49:19,130 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 21:49:19,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:19,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 21:49:19,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3833 backedges. 850 proven. 121 refuted. 0 times theorem prover too weak. 2862 trivial. 0 not checked. [2019-10-01 21:49:19,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:19,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 14] total 58 [2019-10-01 21:49:19,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 21:49:19,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 21:49:19,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1125, Invalid=2181, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 21:49:19,477 INFO L87 Difference]: Start difference. First operand 159 states and 163 transitions. Second operand 58 states. [2019-10-01 21:49:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:19,737 INFO L93 Difference]: Finished difference Result 231 states and 240 transitions. [2019-10-01 21:49:19,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 21:49:19,738 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 224 [2019-10-01 21:49:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:19,739 INFO L225 Difference]: With dead ends: 231 [2019-10-01 21:49:19,740 INFO L226 Difference]: Without dead ends: 165 [2019-10-01 21:49:19,741 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1125, Invalid=2181, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 21:49:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-01 21:49:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2019-10-01 21:49:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 21:49:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2019-10-01 21:49:19,754 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 224 [2019-10-01 21:49:19,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:19,755 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2019-10-01 21:49:19,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 21:49:19,755 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2019-10-01 21:49:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-01 21:49:19,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:19,757 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:49:19,757 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:19,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:19,758 INFO L82 PathProgramCache]: Analyzing trace with hash -958157537, now seen corresponding path program 43 times [2019-10-01 21:49:19,758 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:19,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:19,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:19,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:19,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:49:20,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:20,605 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:49:20,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:49:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:20,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 21:49:20,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:49:20,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:20,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 21:49:20,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 21:49:20,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 21:49:20,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:49:20,832 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand 48 states. [2019-10-01 21:49:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:20,999 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2019-10-01 21:49:20,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 21:49:20,999 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2019-10-01 21:49:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:21,000 INFO L225 Difference]: With dead ends: 234 [2019-10-01 21:49:21,001 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 21:49:21,001 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 21:49:21,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 21:49:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-10-01 21:49:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-01 21:49:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-10-01 21:49:21,007 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 228 [2019-10-01 21:49:21,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:21,007 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-10-01 21:49:21,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 21:49:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-10-01 21:49:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 21:49:21,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:21,009 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:49:21,009 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:21,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:21,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1512626817, now seen corresponding path program 44 times [2019-10-01 21:49:21,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:21,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:21,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:21,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:49:21,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:49:21,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:21,905 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:49:21,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:49:22,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:49:22,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:22,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 21:49:22,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:49:22,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:22,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-10-01 21:49:22,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 21:49:22,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 21:49:22,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:49:22,138 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 49 states. [2019-10-01 21:49:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:22,272 INFO L93 Difference]: Finished difference Result 236 states and 244 transitions. [2019-10-01 21:49:22,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 21:49:22,272 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 230 [2019-10-01 21:49:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:22,274 INFO L225 Difference]: With dead ends: 236 [2019-10-01 21:49:22,274 INFO L226 Difference]: Without dead ends: 168 [2019-10-01 21:49:22,274 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 21:49:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-01 21:49:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2019-10-01 21:49:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-10-01 21:49:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2019-10-01 21:49:22,280 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 230 [2019-10-01 21:49:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:22,280 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2019-10-01 21:49:22,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 21:49:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2019-10-01 21:49:22,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-01 21:49:22,282 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:22,282 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:49:22,282 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:22,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:22,282 INFO L82 PathProgramCache]: Analyzing trace with hash 819476323, now seen corresponding path program 45 times [2019-10-01 21:49:22,283 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:22,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:22,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:22,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:22,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 21:49:23,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:23,201 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:49:23,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:49:23,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 21:49:23,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:23,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 21:49:23,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4123 backedges. 850 proven. 144 refuted. 0 times theorem prover too weak. 3129 trivial. 0 not checked. [2019-10-01 21:49:24,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:24,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 15] total 62 [2019-10-01 21:49:24,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-01 21:49:24,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-01 21:49:24,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=2502, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 21:49:24,145 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 62 states. [2019-10-01 21:49:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:24,424 INFO L93 Difference]: Finished difference Result 241 states and 250 transitions. [2019-10-01 21:49:24,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-01 21:49:24,424 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 232 [2019-10-01 21:49:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:24,425 INFO L225 Difference]: With dead ends: 241 [2019-10-01 21:49:24,425 INFO L226 Difference]: Without dead ends: 173 [2019-10-01 21:49:24,426 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1280, Invalid=2502, Unknown=0, NotChecked=0, Total=3782 [2019-10-01 21:49:24,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-01 21:49:24,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-10-01 21:49:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 21:49:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-10-01 21:49:24,432 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 232 [2019-10-01 21:49:24,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:24,432 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-10-01 21:49:24,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-01 21:49:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-10-01 21:49:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 21:49:24,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:24,434 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:49:24,434 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:24,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:24,434 INFO L82 PathProgramCache]: Analyzing trace with hash 567169731, now seen corresponding path program 46 times [2019-10-01 21:49:24,434 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:24,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:24,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:24,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:24,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:49:25,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:25,388 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:49:25,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:49:25,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:49:25,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:49:25,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-01 21:49:25,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:49:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (48)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:49:25,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:49:25,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-10-01 21:49:25,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 21:49:25,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 21:49:25,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:49:25,629 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 51 states. [2019-10-01 21:49:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:49:25,811 INFO L93 Difference]: Finished difference Result 244 states and 252 transitions. [2019-10-01 21:49:25,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-01 21:49:25,812 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 236 [2019-10-01 21:49:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:49:25,813 INFO L225 Difference]: With dead ends: 244 [2019-10-01 21:49:25,813 INFO L226 Difference]: Without dead ends: 174 [2019-10-01 21:49:25,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 21:49:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-01 21:49:25,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-10-01 21:49:25,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-01 21:49:25,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 177 transitions. [2019-10-01 21:49:25,819 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 177 transitions. Word has length 236 [2019-10-01 21:49:25,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:49:25,820 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 177 transitions. [2019-10-01 21:49:25,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 21:49:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2019-10-01 21:49:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-01 21:49:25,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:49:25,821 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:49:25,822 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:49:25,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:49:25,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1774779941, now seen corresponding path program 47 times [2019-10-01 21:49:25,822 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:49:25,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:49:25,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:25,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:49:25,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:49:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:49:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4336 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 21:49:26,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:49:26,808 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:49:26,882 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:51:39,701 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-10-01 21:51:39,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:39,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:51:39,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4336 backedges. 844 proven. 196 refuted. 0 times theorem prover too weak. 3296 trivial. 0 not checked. [2019-10-01 21:51:40,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:40,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 17] total 66 [2019-10-01 21:51:40,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 21:51:40,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 21:51:40,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1410, Invalid=2880, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:51:40,160 INFO L87 Difference]: Start difference. First operand 173 states and 177 transitions. Second operand 66 states. [2019-10-01 21:51:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:40,442 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2019-10-01 21:51:40,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 21:51:40,442 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 238 [2019-10-01 21:51:40,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:40,444 INFO L225 Difference]: With dead ends: 249 [2019-10-01 21:51:40,444 INFO L226 Difference]: Without dead ends: 179 [2019-10-01 21:51:40,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1410, Invalid=2880, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:51:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-10-01 21:51:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-10-01 21:51:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-01 21:51:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2019-10-01 21:51:40,458 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 238 [2019-10-01 21:51:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:40,459 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2019-10-01 21:51:40,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 21:51:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2019-10-01 21:51:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-01 21:51:40,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:40,464 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 45, 45, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:40,464 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:40,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:40,464 INFO L82 PathProgramCache]: Analyzing trace with hash -772287387, now seen corresponding path program 48 times [2019-10-01 21:51:40,465 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:40,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:40,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:40,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:40,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2019-10-01 21:51:41,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:41,732 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:51:41,805 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:51:45,622 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 21:51:45,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:45,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 21:51:45,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4700 backedges. 970 proven. 169 refuted. 0 times theorem prover too weak. 3561 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 21:51:46,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:46,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 16] total 66 [2019-10-01 21:51:46,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 21:51:46,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 21:51:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=2845, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:51:46,122 INFO L87 Difference]: Start difference. First operand 177 states and 181 transitions. Second operand 66 states. [2019-10-01 21:51:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:46,404 INFO L93 Difference]: Finished difference Result 255 states and 264 transitions. [2019-10-01 21:51:46,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 21:51:46,405 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 246 [2019-10-01 21:51:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:46,406 INFO L225 Difference]: With dead ends: 255 [2019-10-01 21:51:46,406 INFO L226 Difference]: Without dead ends: 183 [2019-10-01 21:51:46,408 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1445, Invalid=2845, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 21:51:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-01 21:51:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2019-10-01 21:51:46,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 21:51:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2019-10-01 21:51:46,415 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 246 [2019-10-01 21:51:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:46,416 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2019-10-01 21:51:46,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 21:51:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2019-10-01 21:51:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 21:51:46,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:46,418 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:46,418 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:46,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:46,419 INFO L82 PathProgramCache]: Analyzing trace with hash 243903429, now seen corresponding path program 49 times [2019-10-01 21:51:46,419 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:46,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:46,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:46,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:46,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:47,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:47,774 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:51:47,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:51:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:47,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 21:51:47,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:48,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:48,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 21:51:48,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 21:51:48,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 21:51:48,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:51:48,023 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 54 states. [2019-10-01 21:51:48,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:48,221 INFO L93 Difference]: Finished difference Result 258 states and 266 transitions. [2019-10-01 21:51:48,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 21:51:48,222 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 250 [2019-10-01 21:51:48,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:48,223 INFO L225 Difference]: With dead ends: 258 [2019-10-01 21:51:48,223 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 21:51:48,224 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 21:51:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 21:51:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-10-01 21:51:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 21:51:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2019-10-01 21:51:48,229 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 250 [2019-10-01 21:51:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:48,229 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2019-10-01 21:51:48,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 21:51:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2019-10-01 21:51:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-01 21:51:48,231 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:48,231 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:48,231 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:48,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash -822361177, now seen corresponding path program 50 times [2019-10-01 21:51:48,232 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:48,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:48,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:48,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:51:48,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:49,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:49,310 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:51:49,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:51:49,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:51:49,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:49,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-01 21:51:49,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:49,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:49,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-10-01 21:51:49,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 21:51:49,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 21:51:49,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:51:49,582 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 55 states. [2019-10-01 21:51:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:49,772 INFO L93 Difference]: Finished difference Result 260 states and 268 transitions. [2019-10-01 21:51:49,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-01 21:51:49,773 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 252 [2019-10-01 21:51:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:49,774 INFO L225 Difference]: With dead ends: 260 [2019-10-01 21:51:49,774 INFO L226 Difference]: Without dead ends: 186 [2019-10-01 21:51:49,774 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 21:51:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-01 21:51:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-10-01 21:51:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-10-01 21:51:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2019-10-01 21:51:49,780 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 189 transitions. Word has length 252 [2019-10-01 21:51:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:49,781 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 189 transitions. [2019-10-01 21:51:49,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 21:51:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2019-10-01 21:51:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-01 21:51:49,782 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:49,783 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:49,783 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:49,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:49,783 INFO L82 PathProgramCache]: Analyzing trace with hash 994536201, now seen corresponding path program 51 times [2019-10-01 21:51:49,783 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:49,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:49,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:49,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:50,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5030 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 21:51:50,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:50,966 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:51:51,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:51:52,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 21:51:52,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:52,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 21:51:52,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5030 backedges. 970 proven. 196 refuted. 0 times theorem prover too weak. 3864 trivial. 0 not checked. [2019-10-01 21:51:52,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:52,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 17] total 70 [2019-10-01 21:51:52,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-01 21:51:52,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-01 21:51:52,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1620, Invalid=3210, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 21:51:52,708 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. Second operand 70 states. [2019-10-01 21:51:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:53,078 INFO L93 Difference]: Finished difference Result 265 states and 274 transitions. [2019-10-01 21:51:53,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-01 21:51:53,079 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 254 [2019-10-01 21:51:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:53,080 INFO L225 Difference]: With dead ends: 265 [2019-10-01 21:51:53,080 INFO L226 Difference]: Without dead ends: 191 [2019-10-01 21:51:53,081 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1620, Invalid=3210, Unknown=0, NotChecked=0, Total=4830 [2019-10-01 21:51:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-01 21:51:53,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2019-10-01 21:51:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-01 21:51:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2019-10-01 21:51:53,087 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 254 [2019-10-01 21:51:53,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:53,087 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2019-10-01 21:51:53,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-01 21:51:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2019-10-01 21:51:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-01 21:51:53,089 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:53,090 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:53,090 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:53,090 INFO L82 PathProgramCache]: Analyzing trace with hash -212293783, now seen corresponding path program 52 times [2019-10-01 21:51:53,090 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:53,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:53,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:53,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:53,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:54,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:51:54,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:54,472 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:51:54,573 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:51:54,692 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:51:54,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:51:54,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 21:51:54,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:51:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:51:54,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:51:54,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-10-01 21:51:54,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 21:51:54,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 21:51:54,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 21:51:54,760 INFO L87 Difference]: Start difference. First operand 189 states and 193 transitions. Second operand 57 states. [2019-10-01 21:51:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:51:54,946 INFO L93 Difference]: Finished difference Result 268 states and 276 transitions. [2019-10-01 21:51:54,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-01 21:51:54,948 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 258 [2019-10-01 21:51:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:51:54,950 INFO L225 Difference]: With dead ends: 268 [2019-10-01 21:51:54,950 INFO L226 Difference]: Without dead ends: 192 [2019-10-01 21:51:54,950 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 21:51:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-01 21:51:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-10-01 21:51:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-01 21:51:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2019-10-01 21:51:54,956 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 258 [2019-10-01 21:51:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:51:54,956 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2019-10-01 21:51:54,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 21:51:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2019-10-01 21:51:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-01 21:51:54,958 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:51:54,958 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:51:54,958 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:51:54,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:51:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash 741195083, now seen corresponding path program 53 times [2019-10-01 21:51:54,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:51:54,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:51:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:54,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:51:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:51:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:51:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5271 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 21:51:56,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:51:56,201 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:51:56,288 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:54:28,483 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-10-01 21:54:28,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:54:28,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 21:54:28,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:54:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5271 backedges. 964 proven. 225 refuted. 0 times theorem prover too weak. 4082 trivial. 0 not checked. [2019-10-01 21:54:28,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:54:28,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 18] total 73 [2019-10-01 21:54:28,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 21:54:28,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 21:54:28,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 21:54:28,977 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 73 states. [2019-10-01 21:54:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:54:29,248 INFO L93 Difference]: Finished difference Result 273 states and 285 transitions. [2019-10-01 21:54:29,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 21:54:29,253 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 260 [2019-10-01 21:54:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:54:29,255 INFO L225 Difference]: With dead ends: 273 [2019-10-01 21:54:29,255 INFO L226 Difference]: Without dead ends: 197 [2019-10-01 21:54:29,256 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 21:54:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-01 21:54:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2019-10-01 21:54:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-01 21:54:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 199 transitions. [2019-10-01 21:54:29,261 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 199 transitions. Word has length 260 [2019-10-01 21:54:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:54:29,261 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 199 transitions. [2019-10-01 21:54:29,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 21:54:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 199 transitions. [2019-10-01 21:54:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-01 21:54:29,263 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:54:29,263 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 48, 48, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:54:29,264 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:54:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:54:29,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1642481547, now seen corresponding path program 54 times [2019-10-01 21:54:29,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:54:29,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:54:29,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:29,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:54:29,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:54:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:54:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5665 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-10-01 21:54:30,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:54:30,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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:54:30,598 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:55:16,931 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-01 21:55:16,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:55:16,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 21:55:16,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:55:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5665 backedges. 1098 proven. 225 refuted. 0 times theorem prover too weak. 4342 trivial. 0 not checked. [2019-10-01 21:55:17,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:55:17,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 18] total 74 [2019-10-01 21:55:17,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-10-01 21:55:17,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-10-01 21:55:17,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=3597, Unknown=0, NotChecked=0, Total=5402 [2019-10-01 21:55:17,439 INFO L87 Difference]: Start difference. First operand 195 states and 199 transitions. Second operand 74 states. [2019-10-01 21:55:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:55:17,762 INFO L93 Difference]: Finished difference Result 279 states and 288 transitions. [2019-10-01 21:55:17,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-10-01 21:55:17,762 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 268 [2019-10-01 21:55:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:55:17,764 INFO L225 Difference]: With dead ends: 279 [2019-10-01 21:55:17,764 INFO L226 Difference]: Without dead ends: 201 [2019-10-01 21:55:17,765 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1805, Invalid=3597, Unknown=0, NotChecked=0, Total=5402 [2019-10-01 21:55:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-01 21:55:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-10-01 21:55:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-01 21:55:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2019-10-01 21:55:17,773 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 268 [2019-10-01 21:55:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:55:17,774 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2019-10-01 21:55:17,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-10-01 21:55:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2019-10-01 21:55:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-01 21:55:17,775 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:55:17,775 INFO L411 BasicCegarLoop]: trace histogram [56, 56, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:55:17,775 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:55:17,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:55:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash -312279061, now seen corresponding path program 55 times [2019-10-01 21:55:17,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:55:17,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:55:17,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:17,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:55:17,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:55:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5807 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:55:19,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:55:19,004 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:55:19,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:55:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:55:19,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 21:55:19,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:55:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5807 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:55:19,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:55:19,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-01 21:55:19,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 21:55:19,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 21:55:19,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 21:55:19,294 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 60 states. [2019-10-01 21:55:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:55:19,528 INFO L93 Difference]: Finished difference Result 282 states and 290 transitions. [2019-10-01 21:55:19,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 21:55:19,528 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 272 [2019-10-01 21:55:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:55:19,529 INFO L225 Difference]: With dead ends: 282 [2019-10-01 21:55:19,529 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 21:55:19,529 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 21:55:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 21:55:19,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-10-01 21:55:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-01 21:55:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2019-10-01 21:55:19,535 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 272 [2019-10-01 21:55:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:55:19,536 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2019-10-01 21:55:19,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 21:55:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2019-10-01 21:55:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-01 21:55:19,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:55:19,537 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:55:19,538 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:55:19,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:55:19,538 INFO L82 PathProgramCache]: Analyzing trace with hash -521985459, now seen corresponding path program 56 times [2019-10-01 21:55:19,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:55:19,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:55:19,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:19,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:55:19,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:55:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:55:20,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:55:20,850 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:55:20,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:55:21,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:55:21,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:55:21,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 21:55:21,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:55:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:55:21,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:55:21,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-10-01 21:55:21,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 21:55:21,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 21:55:21,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:55:21,128 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 61 states. [2019-10-01 21:55:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:55:21,319 INFO L93 Difference]: Finished difference Result 284 states and 292 transitions. [2019-10-01 21:55:21,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-01 21:55:21,320 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 274 [2019-10-01 21:55:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:55:21,322 INFO L225 Difference]: With dead ends: 284 [2019-10-01 21:55:21,322 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 21:55:21,323 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 21:55:21,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 21:55:21,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2019-10-01 21:55:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-01 21:55:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 207 transitions. [2019-10-01 21:55:21,329 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 207 transitions. Word has length 274 [2019-10-01 21:55:21,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:55:21,329 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 207 transitions. [2019-10-01 21:55:21,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 21:55:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 207 transitions. [2019-10-01 21:55:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-01 21:55:21,331 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:55:21,331 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:55:21,332 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:55:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:55:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash -186371025, now seen corresponding path program 57 times [2019-10-01 21:55:21,332 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:55:21,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:55:21,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:21,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:55:21,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:55:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 21:55:22,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:55:22,743 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:55:22,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:55:24,142 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-01 21:55:24,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:55:24,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 21:55:24,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:55:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6035 backedges. 1096 proven. 256 refuted. 0 times theorem prover too weak. 4683 trivial. 0 not checked. [2019-10-01 21:55:24,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:55:24,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 19] total 78 [2019-10-01 21:55:24,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-10-01 21:55:24,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-10-01 21:55:24,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2000, Invalid=4006, Unknown=0, NotChecked=0, Total=6006 [2019-10-01 21:55:24,682 INFO L87 Difference]: Start difference. First operand 203 states and 207 transitions. Second operand 78 states. [2019-10-01 21:55:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:55:25,042 INFO L93 Difference]: Finished difference Result 289 states and 301 transitions. [2019-10-01 21:55:25,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-10-01 21:55:25,043 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 276 [2019-10-01 21:55:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:55:25,044 INFO L225 Difference]: With dead ends: 289 [2019-10-01 21:55:25,044 INFO L226 Difference]: Without dead ends: 209 [2019-10-01 21:55:25,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2000, Invalid=4006, Unknown=0, NotChecked=0, Total=6006 [2019-10-01 21:55:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-01 21:55:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2019-10-01 21:55:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-01 21:55:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 211 transitions. [2019-10-01 21:55:25,051 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 211 transitions. Word has length 276 [2019-10-01 21:55:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:55:25,052 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 211 transitions. [2019-10-01 21:55:25,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-10-01 21:55:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 211 transitions. [2019-10-01 21:55:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-01 21:55:25,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:55:25,054 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 51, 51, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:55:25,054 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:55:25,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:55:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash 892116591, now seen corresponding path program 58 times [2019-10-01 21:55:25,054 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:55:25,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:55:25,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:25,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:55:25,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:55:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6455 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2019-10-01 21:55:26,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:55:26,417 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:55:26,519 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:55:26,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:55:26,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:55:26,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 21:55:26,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:55:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6455 backedges. 1232 proven. 289 refuted. 0 times theorem prover too weak. 4934 trivial. 0 not checked. [2019-10-01 21:55:27,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:55:27,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 20] total 80 [2019-10-01 21:55:27,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-10-01 21:55:27,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-10-01 21:55:27,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=4240, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 21:55:27,208 INFO L87 Difference]: Start difference. First operand 207 states and 211 transitions. Second operand 80 states. [2019-10-01 21:55:27,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:55:27,595 INFO L93 Difference]: Finished difference Result 295 states and 307 transitions. [2019-10-01 21:55:27,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-01 21:55:27,595 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 284 [2019-10-01 21:55:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:55:27,596 INFO L225 Difference]: With dead ends: 295 [2019-10-01 21:55:27,596 INFO L226 Difference]: Without dead ends: 213 [2019-10-01 21:55:27,597 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2080, Invalid=4240, Unknown=0, NotChecked=0, Total=6320 [2019-10-01 21:55:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-10-01 21:55:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-10-01 21:55:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-10-01 21:55:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2019-10-01 21:55:27,602 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 284 [2019-10-01 21:55:27,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:55:27,602 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2019-10-01 21:55:27,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-10-01 21:55:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2019-10-01 21:55:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-01 21:55:27,604 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:55:27,604 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 54, 54, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:55:27,604 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:55:27,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:55:27,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1883608751, now seen corresponding path program 59 times [2019-10-01 21:55:27,604 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:55:27,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:55:27,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:27,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:55:27,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:55:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:55:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 3295 trivial. 0 not checked. [2019-10-01 21:55:29,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:55:29,028 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:55:29,132 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 21:58:20,725 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-10-01 21:58:20,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:58:20,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 21:58:20,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6895 backedges. 1372 proven. 324 refuted. 0 times theorem prover too weak. 5199 trivial. 0 not checked. [2019-10-01 21:58:21,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:21,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 21] total 82 [2019-10-01 21:58:21,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-01 21:58:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-01 21:58:21,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2162, Invalid=4480, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 21:58:21,374 INFO L87 Difference]: Start difference. First operand 211 states and 215 transitions. Second operand 82 states. [2019-10-01 21:58:21,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:21,766 INFO L93 Difference]: Finished difference Result 301 states and 313 transitions. [2019-10-01 21:58:21,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 21:58:21,767 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 292 [2019-10-01 21:58:21,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:21,768 INFO L225 Difference]: With dead ends: 301 [2019-10-01 21:58:21,768 INFO L226 Difference]: Without dead ends: 217 [2019-10-01 21:58:21,769 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2162, Invalid=4480, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 21:58:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-01 21:58:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2019-10-01 21:58:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-10-01 21:58:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 219 transitions. [2019-10-01 21:58:21,775 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 219 transitions. Word has length 292 [2019-10-01 21:58:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:21,775 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 219 transitions. [2019-10-01 21:58:21,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-01 21:58:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 219 transitions. [2019-10-01 21:58:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-01 21:58:21,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:21,777 INFO L411 BasicCegarLoop]: trace histogram [61, 61, 57, 57, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:58:21,777 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:21,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:21,778 INFO L82 PathProgramCache]: Analyzing trace with hash 420355311, now seen corresponding path program 60 times [2019-10-01 21:58:21,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:21,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:21,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:21,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:58:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7355 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 3634 trivial. 0 not checked. [2019-10-01 21:58:23,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:23,235 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:58:23,345 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 21:58:48,132 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 21:58:48,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:58:48,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 21:58:48,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7355 backedges. 1651 proven. 256 refuted. 0 times theorem prover too weak. 5448 trivial. 0 not checked. [2019-10-01 21:58:48,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:48,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 21] total 83 [2019-10-01 21:58:48,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-01 21:58:48,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-01 21:58:48,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2315, Invalid=4491, Unknown=0, NotChecked=0, Total=6806 [2019-10-01 21:58:48,835 INFO L87 Difference]: Start difference. First operand 215 states and 219 transitions. Second operand 83 states. [2019-10-01 21:58:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:49,800 INFO L93 Difference]: Finished difference Result 308 states and 318 transitions. [2019-10-01 21:58:49,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-01 21:58:49,801 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 300 [2019-10-01 21:58:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:49,803 INFO L225 Difference]: With dead ends: 308 [2019-10-01 21:58:49,803 INFO L226 Difference]: Without dead ends: 222 [2019-10-01 21:58:49,804 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2655, Invalid=7245, Unknown=0, NotChecked=0, Total=9900 [2019-10-01 21:58:49,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-01 21:58:49,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-10-01 21:58:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-01 21:58:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2019-10-01 21:58:49,810 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 300 [2019-10-01 21:58:49,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:49,810 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2019-10-01 21:58:49,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-01 21:58:49,810 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2019-10-01 21:58:49,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-01 21:58:49,812 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:49,812 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:58:49,812 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:49,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:49,813 INFO L82 PathProgramCache]: Analyzing trace with hash 785274545, now seen corresponding path program 61 times [2019-10-01 21:58:49,813 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:49,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:49,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:49,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:58:49,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:51,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:51,745 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:58:51,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:58:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:51,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-01 21:58:52,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:52,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:52,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-10-01 21:58:52,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 21:58:52,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 21:58:52,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 21:58:52,104 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 67 states. [2019-10-01 21:58:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:52,291 INFO L93 Difference]: Finished difference Result 312 states and 320 transitions. [2019-10-01 21:58:52,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 21:58:52,291 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 306 [2019-10-01 21:58:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:52,292 INFO L225 Difference]: With dead ends: 312 [2019-10-01 21:58:52,292 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 21:58:52,293 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 21:58:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 21:58:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-10-01 21:58:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-01 21:58:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 227 transitions. [2019-10-01 21:58:52,299 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 227 transitions. Word has length 306 [2019-10-01 21:58:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:52,299 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 227 transitions. [2019-10-01 21:58:52,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 21:58:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2019-10-01 21:58:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-01 21:58:52,301 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:52,301 INFO L411 BasicCegarLoop]: trace histogram [64, 64, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:58:52,301 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:52,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:52,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1790926995, now seen corresponding path program 62 times [2019-10-01 21:58:52,302 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:52,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:52,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:52,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 21:58:52,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:53,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:53,992 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:58:54,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 21:58:54,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 21:58:54,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:58:54,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 66 conjunts are in the unsatisfiable core [2019-10-01 21:58:54,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:58:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:54,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:58:54,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-10-01 21:58:54,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-01 21:58:54,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-01 21:58:54,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 21:58:54,310 INFO L87 Difference]: Start difference. First operand 223 states and 227 transitions. Second operand 68 states. [2019-10-01 21:58:54,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:58:54,497 INFO L93 Difference]: Finished difference Result 314 states and 322 transitions. [2019-10-01 21:58:54,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-10-01 21:58:54,498 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 308 [2019-10-01 21:58:54,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:58:54,499 INFO L225 Difference]: With dead ends: 314 [2019-10-01 21:58:54,499 INFO L226 Difference]: Without dead ends: 226 [2019-10-01 21:58:54,499 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-10-01 21:58:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-01 21:58:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-10-01 21:58:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-01 21:58:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 229 transitions. [2019-10-01 21:58:54,505 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 229 transitions. Word has length 308 [2019-10-01 21:58:54,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:58:54,506 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 229 transitions. [2019-10-01 21:58:54,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-01 21:58:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2019-10-01 21:58:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-01 21:58:54,507 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:58:54,508 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:58:54,508 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:58:54,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:58:54,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1855289845, now seen corresponding path program 63 times [2019-10-01 21:58:54,508 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:58:54,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:58:54,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:54,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:58:54,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:58:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:58:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7892 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 21:58:56,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:58:56,197 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:58:56,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 21:58:59,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 21:58:59,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:58:59,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 21:58:59,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:59:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7892 backedges. 1530 proven. 289 refuted. 0 times theorem prover too weak. 6073 trivial. 0 not checked. [2019-10-01 21:59:00,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:59:00,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 20] total 86 [2019-10-01 21:59:00,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-10-01 21:59:00,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-10-01 21:59:00,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2467, Invalid=4843, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 21:59:00,130 INFO L87 Difference]: Start difference. First operand 225 states and 229 transitions. Second operand 86 states. [2019-10-01 21:59:00,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:59:00,454 INFO L93 Difference]: Finished difference Result 319 states and 328 transitions. [2019-10-01 21:59:00,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-10-01 21:59:00,455 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 310 [2019-10-01 21:59:00,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:59:00,456 INFO L225 Difference]: With dead ends: 319 [2019-10-01 21:59:00,457 INFO L226 Difference]: Without dead ends: 231 [2019-10-01 21:59:00,458 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2467, Invalid=4843, Unknown=0, NotChecked=0, Total=7310 [2019-10-01 21:59:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-01 21:59:00,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2019-10-01 21:59:00,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-01 21:59:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 233 transitions. [2019-10-01 21:59:00,463 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 233 transitions. Word has length 310 [2019-10-01 21:59:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:59:00,463 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 233 transitions. [2019-10-01 21:59:00,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-10-01 21:59:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2019-10-01 21:59:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-01 21:59:00,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:59:00,465 INFO L411 BasicCegarLoop]: trace histogram [66, 66, 57, 57, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:59:00,465 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:59:00,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:59:00,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1211481429, now seen corresponding path program 64 times [2019-10-01 21:59:00,466 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:59:00,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:59:00,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:00,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:59:00,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:59:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 3702 trivial. 0 not checked. [2019-10-01 21:59:02,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:59:02,157 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:59:02,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 21:59:02,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 21:59:02,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 21:59:02,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 21:59:02,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 21:59:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 1528 proven. 361 refuted. 0 times theorem prover too weak. 6169 trivial. 0 not checked. [2019-10-01 21:59:03,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 21:59:03,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 22] total 89 [2019-10-01 21:59:03,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-10-01 21:59:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-10-01 21:59:03,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2576, Invalid=5256, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 21:59:03,110 INFO L87 Difference]: Start difference. First operand 229 states and 233 transitions. Second operand 89 states. [2019-10-01 21:59:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 21:59:03,516 INFO L93 Difference]: Finished difference Result 325 states and 337 transitions. [2019-10-01 21:59:03,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-01 21:59:03,517 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 314 [2019-10-01 21:59:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 21:59:03,518 INFO L225 Difference]: With dead ends: 325 [2019-10-01 21:59:03,518 INFO L226 Difference]: Without dead ends: 235 [2019-10-01 21:59:03,519 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2576, Invalid=5256, Unknown=0, NotChecked=0, Total=7832 [2019-10-01 21:59:03,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-01 21:59:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2019-10-01 21:59:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-01 21:59:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 237 transitions. [2019-10-01 21:59:03,524 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 237 transitions. Word has length 314 [2019-10-01 21:59:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 21:59:03,524 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 237 transitions. [2019-10-01 21:59:03,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-10-01 21:59:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2019-10-01 21:59:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-01 21:59:03,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 21:59:03,526 INFO L411 BasicCegarLoop]: trace histogram [67, 67, 60, 60, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 21:59:03,526 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 21:59:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 21:59:03,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1864824725, now seen corresponding path program 65 times [2019-10-01 21:59:03,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 21:59:03,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 21:59:03,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:03,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 21:59:03,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 21:59:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 21:59:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8548 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 4059 trivial. 0 not checked. [2019-10-01 21:59:05,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 21:59:05,296 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 21:59:05,417 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1