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/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:13:32,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:13:32,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:13:32,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:13:32,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:13:32,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:13:32,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:13:32,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:13:32,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:13:32,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:13:32,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:13:32,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:13:32,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:13:32,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:13:32,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:13:32,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:13:32,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:13:32,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:13:32,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:13:32,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:13:32,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:13:32,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:13:32,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:13:32,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:13:32,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:13:32,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:13:32,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:13:32,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:13:32,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:13:32,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:13:32,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:13:32,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:13:32,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:13:32,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:13:32,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:13:32,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:13:32,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:13:32,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:13:32,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:13:32,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:13:32,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:13:32,565 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 11:13:32,601 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:13:32,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:13:32,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:13:32,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:13:32,604 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:13:32,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:13:32,604 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:13:32,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:13:32,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:13:32,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:13:32,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:13:32,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:13:32,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:13:32,605 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:13:32,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:13:32,606 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:13:32,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:13:32,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:13:32,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:13:32,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:13:32,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:13:32,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:13:32,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:13:32,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:13:32,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:13:32,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:13:32,608 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:13:32,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:13:32,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:13:32,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:13:32,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:13:32,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:13:32,662 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:13:32,662 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:13:32,663 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 11:13:32,737 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0231152/7cb101d843074b82947e061346bb6e17/FLAGc7f3e9544 [2019-09-08 11:13:33,277 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:13:33,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 11:13:33,305 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0231152/7cb101d843074b82947e061346bb6e17/FLAGc7f3e9544 [2019-09-08 11:13:33,629 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0231152/7cb101d843074b82947e061346bb6e17 [2019-09-08 11:13:33,642 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:13:33,643 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:13:33,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:13:33,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:13:33,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:13:33,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:13:33" (1/1) ... [2019-09-08 11:13:33,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15aa9930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:33, skipping insertion in model container [2019-09-08 11:13:33,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:13:33" (1/1) ... [2019-09-08 11:13:33,659 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:13:33,720 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:13:34,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:13:34,105 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:13:34,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:13:34,225 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:13:34,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:34 WrapperNode [2019-09-08 11:13:34,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:13:34,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:13:34,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:13:34,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:13:34,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:34" (1/1) ... [2019-09-08 11:13:34,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:34" (1/1) ... [2019-09-08 11:13:34,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:34" (1/1) ... [2019-09-08 11:13:34,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:34" (1/1) ... [2019-09-08 11:13:34,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:34" (1/1) ... [2019-09-08 11:13:34,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:34" (1/1) ... [2019-09-08 11:13:34,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:34" (1/1) ... [2019-09-08 11:13:34,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:13:34,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:13:34,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:13:34,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:13:34,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:13:34,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:13:34,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:13:34,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:13:34,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:13:34,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:13:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:13:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:13:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:13:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:13:34,362 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:13:34,363 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:13:34,363 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:13:34,363 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:13:34,363 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:13:34,363 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:13:34,363 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:13:34,364 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:13:34,364 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:13:34,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:13:34,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:13:35,185 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:13:35,186 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:13:35,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:13:35 BoogieIcfgContainer [2019-09-08 11:13:35,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:13:35,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:13:35,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:13:35,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:13:35,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:13:33" (1/3) ... [2019-09-08 11:13:35,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c69ff8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:13:35, skipping insertion in model container [2019-09-08 11:13:35,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:34" (2/3) ... [2019-09-08 11:13:35,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c69ff8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:13:35, skipping insertion in model container [2019-09-08 11:13:35,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:13:35" (3/3) ... [2019-09-08 11:13:35,201 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 11:13:35,212 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:13:35,235 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:13:35,251 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:13:35,287 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:13:35,288 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:13:35,288 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:13:35,288 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:13:35,288 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:13:35,288 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:13:35,289 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:13:35,289 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:13:35,289 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:13:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-09-08 11:13:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:13:35,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:35,321 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:35,323 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:35,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1503365547, now seen corresponding path program 1 times [2019-09-08 11:13:35,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:35,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:35,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:35,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:35,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:35,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:35,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:35,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:35,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:35,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:35,872 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-09-08 11:13:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:35,969 INFO L93 Difference]: Finished difference Result 329 states and 529 transitions. [2019-09-08 11:13:35,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:35,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 11:13:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:35,997 INFO L225 Difference]: With dead ends: 329 [2019-09-08 11:13:35,998 INFO L226 Difference]: Without dead ends: 219 [2019-09-08 11:13:36,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:36,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-08 11:13:36,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-09-08 11:13:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-08 11:13:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 323 transitions. [2019-09-08 11:13:36,099 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 323 transitions. Word has length 64 [2019-09-08 11:13:36,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:36,100 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 323 transitions. [2019-09-08 11:13:36,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 323 transitions. [2019-09-08 11:13:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:13:36,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:36,103 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:36,104 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:36,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:36,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1067938911, now seen corresponding path program 1 times [2019-09-08 11:13:36,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:36,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:36,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:36,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:36,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:36,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:36,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:36,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:36,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:36,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:36,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:36,262 INFO L87 Difference]: Start difference. First operand 217 states and 323 transitions. Second operand 3 states. [2019-09-08 11:13:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:36,360 INFO L93 Difference]: Finished difference Result 541 states and 839 transitions. [2019-09-08 11:13:36,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:36,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 11:13:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:36,367 INFO L225 Difference]: With dead ends: 541 [2019-09-08 11:13:36,368 INFO L226 Difference]: Without dead ends: 363 [2019-09-08 11:13:36,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-08 11:13:36,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2019-09-08 11:13:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-08 11:13:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 552 transitions. [2019-09-08 11:13:36,407 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 552 transitions. Word has length 65 [2019-09-08 11:13:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:36,408 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 552 transitions. [2019-09-08 11:13:36,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 552 transitions. [2019-09-08 11:13:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:13:36,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:36,411 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:36,411 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2132718422, now seen corresponding path program 1 times [2019-09-08 11:13:36,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:36,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:36,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:36,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:36,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:36,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:36,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:36,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:36,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:36,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:36,527 INFO L87 Difference]: Start difference. First operand 361 states and 552 transitions. Second operand 3 states. [2019-09-08 11:13:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:36,588 INFO L93 Difference]: Finished difference Result 941 states and 1474 transitions. [2019-09-08 11:13:36,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:36,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 11:13:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:36,593 INFO L225 Difference]: With dead ends: 941 [2019-09-08 11:13:36,593 INFO L226 Difference]: Without dead ends: 619 [2019-09-08 11:13:36,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-09-08 11:13:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2019-09-08 11:13:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-08 11:13:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 956 transitions. [2019-09-08 11:13:36,642 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 956 transitions. Word has length 66 [2019-09-08 11:13:36,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:36,645 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 956 transitions. [2019-09-08 11:13:36,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 956 transitions. [2019-09-08 11:13:36,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:13:36,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:36,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:36,650 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:36,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:36,650 INFO L82 PathProgramCache]: Analyzing trace with hash -523046956, now seen corresponding path program 1 times [2019-09-08 11:13:36,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:36,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:36,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:36,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:36,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:36,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:36,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:36,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:36,761 INFO L87 Difference]: Start difference. First operand 617 states and 956 transitions. Second operand 3 states. [2019-09-08 11:13:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:36,827 INFO L93 Difference]: Finished difference Result 1645 states and 2582 transitions. [2019-09-08 11:13:36,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:36,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 11:13:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:36,834 INFO L225 Difference]: With dead ends: 1645 [2019-09-08 11:13:36,835 INFO L226 Difference]: Without dead ends: 1067 [2019-09-08 11:13:36,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:36,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-09-08 11:13:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1065. [2019-09-08 11:13:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-09-08 11:13:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1656 transitions. [2019-09-08 11:13:36,899 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1656 transitions. Word has length 67 [2019-09-08 11:13:36,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:36,921 INFO L475 AbstractCegarLoop]: Abstraction has 1065 states and 1656 transitions. [2019-09-08 11:13:36,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:36,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1656 transitions. [2019-09-08 11:13:36,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:13:36,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:36,924 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:36,924 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:36,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:36,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1868074219, now seen corresponding path program 1 times [2019-09-08 11:13:36,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:36,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:36,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:36,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:36,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:37,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:37,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:37,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:37,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:37,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:37,007 INFO L87 Difference]: Start difference. First operand 1065 states and 1656 transitions. Second operand 3 states. [2019-09-08 11:13:37,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:37,092 INFO L93 Difference]: Finished difference Result 2861 states and 4474 transitions. [2019-09-08 11:13:37,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:37,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 11:13:37,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:37,103 INFO L225 Difference]: With dead ends: 2861 [2019-09-08 11:13:37,104 INFO L226 Difference]: Without dead ends: 1835 [2019-09-08 11:13:37,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-09-08 11:13:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1833. [2019-09-08 11:13:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1833 states. [2019-09-08 11:13:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2840 transitions. [2019-09-08 11:13:37,191 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2840 transitions. Word has length 68 [2019-09-08 11:13:37,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:37,191 INFO L475 AbstractCegarLoop]: Abstraction has 1833 states and 2840 transitions. [2019-09-08 11:13:37,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:37,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2840 transitions. [2019-09-08 11:13:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:13:37,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:37,193 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:37,193 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:37,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1423874723, now seen corresponding path program 1 times [2019-09-08 11:13:37,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:37,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:37,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:37,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:37,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:37,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:37,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:13:37,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:13:37,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:13:37,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:37,464 INFO L87 Difference]: Start difference. First operand 1833 states and 2840 transitions. Second operand 7 states. [2019-09-08 11:13:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:38,099 INFO L93 Difference]: Finished difference Result 9443 states and 14605 transitions. [2019-09-08 11:13:38,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:13:38,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-08 11:13:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:38,140 INFO L225 Difference]: With dead ends: 9443 [2019-09-08 11:13:38,140 INFO L226 Difference]: Without dead ends: 7649 [2019-09-08 11:13:38,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2019-09-08 11:13:38,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 7641. [2019-09-08 11:13:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7641 states. [2019-09-08 11:13:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7641 states to 7641 states and 11768 transitions. [2019-09-08 11:13:38,787 INFO L78 Accepts]: Start accepts. Automaton has 7641 states and 11768 transitions. Word has length 69 [2019-09-08 11:13:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:38,789 INFO L475 AbstractCegarLoop]: Abstraction has 7641 states and 11768 transitions. [2019-09-08 11:13:38,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:13:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 7641 states and 11768 transitions. [2019-09-08 11:13:38,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:13:38,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:38,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:38,791 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:38,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:38,792 INFO L82 PathProgramCache]: Analyzing trace with hash -500644588, now seen corresponding path program 1 times [2019-09-08 11:13:38,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:38,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:38,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:38,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:38,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:38,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:38,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:13:38,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:13:38,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:13:38,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:13:38,953 INFO L87 Difference]: Start difference. First operand 7641 states and 11768 transitions. Second operand 5 states. [2019-09-08 11:13:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:40,156 INFO L93 Difference]: Finished difference Result 21517 states and 33194 transitions. [2019-09-08 11:13:40,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:13:40,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:13:40,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:40,247 INFO L225 Difference]: With dead ends: 21517 [2019-09-08 11:13:40,248 INFO L226 Difference]: Without dead ends: 13915 [2019-09-08 11:13:40,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13915 states. [2019-09-08 11:13:41,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13915 to 13913. [2019-09-08 11:13:41,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13913 states. [2019-09-08 11:13:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13913 states to 13913 states and 21320 transitions. [2019-09-08 11:13:41,213 INFO L78 Accepts]: Start accepts. Automaton has 13913 states and 21320 transitions. Word has length 71 [2019-09-08 11:13:41,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:41,213 INFO L475 AbstractCegarLoop]: Abstraction has 13913 states and 21320 transitions. [2019-09-08 11:13:41,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:13:41,214 INFO L276 IsEmpty]: Start isEmpty. Operand 13913 states and 21320 transitions. [2019-09-08 11:13:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:13:41,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:41,215 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:41,215 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:41,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:41,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1116860303, now seen corresponding path program 1 times [2019-09-08 11:13:41,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:41,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:41,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:41,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:41,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:41,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:41,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:13:41,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:13:41,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:13:41,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:41,401 INFO L87 Difference]: Start difference. First operand 13913 states and 21320 transitions. Second operand 7 states. [2019-09-08 11:13:44,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:44,605 INFO L93 Difference]: Finished difference Result 73989 states and 113550 transitions. [2019-09-08 11:13:44,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:13:44,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-08 11:13:44,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:44,759 INFO L225 Difference]: With dead ends: 73989 [2019-09-08 11:13:44,760 INFO L226 Difference]: Without dead ends: 60115 [2019-09-08 11:13:44,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:13:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60115 states. [2019-09-08 11:13:46,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60115 to 27785. [2019-09-08 11:13:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27785 states. [2019-09-08 11:13:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27785 states to 27785 states and 42024 transitions. [2019-09-08 11:13:46,989 INFO L78 Accepts]: Start accepts. Automaton has 27785 states and 42024 transitions. Word has length 71 [2019-09-08 11:13:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:46,990 INFO L475 AbstractCegarLoop]: Abstraction has 27785 states and 42024 transitions. [2019-09-08 11:13:46,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:13:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 27785 states and 42024 transitions. [2019-09-08 11:13:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:13:46,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:46,992 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:46,992 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:46,992 INFO L82 PathProgramCache]: Analyzing trace with hash 244398304, now seen corresponding path program 1 times [2019-09-08 11:13:46,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:46,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:46,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:46,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:46,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:47,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:47,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:13:47,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:13:47,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:13:47,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:13:47,220 INFO L87 Difference]: Start difference. First operand 27785 states and 42024 transitions. Second operand 5 states. [2019-09-08 11:13:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:50,377 INFO L93 Difference]: Finished difference Result 56683 states and 85161 transitions. [2019-09-08 11:13:50,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:13:50,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 11:13:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:50,503 INFO L225 Difference]: With dead ends: 56683 [2019-09-08 11:13:50,503 INFO L226 Difference]: Without dead ends: 56681 [2019-09-08 11:13:50,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:13:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56681 states. [2019-09-08 11:13:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56681 to 28937. [2019-09-08 11:13:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28937 states. [2019-09-08 11:13:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28937 states to 28937 states and 43176 transitions. [2019-09-08 11:13:52,521 INFO L78 Accepts]: Start accepts. Automaton has 28937 states and 43176 transitions. Word has length 72 [2019-09-08 11:13:52,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:52,521 INFO L475 AbstractCegarLoop]: Abstraction has 28937 states and 43176 transitions. [2019-09-08 11:13:52,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:13:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 28937 states and 43176 transitions. [2019-09-08 11:13:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:13:52,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:52,522 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:52,522 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:52,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:52,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1003967394, now seen corresponding path program 1 times [2019-09-08 11:13:52,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:52,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:52,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:52,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:52,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:52,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:52,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:52,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:52,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:52,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:52,584 INFO L87 Difference]: Start difference. First operand 28937 states and 43176 transitions. Second operand 3 states. [2019-09-08 11:13:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:54,488 INFO L93 Difference]: Finished difference Result 65151 states and 97020 transitions. [2019-09-08 11:13:54,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:54,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 11:13:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:54,543 INFO L225 Difference]: With dead ends: 65151 [2019-09-08 11:13:54,544 INFO L226 Difference]: Without dead ends: 36253 [2019-09-08 11:13:54,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36253 states. [2019-09-08 11:13:57,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36253 to 36251. [2019-09-08 11:13:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36251 states. [2019-09-08 11:13:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36251 states to 36251 states and 53738 transitions. [2019-09-08 11:13:57,248 INFO L78 Accepts]: Start accepts. Automaton has 36251 states and 53738 transitions. Word has length 73 [2019-09-08 11:13:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:57,249 INFO L475 AbstractCegarLoop]: Abstraction has 36251 states and 53738 transitions. [2019-09-08 11:13:57,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 36251 states and 53738 transitions. [2019-09-08 11:13:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:13:57,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:57,267 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:57,267 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:57,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:57,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2145575447, now seen corresponding path program 1 times [2019-09-08 11:13:57,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:57,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:57,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:57,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:57,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:13:57,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:13:57,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:13:57,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:57,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 11:13:57,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:13:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 11:13:57,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:13:57,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10] total 11 [2019-09-08 11:13:57,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:13:57,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:13:57,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=60, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:13:57,799 INFO L87 Difference]: Start difference. First operand 36251 states and 53738 transitions. Second operand 11 states. [2019-09-08 11:14:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:02,577 INFO L93 Difference]: Finished difference Result 97812 states and 145149 transitions. [2019-09-08 11:14:02,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:14:02,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-08 11:14:02,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:02,750 INFO L225 Difference]: With dead ends: 97812 [2019-09-08 11:14:02,751 INFO L226 Difference]: Without dead ends: 68914 [2019-09-08 11:14:02,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=60, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:14:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68914 states. [2019-09-08 11:14:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68914 to 63419. [2019-09-08 11:14:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63419 states. [2019-09-08 11:14:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63419 states to 63419 states and 93418 transitions. [2019-09-08 11:14:08,847 INFO L78 Accepts]: Start accepts. Automaton has 63419 states and 93418 transitions. Word has length 98 [2019-09-08 11:14:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:08,847 INFO L475 AbstractCegarLoop]: Abstraction has 63419 states and 93418 transitions. [2019-09-08 11:14:08,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:14:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 63419 states and 93418 transitions. [2019-09-08 11:14:08,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:14:08,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:08,866 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:14:08,866 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:08,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:08,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1615048955, now seen corresponding path program 1 times [2019-09-08 11:14:08,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:08,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:08,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:08,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:08,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:14:09,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:14:09,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:14:09,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:09,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:14:09,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:14:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 11:14:09,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:14:09,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:14:09,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:14:09,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:14:09,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:14:09,256 INFO L87 Difference]: Start difference. First operand 63419 states and 93418 transitions. Second operand 11 states. [2019-09-08 11:14:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:15,292 INFO L93 Difference]: Finished difference Result 144275 states and 210794 transitions. [2019-09-08 11:14:15,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:14:15,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-08 11:14:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:15,447 INFO L225 Difference]: With dead ends: 144275 [2019-09-08 11:14:15,447 INFO L226 Difference]: Without dead ends: 101257 [2019-09-08 11:14:15,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:14:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101257 states. [2019-09-08 11:14:21,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101257 to 66635. [2019-09-08 11:14:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66635 states. [2019-09-08 11:14:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66635 states to 66635 states and 97230 transitions. [2019-09-08 11:14:21,821 INFO L78 Accepts]: Start accepts. Automaton has 66635 states and 97230 transitions. Word has length 99 [2019-09-08 11:14:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:21,821 INFO L475 AbstractCegarLoop]: Abstraction has 66635 states and 97230 transitions. [2019-09-08 11:14:21,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:14:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 66635 states and 97230 transitions. [2019-09-08 11:14:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:14:21,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:21,836 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:14:21,836 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:21,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash -298429788, now seen corresponding path program 1 times [2019-09-08 11:14:21,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:21,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:21,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:21,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:21,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:14:21,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:21,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:14:21,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:14:21,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:14:21,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:14:21,907 INFO L87 Difference]: Start difference. First operand 66635 states and 97230 transitions. Second operand 3 states. [2019-09-08 11:14:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:27,177 INFO L93 Difference]: Finished difference Result 120581 states and 176274 transitions. [2019-09-08 11:14:27,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:14:27,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:14:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:27,593 INFO L225 Difference]: With dead ends: 120581 [2019-09-08 11:14:27,593 INFO L226 Difference]: Without dead ends: 89203 [2019-09-08 11:14:27,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:14:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89203 states. [2019-09-08 11:14:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89203 to 83185. [2019-09-08 11:14:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83185 states. [2019-09-08 11:14:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83185 states to 83185 states and 120344 transitions. [2019-09-08 11:14:34,468 INFO L78 Accepts]: Start accepts. Automaton has 83185 states and 120344 transitions. Word has length 99 [2019-09-08 11:14:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:34,468 INFO L475 AbstractCegarLoop]: Abstraction has 83185 states and 120344 transitions. [2019-09-08 11:14:34,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:14:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 83185 states and 120344 transitions. [2019-09-08 11:14:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:14:34,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:34,483 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:14:34,484 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:34,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:34,484 INFO L82 PathProgramCache]: Analyzing trace with hash -785265619, now seen corresponding path program 1 times [2019-09-08 11:14:34,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:34,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:34,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:34,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:34,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:14:34,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:34,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:14:34,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:14:34,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:14:34,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:14:34,548 INFO L87 Difference]: Start difference. First operand 83185 states and 120344 transitions. Second operand 3 states. [2019-09-08 11:14:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:40,402 INFO L93 Difference]: Finished difference Result 123881 states and 179049 transitions. [2019-09-08 11:14:40,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:14:40,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:14:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:40,505 INFO L225 Difference]: With dead ends: 123881 [2019-09-08 11:14:40,505 INFO L226 Difference]: Without dead ends: 87130 [2019-09-08 11:14:40,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:14:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87130 states. [2019-09-08 11:14:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87130 to 84069. [2019-09-08 11:14:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84069 states. [2019-09-08 11:14:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84069 states to 84069 states and 119954 transitions. [2019-09-08 11:14:47,543 INFO L78 Accepts]: Start accepts. Automaton has 84069 states and 119954 transitions. Word has length 99 [2019-09-08 11:14:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:47,543 INFO L475 AbstractCegarLoop]: Abstraction has 84069 states and 119954 transitions. [2019-09-08 11:14:47,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:14:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 84069 states and 119954 transitions. [2019-09-08 11:14:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:14:47,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:47,555 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:14:47,556 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:47,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:47,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1180021061, now seen corresponding path program 1 times [2019-09-08 11:14:47,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:47,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:47,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:14:47,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:47,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:14:47,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:14:47,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:14:47,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:14:47,620 INFO L87 Difference]: Start difference. First operand 84069 states and 119954 transitions. Second operand 3 states. [2019-09-08 11:14:56,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:56,247 INFO L93 Difference]: Finished difference Result 196368 states and 280583 transitions. [2019-09-08 11:14:56,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:14:56,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:14:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:56,413 INFO L225 Difference]: With dead ends: 196368 [2019-09-08 11:14:56,413 INFO L226 Difference]: Without dead ends: 131465 [2019-09-08 11:14:56,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:14:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131465 states. [2019-09-08 11:15:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131465 to 129338. [2019-09-08 11:15:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129338 states. [2019-09-08 11:15:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129338 states to 129338 states and 182964 transitions. [2019-09-08 11:15:07,003 INFO L78 Accepts]: Start accepts. Automaton has 129338 states and 182964 transitions. Word has length 99 [2019-09-08 11:15:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:07,004 INFO L475 AbstractCegarLoop]: Abstraction has 129338 states and 182964 transitions. [2019-09-08 11:15:07,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 129338 states and 182964 transitions. [2019-09-08 11:15:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:15:07,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:07,025 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:15:07,025 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:07,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:07,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2074205712, now seen corresponding path program 1 times [2019-09-08 11:15:07,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:07,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:07,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:07,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:07,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:07,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:07,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:07,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:07,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:07,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:07,099 INFO L87 Difference]: Start difference. First operand 129338 states and 182964 transitions. Second operand 3 states. [2019-09-08 11:15:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:25,903 INFO L93 Difference]: Finished difference Result 348898 states and 492167 transitions. [2019-09-08 11:15:25,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:25,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:15:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:26,245 INFO L225 Difference]: With dead ends: 348898 [2019-09-08 11:15:26,245 INFO L226 Difference]: Without dead ends: 225499 [2019-09-08 11:15:26,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:26,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225499 states. [2019-09-08 11:15:44,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225499 to 223952. [2019-09-08 11:15:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223952 states. [2019-09-08 11:15:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223952 states to 223952 states and 312878 transitions. [2019-09-08 11:15:44,893 INFO L78 Accepts]: Start accepts. Automaton has 223952 states and 312878 transitions. Word has length 99 [2019-09-08 11:15:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:44,893 INFO L475 AbstractCegarLoop]: Abstraction has 223952 states and 312878 transitions. [2019-09-08 11:15:44,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 223952 states and 312878 transitions. [2019-09-08 11:15:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:15:44,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:44,919 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:15:44,919 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:44,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1732651124, now seen corresponding path program 1 times [2019-09-08 11:15:44,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:44,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:44,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:45,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:15:45,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:15:45,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:45,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:15:45,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:15:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:45,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:15:45,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:15:45,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:15:45,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:15:45,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:15:45,242 INFO L87 Difference]: Start difference. First operand 223952 states and 312878 transitions. Second operand 11 states. [2019-09-08 11:16:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:35,417 INFO L93 Difference]: Finished difference Result 799241 states and 1115407 transitions. [2019-09-08 11:16:35,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:16:35,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-08 11:16:35,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:36,308 INFO L225 Difference]: With dead ends: 799241 [2019-09-08 11:16:36,308 INFO L226 Difference]: Without dead ends: 583941 [2019-09-08 11:16:36,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:16:36,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583941 states. [2019-09-08 11:17:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583941 to 258699. [2019-09-08 11:17:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258699 states. [2019-09-08 11:17:08,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258699 states to 258699 states and 361931 transitions. [2019-09-08 11:17:08,281 INFO L78 Accepts]: Start accepts. Automaton has 258699 states and 361931 transitions. Word has length 99 [2019-09-08 11:17:08,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:08,281 INFO L475 AbstractCegarLoop]: Abstraction has 258699 states and 361931 transitions. [2019-09-08 11:17:08,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:17:08,281 INFO L276 IsEmpty]: Start isEmpty. Operand 258699 states and 361931 transitions. [2019-09-08 11:17:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:17:08,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:08,301 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:17:08,301 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:08,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1368180918, now seen corresponding path program 1 times [2019-09-08 11:17:08,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:08,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:08,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:08,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:08,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 11:17:08,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:08,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:17:08,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:17:08,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:17:08,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:17:08,377 INFO L87 Difference]: Start difference. First operand 258699 states and 361931 transitions. Second operand 5 states. [2019-09-08 11:17:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:45,799 INFO L93 Difference]: Finished difference Result 644896 states and 900648 transitions. [2019-09-08 11:17:45,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:17:45,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:17:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:47,051 INFO L225 Difference]: With dead ends: 644896 [2019-09-08 11:17:47,051 INFO L226 Difference]: Without dead ends: 386312 [2019-09-08 11:17:47,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:17:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386312 states. [2019-09-08 11:18:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386312 to 384970. [2019-09-08 11:18:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384970 states. [2019-09-08 11:18:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384970 states to 384970 states and 534926 transitions. [2019-09-08 11:18:28,370 INFO L78 Accepts]: Start accepts. Automaton has 384970 states and 534926 transitions. Word has length 99 [2019-09-08 11:18:28,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:28,371 INFO L475 AbstractCegarLoop]: Abstraction has 384970 states and 534926 transitions. [2019-09-08 11:18:28,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:18:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 384970 states and 534926 transitions. [2019-09-08 11:18:28,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:18:28,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:28,397 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:18:28,397 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:28,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:28,398 INFO L82 PathProgramCache]: Analyzing trace with hash -343746299, now seen corresponding path program 1 times [2019-09-08 11:18:28,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:28,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:28,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:18:28,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:18:28,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:18:28,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:28,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:18:28,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:18:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 11:18:29,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:18:29,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:18:29,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:18:29,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:18:29,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:18:29,635 INFO L87 Difference]: Start difference. First operand 384970 states and 534926 transitions. Second operand 11 states. [2019-09-08 11:19:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:53,893 INFO L93 Difference]: Finished difference Result 1069315 states and 1483547 transitions. [2019-09-08 11:19:53,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:19:53,893 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-08 11:19:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:55,071 INFO L225 Difference]: With dead ends: 1069315 [2019-09-08 11:19:55,071 INFO L226 Difference]: Without dead ends: 749690 [2019-09-08 11:19:56,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:19:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749690 states. [2019-09-08 11:20:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749690 to 410339. [2019-09-08 11:20:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410339 states. [2019-09-08 11:20:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410339 states to 410339 states and 570416 transitions. [2019-09-08 11:20:49,215 INFO L78 Accepts]: Start accepts. Automaton has 410339 states and 570416 transitions. Word has length 99 [2019-09-08 11:20:49,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:20:49,215 INFO L475 AbstractCegarLoop]: Abstraction has 410339 states and 570416 transitions. [2019-09-08 11:20:49,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:20:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 410339 states and 570416 transitions. [2019-09-08 11:20:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:20:49,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:20:49,250 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:20:49,251 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:20:49,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:20:49,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1410724101, now seen corresponding path program 1 times [2019-09-08 11:20:49,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:20:49,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:20:49,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:49,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:20:49,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:20:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 11:20:49,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:20:49,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:20:49,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:20:49,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:20:49,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:20:49,333 INFO L87 Difference]: Start difference. First operand 410339 states and 570416 transitions. Second operand 5 states. [2019-09-08 11:21:59,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:59,798 INFO L93 Difference]: Finished difference Result 1028162 states and 1426729 transitions. [2019-09-08 11:22:00,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:22:00,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:22:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:22:01,250 INFO L225 Difference]: With dead ends: 1028162 [2019-09-08 11:22:01,251 INFO L226 Difference]: Without dead ends: 618031 [2019-09-08 11:22:01,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:22:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618031 states. [2019-09-08 11:23:26,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618031 to 616050. [2019-09-08 11:23:26,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616050 states. [2019-09-08 11:23:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616050 states to 616050 states and 850683 transitions. [2019-09-08 11:23:27,375 INFO L78 Accepts]: Start accepts. Automaton has 616050 states and 850683 transitions. Word has length 99 [2019-09-08 11:23:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:27,376 INFO L475 AbstractCegarLoop]: Abstraction has 616050 states and 850683 transitions. [2019-09-08 11:23:27,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:23:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 616050 states and 850683 transitions. [2019-09-08 11:23:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:23:27,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:27,408 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:27,408 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash -423295904, now seen corresponding path program 1 times [2019-09-08 11:23:27,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:27,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:27,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:27,501 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:27,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:23:27,502 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 11:23:27,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:23:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:27,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:23:27,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:23:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:27,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:23:27,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:23:27,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:23:27,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:23:27,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:23:27,743 INFO L87 Difference]: Start difference. First operand 616050 states and 850683 transitions. Second operand 11 states.