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.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:23:23,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:23:23,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:23:23,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:23:23,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:23:23,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:23:23,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:23:23,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:23:23,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:23:23,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:23:23,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:23:23,359 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:23:23,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:23:23,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:23:23,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:23:23,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:23:23,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:23:23,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:23:23,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:23:23,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:23:23,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:23:23,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:23:23,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:23:23,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:23:23,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:23:23,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:23:23,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:23:23,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:23:23,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:23:23,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:23:23,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:23:23,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:23:23,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:23:23,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:23:23,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:23:23,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:23:23,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:23:23,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:23:23,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:23:23,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:23:23,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:23:23,387 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 10:23:23,402 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:23:23,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:23:23,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:23:23,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:23:23,404 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:23:23,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:23:23,405 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:23:23,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:23:23,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:23:23,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:23:23,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:23:23,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:23:23,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:23:23,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:23:23,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:23:23,407 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:23:23,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:23:23,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:23:23,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:23:23,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:23:23,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:23:23,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:23:23,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:23:23,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:23:23,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:23:23,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:23:23,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:23:23,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:23:23,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:23:23,451 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:23:23,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:23:23,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:23:23,467 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:23:23,468 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:23:23,468 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.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 10:23:23,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/102628202/15c034f5479b4299bf2febe1b48497d6/FLAG6cc96988b [2019-09-08 10:23:24,145 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:23:24,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 10:23:24,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/102628202/15c034f5479b4299bf2febe1b48497d6/FLAG6cc96988b [2019-09-08 10:23:24,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/102628202/15c034f5479b4299bf2febe1b48497d6 [2019-09-08 10:23:24,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:23:24,369 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:23:24,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:23:24,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:23:24,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:23:24,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:23:24" (1/1) ... [2019-09-08 10:23:24,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc34360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:24, skipping insertion in model container [2019-09-08 10:23:24,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:23:24" (1/1) ... [2019-09-08 10:23:24,390 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:23:24,491 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:23:25,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:23:25,216 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:23:25,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:23:25,683 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:23:25,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:25 WrapperNode [2019-09-08 10:23:25,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:23:25,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:23:25,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:23:25,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:23:25,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:25" (1/1) ... [2019-09-08 10:23:25,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:25" (1/1) ... [2019-09-08 10:23:25,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:25" (1/1) ... [2019-09-08 10:23:25,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:25" (1/1) ... [2019-09-08 10:23:25,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:25" (1/1) ... [2019-09-08 10:23:25,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:25" (1/1) ... [2019-09-08 10:23:25,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:25" (1/1) ... [2019-09-08 10:23:25,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:23:25,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:23:25,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:23:25,820 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:23:25,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:25" (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 10:23:25,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:23:25,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:23:25,905 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:23:25,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:23:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:23:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:23:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:23:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:23:25,907 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:23:25,907 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:23:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:23:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:23:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:23:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:23:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:23:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:23:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:23:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:23:28,005 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:23:28,005 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:23:28,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:23:28 BoogieIcfgContainer [2019-09-08 10:23:28,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:23:28,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:23:28,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:23:28,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:23:28,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:23:24" (1/3) ... [2019-09-08 10:23:28,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb8be72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:23:28, skipping insertion in model container [2019-09-08 10:23:28,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:23:25" (2/3) ... [2019-09-08 10:23:28,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb8be72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:23:28, skipping insertion in model container [2019-09-08 10:23:28,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:23:28" (3/3) ... [2019-09-08 10:23:28,015 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 10:23:28,026 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:23:28,035 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-08 10:23:28,057 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-08 10:23:28,110 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:23:28,110 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:23:28,111 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:23:28,111 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:23:28,111 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:23:28,111 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:23:28,111 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:23:28,111 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:23:28,111 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:23:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states. [2019-09-08 10:23:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 10:23:28,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:28,181 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] [2019-09-08 10:23:28,183 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:28,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:28,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1062699127, now seen corresponding path program 1 times [2019-09-08 10:23:28,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:28,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:28,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:28,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:28,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:28,678 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 10:23:28,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:28,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:23:28,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:23:28,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:23:28,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:23:28,704 INFO L87 Difference]: Start difference. First operand 447 states. Second operand 3 states. [2019-09-08 10:23:28,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:28,855 INFO L93 Difference]: Finished difference Result 697 states and 1222 transitions. [2019-09-08 10:23:28,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:23:28,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-08 10:23:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:28,886 INFO L225 Difference]: With dead ends: 697 [2019-09-08 10:23:28,887 INFO L226 Difference]: Without dead ends: 550 [2019-09-08 10:23:28,895 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 10:23:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-09-08 10:23:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 544. [2019-09-08 10:23:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-08 10:23:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 719 transitions. [2019-09-08 10:23:28,998 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 719 transitions. Word has length 54 [2019-09-08 10:23:28,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:28,999 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 719 transitions. [2019-09-08 10:23:28,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:23:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 719 transitions. [2019-09-08 10:23:29,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 10:23:29,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:29,003 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] [2019-09-08 10:23:29,004 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:29,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:29,005 INFO L82 PathProgramCache]: Analyzing trace with hash -194729860, now seen corresponding path program 1 times [2019-09-08 10:23:29,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:29,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:29,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:29,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:29,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:29,234 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 10:23:29,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:29,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:23:29,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:23:29,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:23:29,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:23:29,239 INFO L87 Difference]: Start difference. First operand 544 states and 719 transitions. Second operand 3 states. [2019-09-08 10:23:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:29,330 INFO L93 Difference]: Finished difference Result 959 states and 1321 transitions. [2019-09-08 10:23:29,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:23:29,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-08 10:23:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:29,336 INFO L225 Difference]: With dead ends: 959 [2019-09-08 10:23:29,336 INFO L226 Difference]: Without dead ends: 718 [2019-09-08 10:23:29,341 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 10:23:29,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-09-08 10:23:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 712. [2019-09-08 10:23:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-08 10:23:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 957 transitions. [2019-09-08 10:23:29,397 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 957 transitions. Word has length 54 [2019-09-08 10:23:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:29,398 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 957 transitions. [2019-09-08 10:23:29,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:23:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 957 transitions. [2019-09-08 10:23:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 10:23:29,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:29,406 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] [2019-09-08 10:23:29,406 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:29,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash 509758050, now seen corresponding path program 1 times [2019-09-08 10:23:29,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:29,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:29,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:29,619 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 10:23:29,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:29,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:23:29,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:23:29,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:23:29,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:23:29,621 INFO L87 Difference]: Start difference. First operand 712 states and 957 transitions. Second operand 6 states. [2019-09-08 10:23:30,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:30,246 INFO L93 Difference]: Finished difference Result 1613 states and 2241 transitions. [2019-09-08 10:23:30,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:23:30,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-09-08 10:23:30,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:30,253 INFO L225 Difference]: With dead ends: 1613 [2019-09-08 10:23:30,254 INFO L226 Difference]: Without dead ends: 1071 [2019-09-08 10:23:30,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:23:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2019-09-08 10:23:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1055. [2019-09-08 10:23:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-09-08 10:23:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1470 transitions. [2019-09-08 10:23:30,320 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1470 transitions. Word has length 54 [2019-09-08 10:23:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:30,321 INFO L475 AbstractCegarLoop]: Abstraction has 1055 states and 1470 transitions. [2019-09-08 10:23:30,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:23:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1470 transitions. [2019-09-08 10:23:30,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:23:30,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:30,323 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] [2019-09-08 10:23:30,324 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:30,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:30,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1420674109, now seen corresponding path program 1 times [2019-09-08 10:23:30,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:30,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:30,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:30,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:30,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:30,417 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 10:23:30,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:30,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:23:30,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:23:30,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:23:30,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:23:30,419 INFO L87 Difference]: Start difference. First operand 1055 states and 1470 transitions. Second operand 3 states. [2019-09-08 10:23:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:30,607 INFO L93 Difference]: Finished difference Result 2394 states and 3398 transitions. [2019-09-08 10:23:30,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:23:30,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-08 10:23:30,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:30,617 INFO L225 Difference]: With dead ends: 2394 [2019-09-08 10:23:30,617 INFO L226 Difference]: Without dead ends: 1689 [2019-09-08 10:23:30,619 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 10:23:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2019-09-08 10:23:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1682. [2019-09-08 10:23:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-09-08 10:23:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2337 transitions. [2019-09-08 10:23:30,703 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2337 transitions. Word has length 55 [2019-09-08 10:23:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:30,704 INFO L475 AbstractCegarLoop]: Abstraction has 1682 states and 2337 transitions. [2019-09-08 10:23:30,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:23:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2337 transitions. [2019-09-08 10:23:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:23:30,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:30,707 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] [2019-09-08 10:23:30,707 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:30,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:30,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1526715040, now seen corresponding path program 1 times [2019-09-08 10:23:30,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:30,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:30,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:30,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:30,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:30,798 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 10:23:30,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:30,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:23:30,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:23:30,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:23:30,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:23:30,800 INFO L87 Difference]: Start difference. First operand 1682 states and 2337 transitions. Second operand 5 states. [2019-09-08 10:23:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:31,283 INFO L93 Difference]: Finished difference Result 3701 states and 5187 transitions. [2019-09-08 10:23:31,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:23:31,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-08 10:23:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:31,295 INFO L225 Difference]: With dead ends: 3701 [2019-09-08 10:23:31,295 INFO L226 Difference]: Without dead ends: 2204 [2019-09-08 10:23:31,299 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 10:23:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2019-09-08 10:23:31,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1614. [2019-09-08 10:23:31,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2019-09-08 10:23:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2236 transitions. [2019-09-08 10:23:31,413 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2236 transitions. Word has length 55 [2019-09-08 10:23:31,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:31,415 INFO L475 AbstractCegarLoop]: Abstraction has 1614 states and 2236 transitions. [2019-09-08 10:23:31,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:23:31,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2236 transitions. [2019-09-08 10:23:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:23:31,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:31,418 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] [2019-09-08 10:23:31,418 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:31,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1576357576, now seen corresponding path program 1 times [2019-09-08 10:23:31,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:31,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:31,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:31,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:31,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:31,583 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 10:23:31,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:31,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:23:31,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:23:31,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:23:31,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:23:31,585 INFO L87 Difference]: Start difference. First operand 1614 states and 2236 transitions. Second operand 6 states. [2019-09-08 10:23:32,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:32,222 INFO L93 Difference]: Finished difference Result 4594 states and 6422 transitions. [2019-09-08 10:23:32,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:23:32,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-08 10:23:32,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:32,238 INFO L225 Difference]: With dead ends: 4594 [2019-09-08 10:23:32,238 INFO L226 Difference]: Without dead ends: 3103 [2019-09-08 10:23:32,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:23:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2019-09-08 10:23:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 3068. [2019-09-08 10:23:32,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3068 states. [2019-09-08 10:23:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4275 transitions. [2019-09-08 10:23:32,412 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4275 transitions. Word has length 55 [2019-09-08 10:23:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:32,414 INFO L475 AbstractCegarLoop]: Abstraction has 3068 states and 4275 transitions. [2019-09-08 10:23:32,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:23:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4275 transitions. [2019-09-08 10:23:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:23:32,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:32,417 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] [2019-09-08 10:23:32,417 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:32,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:32,417 INFO L82 PathProgramCache]: Analyzing trace with hash -802335602, now seen corresponding path program 1 times [2019-09-08 10:23:32,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:32,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:32,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:32,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:32,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:32,554 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 10:23:32,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:32,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:23:32,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:23:32,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:23:32,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:23:32,556 INFO L87 Difference]: Start difference. First operand 3068 states and 4275 transitions. Second operand 7 states. [2019-09-08 10:23:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:33,937 INFO L93 Difference]: Finished difference Result 11709 states and 16579 transitions. [2019-09-08 10:23:33,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:23:33,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-09-08 10:23:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:33,988 INFO L225 Difference]: With dead ends: 11709 [2019-09-08 10:23:33,988 INFO L226 Difference]: Without dead ends: 10657 [2019-09-08 10:23:33,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:23:34,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10657 states. [2019-09-08 10:23:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10657 to 3080. [2019-09-08 10:23:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-09-08 10:23:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4291 transitions. [2019-09-08 10:23:34,333 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4291 transitions. Word has length 56 [2019-09-08 10:23:34,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:34,334 INFO L475 AbstractCegarLoop]: Abstraction has 3080 states and 4291 transitions. [2019-09-08 10:23:34,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:23:34,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4291 transitions. [2019-09-08 10:23:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:23:34,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:34,336 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] [2019-09-08 10:23:34,337 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:34,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:34,337 INFO L82 PathProgramCache]: Analyzing trace with hash 766092927, now seen corresponding path program 1 times [2019-09-08 10:23:34,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:34,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:34,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:34,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:34,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:34,474 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 10:23:34,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:34,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:23:34,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:23:34,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:23:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:23:34,476 INFO L87 Difference]: Start difference. First operand 3080 states and 4291 transitions. Second operand 7 states. [2019-09-08 10:23:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:36,170 INFO L93 Difference]: Finished difference Result 11378 states and 16158 transitions. [2019-09-08 10:23:36,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:23:36,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-08 10:23:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:36,216 INFO L225 Difference]: With dead ends: 11378 [2019-09-08 10:23:36,217 INFO L226 Difference]: Without dead ends: 10172 [2019-09-08 10:23:36,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:23:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10172 states. [2019-09-08 10:23:36,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10172 to 3102. [2019-09-08 10:23:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2019-09-08 10:23:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 4322 transitions. [2019-09-08 10:23:36,660 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 4322 transitions. Word has length 57 [2019-09-08 10:23:36,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:36,661 INFO L475 AbstractCegarLoop]: Abstraction has 3102 states and 4322 transitions. [2019-09-08 10:23:36,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:23:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 4322 transitions. [2019-09-08 10:23:36,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:23:36,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:36,664 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] [2019-09-08 10:23:36,664 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:36,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:36,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1529152438, now seen corresponding path program 1 times [2019-09-08 10:23:36,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:36,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:36,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:36,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:36,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:36,777 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 10:23:36,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:36,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:23:36,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:23:36,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:23:36,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:23:36,779 INFO L87 Difference]: Start difference. First operand 3102 states and 4322 transitions. Second operand 7 states. [2019-09-08 10:23:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:38,209 INFO L93 Difference]: Finished difference Result 10412 states and 14674 transitions. [2019-09-08 10:23:38,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:23:38,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-08 10:23:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:38,242 INFO L225 Difference]: With dead ends: 10412 [2019-09-08 10:23:38,243 INFO L226 Difference]: Without dead ends: 8973 [2019-09-08 10:23:38,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:23:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8973 states. [2019-09-08 10:23:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8973 to 3116. [2019-09-08 10:23:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2019-09-08 10:23:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4340 transitions. [2019-09-08 10:23:38,610 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4340 transitions. Word has length 57 [2019-09-08 10:23:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:38,610 INFO L475 AbstractCegarLoop]: Abstraction has 3116 states and 4340 transitions. [2019-09-08 10:23:38,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:23:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4340 transitions. [2019-09-08 10:23:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:23:38,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:38,614 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] [2019-09-08 10:23:38,614 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1372855825, now seen corresponding path program 1 times [2019-09-08 10:23:38,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:38,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:38,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:38,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:38,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:38,855 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 10:23:38,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:38,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:23:38,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:23:38,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:23:38,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:23:38,857 INFO L87 Difference]: Start difference. First operand 3116 states and 4340 transitions. Second operand 8 states. [2019-09-08 10:23:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:40,292 INFO L93 Difference]: Finished difference Result 8302 states and 11738 transitions. [2019-09-08 10:23:40,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:23:40,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-09-08 10:23:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:40,307 INFO L225 Difference]: With dead ends: 8302 [2019-09-08 10:23:40,307 INFO L226 Difference]: Without dead ends: 5843 [2019-09-08 10:23:40,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:23:40,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5843 states. [2019-09-08 10:23:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5843 to 3116. [2019-09-08 10:23:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2019-09-08 10:23:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 4335 transitions. [2019-09-08 10:23:40,614 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 4335 transitions. Word has length 58 [2019-09-08 10:23:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:40,614 INFO L475 AbstractCegarLoop]: Abstraction has 3116 states and 4335 transitions. [2019-09-08 10:23:40,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:23:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 4335 transitions. [2019-09-08 10:23:40,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:23:40,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:40,617 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] [2019-09-08 10:23:40,617 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:40,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:40,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2054142204, now seen corresponding path program 1 times [2019-09-08 10:23:40,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:40,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:40,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:40,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:40,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:40,802 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 10:23:40,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:40,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:23:40,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:23:40,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:23:40,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:23:40,804 INFO L87 Difference]: Start difference. First operand 3116 states and 4335 transitions. Second operand 9 states. [2019-09-08 10:23:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:43,007 INFO L93 Difference]: Finished difference Result 12163 states and 17386 transitions. [2019-09-08 10:23:43,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 10:23:43,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-08 10:23:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:43,030 INFO L225 Difference]: With dead ends: 12163 [2019-09-08 10:23:43,031 INFO L226 Difference]: Without dead ends: 9971 [2019-09-08 10:23:43,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 10:23:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9971 states. [2019-09-08 10:23:43,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9971 to 3082. [2019-09-08 10:23:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2019-09-08 10:23:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4289 transitions. [2019-09-08 10:23:43,359 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4289 transitions. Word has length 58 [2019-09-08 10:23:43,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:43,360 INFO L475 AbstractCegarLoop]: Abstraction has 3082 states and 4289 transitions. [2019-09-08 10:23:43,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:23:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4289 transitions. [2019-09-08 10:23:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:23:43,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:43,363 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] [2019-09-08 10:23:43,363 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:43,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:43,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1186764508, now seen corresponding path program 1 times [2019-09-08 10:23:43,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:43,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:43,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:43,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:43,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:43,535 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 10:23:43,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:43,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:23:43,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:23:43,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:23:43,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:23:43,537 INFO L87 Difference]: Start difference. First operand 3082 states and 4289 transitions. Second operand 9 states. [2019-09-08 10:23:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:46,581 INFO L93 Difference]: Finished difference Result 10809 states and 15562 transitions. [2019-09-08 10:23:46,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:23:46,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-08 10:23:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:46,606 INFO L225 Difference]: With dead ends: 10809 [2019-09-08 10:23:46,606 INFO L226 Difference]: Without dead ends: 10804 [2019-09-08 10:23:46,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:23:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10804 states. [2019-09-08 10:23:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 3082. [2019-09-08 10:23:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2019-09-08 10:23:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4287 transitions. [2019-09-08 10:23:47,286 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4287 transitions. Word has length 58 [2019-09-08 10:23:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:47,286 INFO L475 AbstractCegarLoop]: Abstraction has 3082 states and 4287 transitions. [2019-09-08 10:23:47,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:23:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4287 transitions. [2019-09-08 10:23:47,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:23:47,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:47,291 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] [2019-09-08 10:23:47,291 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:47,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:47,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1308864492, now seen corresponding path program 1 times [2019-09-08 10:23:47,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:47,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:47,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:47,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:47,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:47,360 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 10:23:47,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:47,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:23:47,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:23:47,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:23:47,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:23:47,362 INFO L87 Difference]: Start difference. First operand 3082 states and 4287 transitions. Second operand 3 states. [2019-09-08 10:23:47,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:47,921 INFO L93 Difference]: Finished difference Result 4216 states and 5859 transitions. [2019-09-08 10:23:47,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:23:47,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:23:47,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:47,930 INFO L225 Difference]: With dead ends: 4216 [2019-09-08 10:23:47,931 INFO L226 Difference]: Without dead ends: 2977 [2019-09-08 10:23:47,939 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 10:23:47,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2019-09-08 10:23:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2975. [2019-09-08 10:23:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-09-08 10:23:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4065 transitions. [2019-09-08 10:23:48,385 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4065 transitions. Word has length 59 [2019-09-08 10:23:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:48,385 INFO L475 AbstractCegarLoop]: Abstraction has 2975 states and 4065 transitions. [2019-09-08 10:23:48,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:23:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4065 transitions. [2019-09-08 10:23:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:23:48,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:48,388 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] [2019-09-08 10:23:48,388 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:48,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1476766260, now seen corresponding path program 1 times [2019-09-08 10:23:48,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:48,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:48,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:48,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:48,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:48,458 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 10:23:48,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:48,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:23:48,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:23:48,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:23:48,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:23:48,460 INFO L87 Difference]: Start difference. First operand 2975 states and 4065 transitions. Second operand 3 states. [2019-09-08 10:23:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:48,776 INFO L93 Difference]: Finished difference Result 4274 states and 5871 transitions. [2019-09-08 10:23:48,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:23:48,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:23:48,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:48,783 INFO L225 Difference]: With dead ends: 4274 [2019-09-08 10:23:48,783 INFO L226 Difference]: Without dead ends: 2982 [2019-09-08 10:23:48,787 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 10:23:48,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2019-09-08 10:23:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2975. [2019-09-08 10:23:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-09-08 10:23:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4012 transitions. [2019-09-08 10:23:49,260 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4012 transitions. Word has length 59 [2019-09-08 10:23:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:49,260 INFO L475 AbstractCegarLoop]: Abstraction has 2975 states and 4012 transitions. [2019-09-08 10:23:49,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:23:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4012 transitions. [2019-09-08 10:23:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:23:49,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:49,263 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] [2019-09-08 10:23:49,263 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:49,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:49,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1586522956, now seen corresponding path program 1 times [2019-09-08 10:23:49,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:49,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:49,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:49,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:49,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:49,328 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 10:23:49,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:49,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:23:49,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:23:49,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:23:49,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:23:49,329 INFO L87 Difference]: Start difference. First operand 2975 states and 4012 transitions. Second operand 3 states. [2019-09-08 10:23:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:49,689 INFO L93 Difference]: Finished difference Result 4327 states and 5861 transitions. [2019-09-08 10:23:49,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:23:49,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:23:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:49,697 INFO L225 Difference]: With dead ends: 4327 [2019-09-08 10:23:49,697 INFO L226 Difference]: Without dead ends: 2981 [2019-09-08 10:23:49,701 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 10:23:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2019-09-08 10:23:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2975. [2019-09-08 10:23:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-09-08 10:23:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 3966 transitions. [2019-09-08 10:23:50,166 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 3966 transitions. Word has length 59 [2019-09-08 10:23:50,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:50,167 INFO L475 AbstractCegarLoop]: Abstraction has 2975 states and 3966 transitions. [2019-09-08 10:23:50,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:23:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 3966 transitions. [2019-09-08 10:23:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:23:50,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:50,172 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] [2019-09-08 10:23:50,172 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:50,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:50,173 INFO L82 PathProgramCache]: Analyzing trace with hash -265313719, now seen corresponding path program 1 times [2019-09-08 10:23:50,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:50,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:50,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:50,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:50,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:50,257 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 10:23:50,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:50,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:23:50,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:23:50,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:23:50,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:23:50,262 INFO L87 Difference]: Start difference. First operand 2975 states and 3966 transitions. Second operand 3 states. [2019-09-08 10:23:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:50,894 INFO L93 Difference]: Finished difference Result 5653 states and 7644 transitions. [2019-09-08 10:23:50,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:23:50,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:23:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:50,904 INFO L225 Difference]: With dead ends: 5653 [2019-09-08 10:23:50,904 INFO L226 Difference]: Without dead ends: 4054 [2019-09-08 10:23:50,909 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 10:23:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4054 states. [2019-09-08 10:23:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4054 to 2914. [2019-09-08 10:23:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2914 states. [2019-09-08 10:23:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 3884 transitions. [2019-09-08 10:23:51,466 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 3884 transitions. Word has length 61 [2019-09-08 10:23:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:51,467 INFO L475 AbstractCegarLoop]: Abstraction has 2914 states and 3884 transitions. [2019-09-08 10:23:51,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:23:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3884 transitions. [2019-09-08 10:23:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:23:51,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:51,470 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] [2019-09-08 10:23:51,470 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:51,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:51,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1719899601, now seen corresponding path program 1 times [2019-09-08 10:23:51,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:51,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:51,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:51,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:51,544 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 10:23:51,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:51,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:23:51,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:23:51,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:23:51,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:23:51,546 INFO L87 Difference]: Start difference. First operand 2914 states and 3884 transitions. Second operand 3 states. [2019-09-08 10:23:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:52,041 INFO L93 Difference]: Finished difference Result 5521 states and 7465 transitions. [2019-09-08 10:23:52,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:23:52,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:23:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:52,047 INFO L225 Difference]: With dead ends: 5521 [2019-09-08 10:23:52,048 INFO L226 Difference]: Without dead ends: 3969 [2019-09-08 10:23:52,052 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 10:23:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3969 states. [2019-09-08 10:23:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3969 to 2827. [2019-09-08 10:23:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2827 states. [2019-09-08 10:23:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3772 transitions. [2019-09-08 10:23:52,429 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3772 transitions. Word has length 61 [2019-09-08 10:23:52,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:52,429 INFO L475 AbstractCegarLoop]: Abstraction has 2827 states and 3772 transitions. [2019-09-08 10:23:52,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:23:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3772 transitions. [2019-09-08 10:23:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:23:52,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:52,432 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] [2019-09-08 10:23:52,433 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:52,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:52,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1413402124, now seen corresponding path program 1 times [2019-09-08 10:23:52,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:52,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:52,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:52,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:52,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:53,142 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 10:23:53,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:53,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 10:23:53,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 10:23:53,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 10:23:53,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:23:53,143 INFO L87 Difference]: Start difference. First operand 2827 states and 3772 transitions. Second operand 14 states. [2019-09-08 10:23:53,271 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-09-08 10:23:53,643 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-09-08 10:23:53,846 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 10:23:54,074 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 10:23:54,311 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-08 10:23:54,476 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-08 10:23:54,622 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-08 10:23:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:58,385 INFO L93 Difference]: Finished difference Result 11623 states and 15905 transitions. [2019-09-08 10:23:58,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 10:23:58,386 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-08 10:23:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:58,399 INFO L225 Difference]: With dead ends: 11623 [2019-09-08 10:23:58,400 INFO L226 Difference]: Without dead ends: 11374 [2019-09-08 10:23:58,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2019-09-08 10:23:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11374 states. [2019-09-08 10:23:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11374 to 2798. [2019-09-08 10:23:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2798 states. [2019-09-08 10:23:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 3737 transitions. [2019-09-08 10:23:58,839 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 3737 transitions. Word has length 61 [2019-09-08 10:23:58,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:58,839 INFO L475 AbstractCegarLoop]: Abstraction has 2798 states and 3737 transitions. [2019-09-08 10:23:58,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 10:23:58,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3737 transitions. [2019-09-08 10:23:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:23:58,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:58,841 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] [2019-09-08 10:23:58,841 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:58,842 INFO L82 PathProgramCache]: Analyzing trace with hash 275049524, now seen corresponding path program 1 times [2019-09-08 10:23:58,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:58,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:58,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:58,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:58,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:59,447 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 10:23:59,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:59,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:23:59,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:23:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:23:59,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:23:59,449 INFO L87 Difference]: Start difference. First operand 2798 states and 3737 transitions. Second operand 13 states. [2019-09-08 10:23:59,720 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-08 10:24:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:01,490 INFO L93 Difference]: Finished difference Result 3962 states and 5347 transitions. [2019-09-08 10:24:01,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:24:01,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-08 10:24:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:01,495 INFO L225 Difference]: With dead ends: 3962 [2019-09-08 10:24:01,495 INFO L226 Difference]: Without dead ends: 3958 [2019-09-08 10:24:01,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:24:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2019-09-08 10:24:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 2794. [2019-09-08 10:24:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2794 states. [2019-09-08 10:24:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 3733 transitions. [2019-09-08 10:24:01,903 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 3733 transitions. Word has length 61 [2019-09-08 10:24:01,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:01,903 INFO L475 AbstractCegarLoop]: Abstraction has 2794 states and 3733 transitions. [2019-09-08 10:24:01,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:24:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 3733 transitions. [2019-09-08 10:24:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:24:01,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:01,909 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] [2019-09-08 10:24:01,909 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:01,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:01,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1749575388, now seen corresponding path program 1 times [2019-09-08 10:24:01,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:01,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:01,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:01,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:01,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:02,544 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 10:24:02,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:02,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:24:02,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:24:02,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:24:02,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:24:02,546 INFO L87 Difference]: Start difference. First operand 2794 states and 3733 transitions. Second operand 12 states. [2019-09-08 10:24:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:05,949 INFO L93 Difference]: Finished difference Result 6267 states and 8537 transitions. [2019-09-08 10:24:05,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 10:24:05,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-09-08 10:24:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:05,958 INFO L225 Difference]: With dead ends: 6267 [2019-09-08 10:24:05,958 INFO L226 Difference]: Without dead ends: 6263 [2019-09-08 10:24:05,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-09-08 10:24:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6263 states. [2019-09-08 10:24:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6263 to 2790. [2019-09-08 10:24:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-09-08 10:24:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 3729 transitions. [2019-09-08 10:24:06,486 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 3729 transitions. Word has length 62 [2019-09-08 10:24:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:06,486 INFO L475 AbstractCegarLoop]: Abstraction has 2790 states and 3729 transitions. [2019-09-08 10:24:06,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:24:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3729 transitions. [2019-09-08 10:24:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:24:06,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:06,490 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] [2019-09-08 10:24:06,491 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:06,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:06,491 INFO L82 PathProgramCache]: Analyzing trace with hash -84431005, now seen corresponding path program 1 times [2019-09-08 10:24:06,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:06,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:06,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:06,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:06,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:06,579 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 10:24:06,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:06,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:24:06,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:24:06,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:24:06,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:24:06,581 INFO L87 Difference]: Start difference. First operand 2790 states and 3729 transitions. Second operand 6 states. [2019-09-08 10:24:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:08,421 INFO L93 Difference]: Finished difference Result 11419 states and 15691 transitions. [2019-09-08 10:24:08,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:24:08,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:24:08,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:08,429 INFO L225 Difference]: With dead ends: 11419 [2019-09-08 10:24:08,429 INFO L226 Difference]: Without dead ends: 9437 [2019-09-08 10:24:08,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:24:08,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9437 states. [2019-09-08 10:24:09,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9437 to 7239. [2019-09-08 10:24:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7239 states. [2019-09-08 10:24:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7239 states to 7239 states and 9700 transitions. [2019-09-08 10:24:09,667 INFO L78 Accepts]: Start accepts. Automaton has 7239 states and 9700 transitions. Word has length 70 [2019-09-08 10:24:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:09,668 INFO L475 AbstractCegarLoop]: Abstraction has 7239 states and 9700 transitions. [2019-09-08 10:24:09,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:24:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 7239 states and 9700 transitions. [2019-09-08 10:24:09,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:24:09,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:09,672 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 10:24:09,672 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:09,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:09,672 INFO L82 PathProgramCache]: Analyzing trace with hash -500118635, now seen corresponding path program 1 times [2019-09-08 10:24:09,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:09,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:09,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:09,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:09,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:09,773 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 10:24:09,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:09,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:24:09,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:24:09,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:24:09,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:24:09,775 INFO L87 Difference]: Start difference. First operand 7239 states and 9700 transitions. Second operand 5 states. [2019-09-08 10:24:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:11,131 INFO L93 Difference]: Finished difference Result 7245 states and 9703 transitions. [2019-09-08 10:24:11,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:24:11,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:24:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:11,139 INFO L225 Difference]: With dead ends: 7245 [2019-09-08 10:24:11,139 INFO L226 Difference]: Without dead ends: 6861 [2019-09-08 10:24:11,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:24:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6861 states. [2019-09-08 10:24:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6861 to 6857. [2019-09-08 10:24:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6857 states. [2019-09-08 10:24:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6857 states to 6857 states and 9209 transitions. [2019-09-08 10:24:12,436 INFO L78 Accepts]: Start accepts. Automaton has 6857 states and 9209 transitions. Word has length 71 [2019-09-08 10:24:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:12,436 INFO L475 AbstractCegarLoop]: Abstraction has 6857 states and 9209 transitions. [2019-09-08 10:24:12,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:24:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6857 states and 9209 transitions. [2019-09-08 10:24:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:24:12,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:12,441 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 10:24:12,442 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:12,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:12,442 INFO L82 PathProgramCache]: Analyzing trace with hash -49263162, now seen corresponding path program 1 times [2019-09-08 10:24:12,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:12,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:12,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:12,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:12,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:12,531 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 10:24:12,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:12,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:24:12,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:24:12,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:24:12,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:24:12,533 INFO L87 Difference]: Start difference. First operand 6857 states and 9209 transitions. Second operand 6 states. [2019-09-08 10:24:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:15,149 INFO L93 Difference]: Finished difference Result 12648 states and 16924 transitions. [2019-09-08 10:24:15,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:24:15,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-08 10:24:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:15,160 INFO L225 Difference]: With dead ends: 12648 [2019-09-08 10:24:15,161 INFO L226 Difference]: Without dead ends: 12646 [2019-09-08 10:24:15,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:24:15,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12646 states. [2019-09-08 10:24:16,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12646 to 7022. [2019-09-08 10:24:16,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7022 states. [2019-09-08 10:24:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 9319 transitions. [2019-09-08 10:24:16,606 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 9319 transitions. Word has length 72 [2019-09-08 10:24:16,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:16,606 INFO L475 AbstractCegarLoop]: Abstraction has 7022 states and 9319 transitions. [2019-09-08 10:24:16,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:24:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 9319 transitions. [2019-09-08 10:24:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:24:16,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:16,611 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 10:24:16,611 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:16,611 INFO L82 PathProgramCache]: Analyzing trace with hash 426026635, now seen corresponding path program 1 times [2019-09-08 10:24:16,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:16,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:16,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:16,666 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 10:24:16,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:16,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:24:16,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:24:16,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:24:16,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:24:16,668 INFO L87 Difference]: Start difference. First operand 7022 states and 9319 transitions. Second operand 3 states. [2019-09-08 10:24:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:19,688 INFO L93 Difference]: Finished difference Result 18667 states and 24855 transitions. [2019-09-08 10:24:19,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:24:19,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:24:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:19,702 INFO L225 Difference]: With dead ends: 18667 [2019-09-08 10:24:19,702 INFO L226 Difference]: Without dead ends: 12574 [2019-09-08 10:24:19,711 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 10:24:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12574 states. [2019-09-08 10:24:22,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12574 to 11786. [2019-09-08 10:24:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11786 states. [2019-09-08 10:24:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11786 states to 11786 states and 15568 transitions. [2019-09-08 10:24:22,050 INFO L78 Accepts]: Start accepts. Automaton has 11786 states and 15568 transitions. Word has length 73 [2019-09-08 10:24:22,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:22,050 INFO L475 AbstractCegarLoop]: Abstraction has 11786 states and 15568 transitions. [2019-09-08 10:24:22,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:24:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 11786 states and 15568 transitions. [2019-09-08 10:24:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:24:22,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:22,054 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, 1, 1] [2019-09-08 10:24:22,054 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:22,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash 876625665, now seen corresponding path program 1 times [2019-09-08 10:24:22,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:22,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:22,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:22,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:22,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:22,114 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 10:24:22,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:22,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:24:22,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:24:22,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:24:22,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:24:22,115 INFO L87 Difference]: Start difference. First operand 11786 states and 15568 transitions. Second operand 3 states. [2019-09-08 10:24:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:26,567 INFO L93 Difference]: Finished difference Result 32286 states and 42556 transitions. [2019-09-08 10:24:26,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:24:26,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:24:26,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:26,590 INFO L225 Difference]: With dead ends: 32286 [2019-09-08 10:24:26,590 INFO L226 Difference]: Without dead ends: 21203 [2019-09-08 10:24:26,603 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 10:24:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21203 states. [2019-09-08 10:24:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21203 to 19861. [2019-09-08 10:24:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19861 states. [2019-09-08 10:24:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19861 states to 19861 states and 25951 transitions. [2019-09-08 10:24:30,882 INFO L78 Accepts]: Start accepts. Automaton has 19861 states and 25951 transitions. Word has length 75 [2019-09-08 10:24:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:30,883 INFO L475 AbstractCegarLoop]: Abstraction has 19861 states and 25951 transitions. [2019-09-08 10:24:30,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:24:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 19861 states and 25951 transitions. [2019-09-08 10:24:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:24:30,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:30,885 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, 1, 1] [2019-09-08 10:24:30,885 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:30,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:30,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2001090544, now seen corresponding path program 1 times [2019-09-08 10:24:30,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:30,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:30,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:30,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:30,943 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 10:24:30,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:30,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:24:30,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:24:30,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:24:30,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:24:30,944 INFO L87 Difference]: Start difference. First operand 19861 states and 25951 transitions. Second operand 3 states. [2019-09-08 10:24:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:37,004 INFO L93 Difference]: Finished difference Result 47949 states and 62575 transitions. [2019-09-08 10:24:37,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:24:37,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:24:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:37,035 INFO L225 Difference]: With dead ends: 47949 [2019-09-08 10:24:37,035 INFO L226 Difference]: Without dead ends: 28827 [2019-09-08 10:24:37,055 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 10:24:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28827 states. [2019-09-08 10:24:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28827 to 28825. [2019-09-08 10:24:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28825 states. [2019-09-08 10:24:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28825 states to 28825 states and 37223 transitions. [2019-09-08 10:24:43,747 INFO L78 Accepts]: Start accepts. Automaton has 28825 states and 37223 transitions. Word has length 75 [2019-09-08 10:24:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:24:43,747 INFO L475 AbstractCegarLoop]: Abstraction has 28825 states and 37223 transitions. [2019-09-08 10:24:43,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:24:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 28825 states and 37223 transitions. [2019-09-08 10:24:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 10:24:43,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:24:43,752 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:24:43,752 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:24:43,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:24:43,753 INFO L82 PathProgramCache]: Analyzing trace with hash -346957096, now seen corresponding path program 1 times [2019-09-08 10:24:43,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:24:43,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:24:43,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:43,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:24:43,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:24:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:24:43,830 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 10:24:43,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:24:43,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:24:43,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:24:43,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:24:43,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:24:43,831 INFO L87 Difference]: Start difference. First operand 28825 states and 37223 transitions. Second operand 5 states. [2019-09-08 10:24:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:56,115 INFO L93 Difference]: Finished difference Result 79035 states and 101191 transitions. [2019-09-08 10:24:56,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:24:56,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-08 10:24:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:56,185 INFO L225 Difference]: With dead ends: 79035 [2019-09-08 10:24:56,185 INFO L226 Difference]: Without dead ends: 50949 [2019-09-08 10:24:56,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:24:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50949 states. [2019-09-08 10:25:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50949 to 32117. [2019-09-08 10:25:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32117 states. [2019-09-08 10:25:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32117 states to 32117 states and 40989 transitions. [2019-09-08 10:25:02,984 INFO L78 Accepts]: Start accepts. Automaton has 32117 states and 40989 transitions. Word has length 83 [2019-09-08 10:25:02,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:25:02,984 INFO L475 AbstractCegarLoop]: Abstraction has 32117 states and 40989 transitions. [2019-09-08 10:25:02,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:25:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 32117 states and 40989 transitions. [2019-09-08 10:25:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 10:25:02,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:25:02,992 INFO L399 BasicCegarLoop]: trace histogram [2, 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] [2019-09-08 10:25:02,992 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:25:02,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:25:02,992 INFO L82 PathProgramCache]: Analyzing trace with hash -889111919, now seen corresponding path program 1 times [2019-09-08 10:25:02,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:25:02,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:25:02,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:02,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:25:02,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:25:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:25:03,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:25:03,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:25:03,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:25:03,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:25:03,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:25:03,055 INFO L87 Difference]: Start difference. First operand 32117 states and 40989 transitions. Second operand 3 states. [2019-09-08 10:25:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:25:16,942 INFO L93 Difference]: Finished difference Result 91215 states and 115983 transitions. [2019-09-08 10:25:16,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:25:16,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-08 10:25:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:25:17,009 INFO L225 Difference]: With dead ends: 91215 [2019-09-08 10:25:17,009 INFO L226 Difference]: Without dead ends: 59837 [2019-09-08 10:25:17,042 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 10:25:17,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59837 states. [2019-09-08 10:25:28,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59837 to 52095. [2019-09-08 10:25:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52095 states. [2019-09-08 10:25:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52095 states to 52095 states and 65445 transitions. [2019-09-08 10:25:28,222 INFO L78 Accepts]: Start accepts. Automaton has 52095 states and 65445 transitions. Word has length 94 [2019-09-08 10:25:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:25:28,222 INFO L475 AbstractCegarLoop]: Abstraction has 52095 states and 65445 transitions. [2019-09-08 10:25:28,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:25:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 52095 states and 65445 transitions. [2019-09-08 10:25:28,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 10:25:28,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:25:28,230 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:25:28,230 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:25:28,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:25:28,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1074943154, now seen corresponding path program 1 times [2019-09-08 10:25:28,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:25:28,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:25:28,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:28,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:25:28,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:25:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:25:28,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:25:28,354 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) [2019-09-08 10:25:28,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:25:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:25:28,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 10:25:28,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:25:28,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:25:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 10:25:29,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:25:29,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-09-08 10:25:29,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:25:29,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:25:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:25:29,053 INFO L87 Difference]: Start difference. First operand 52095 states and 65445 transitions. Second operand 13 states. [2019-09-08 10:26:02,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:02,376 INFO L93 Difference]: Finished difference Result 168528 states and 211684 transitions. [2019-09-08 10:26:02,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-08 10:26:02,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-09-08 10:26:02,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:02,956 INFO L225 Difference]: With dead ends: 168528 [2019-09-08 10:26:02,957 INFO L226 Difference]: Without dead ends: 117172 [2019-09-08 10:26:03,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1160, Invalid=4242, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 10:26:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117172 states. [2019-09-08 10:26:28,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117172 to 98205. [2019-09-08 10:26:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98205 states. [2019-09-08 10:26:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98205 states to 98205 states and 123105 transitions. [2019-09-08 10:26:28,735 INFO L78 Accepts]: Start accepts. Automaton has 98205 states and 123105 transitions. Word has length 96 [2019-09-08 10:26:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:28,736 INFO L475 AbstractCegarLoop]: Abstraction has 98205 states and 123105 transitions. [2019-09-08 10:26:28,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:26:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 98205 states and 123105 transitions. [2019-09-08 10:26:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 10:26:28,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:28,751 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:26:28,751 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:28,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:28,752 INFO L82 PathProgramCache]: Analyzing trace with hash -495075643, now seen corresponding path program 1 times [2019-09-08 10:26:28,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:28,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:28,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:28,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:28,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:28,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:26:28,830 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 10:26:28,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:29,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:26:29,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:26:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:26:29,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:26:29,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-09-08 10:26:29,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:26:29,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:26:29,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:26:29,203 INFO L87 Difference]: Start difference. First operand 98205 states and 123105 transitions. Second operand 10 states. [2019-09-08 10:26:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:26:59,064 INFO L93 Difference]: Finished difference Result 201780 states and 252480 transitions. [2019-09-08 10:26:59,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:26:59,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-09-08 10:26:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:26:59,252 INFO L225 Difference]: With dead ends: 201780 [2019-09-08 10:26:59,252 INFO L226 Difference]: Without dead ends: 104216 [2019-09-08 10:26:59,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:26:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104216 states. [2019-09-08 10:27:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104216 to 74954. [2019-09-08 10:27:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74954 states. [2019-09-08 10:27:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74954 states to 74954 states and 92267 transitions. [2019-09-08 10:27:18,203 INFO L78 Accepts]: Start accepts. Automaton has 74954 states and 92267 transitions. Word has length 98 [2019-09-08 10:27:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:27:18,203 INFO L475 AbstractCegarLoop]: Abstraction has 74954 states and 92267 transitions. [2019-09-08 10:27:18,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:27:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 74954 states and 92267 transitions. [2019-09-08 10:27:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 10:27:18,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:27:18,211 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:27:18,212 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:27:18,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:27:18,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1609353407, now seen corresponding path program 1 times [2019-09-08 10:27:18,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:27:18,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:27:18,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:18,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:27:18,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:27:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:27:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:27:18,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:27:18,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:27:18,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:27:18,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:27:18,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:27:18,292 INFO L87 Difference]: Start difference. First operand 74954 states and 92267 transitions. Second operand 5 states. [2019-09-08 10:27:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:44,223 INFO L93 Difference]: Finished difference Result 168951 states and 207435 transitions. [2019-09-08 10:27:44,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:27:44,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 10:27:44,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:44,351 INFO L225 Difference]: With dead ends: 168951 [2019-09-08 10:27:44,351 INFO L226 Difference]: Without dead ends: 94717 [2019-09-08 10:27:44,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:27:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94717 states. [2019-09-08 10:28:02,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94717 to 72660. [2019-09-08 10:28:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72660 states. [2019-09-08 10:28:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72660 states to 72660 states and 87968 transitions. [2019-09-08 10:28:02,846 INFO L78 Accepts]: Start accepts. Automaton has 72660 states and 87968 transitions. Word has length 99 [2019-09-08 10:28:02,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:28:02,846 INFO L475 AbstractCegarLoop]: Abstraction has 72660 states and 87968 transitions. [2019-09-08 10:28:02,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:28:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 72660 states and 87968 transitions. [2019-09-08 10:28:02,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 10:28:02,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:28:02,857 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:02,857 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:28:02,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:28:02,857 INFO L82 PathProgramCache]: Analyzing trace with hash 948248736, now seen corresponding path program 1 times [2019-09-08 10:28:02,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:28:02,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:28:02,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:02,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:28:02,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:28:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 10:28:02,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:28:02,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:28:02,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:28:02,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:28:02,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:28:02,951 INFO L87 Difference]: Start difference. First operand 72660 states and 87968 transitions. Second operand 4 states. [2019-09-08 10:28:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:28:46,599 INFO L93 Difference]: Finished difference Result 231109 states and 279365 transitions. [2019-09-08 10:28:46,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:28:46,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-08 10:28:46,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:28:46,785 INFO L225 Difference]: With dead ends: 231109 [2019-09-08 10:28:46,785 INFO L226 Difference]: Without dead ends: 161205 [2019-09-08 10:28:46,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:28:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161205 states. [2019-09-08 10:29:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161205 to 72575. [2019-09-08 10:29:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72575 states. [2019-09-08 10:29:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72575 states to 72575 states and 87883 transitions. [2019-09-08 10:29:09,285 INFO L78 Accepts]: Start accepts. Automaton has 72575 states and 87883 transitions. Word has length 103 [2019-09-08 10:29:09,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:09,285 INFO L475 AbstractCegarLoop]: Abstraction has 72575 states and 87883 transitions. [2019-09-08 10:29:09,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:29:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 72575 states and 87883 transitions. [2019-09-08 10:29:09,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 10:29:09,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:09,294 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:29:09,295 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:09,295 INFO L82 PathProgramCache]: Analyzing trace with hash -520245115, now seen corresponding path program 1 times [2019-09-08 10:29:09,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:09,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:09,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:09,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:09,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 10:29:09,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:09,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:29:09,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:29:09,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:29:09,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:29:09,414 INFO L87 Difference]: Start difference. First operand 72575 states and 87883 transitions. Second operand 5 states. [2019-09-08 10:29:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:45,079 INFO L93 Difference]: Finished difference Result 162933 states and 195977 transitions. [2019-09-08 10:29:45,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:29:45,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 10:29:45,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:45,221 INFO L225 Difference]: With dead ends: 162933 [2019-09-08 10:29:45,221 INFO L226 Difference]: Without dead ends: 129597 [2019-09-08 10:29:45,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:29:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129597 states. [2019-09-08 10:30:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129597 to 72489. [2019-09-08 10:30:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72489 states. [2019-09-08 10:30:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72489 states to 72489 states and 87783 transitions. [2019-09-08 10:30:08,326 INFO L78 Accepts]: Start accepts. Automaton has 72489 states and 87783 transitions. Word has length 103 [2019-09-08 10:30:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:08,326 INFO L475 AbstractCegarLoop]: Abstraction has 72489 states and 87783 transitions. [2019-09-08 10:30:08,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:30:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 72489 states and 87783 transitions. [2019-09-08 10:30:08,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 10:30:08,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:08,331 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:30:08,331 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:08,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:08,332 INFO L82 PathProgramCache]: Analyzing trace with hash 371429046, now seen corresponding path program 1 times [2019-09-08 10:30:08,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:08,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:08,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:08,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:08,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 10:30:08,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:08,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:30:08,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:30:08,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:30:08,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:30:08,424 INFO L87 Difference]: Start difference. First operand 72489 states and 87783 transitions. Second operand 5 states. [2019-09-08 10:30:38,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:38,492 INFO L93 Difference]: Finished difference Result 134334 states and 163004 transitions. [2019-09-08 10:30:38,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:30:38,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 10:30:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:38,616 INFO L225 Difference]: With dead ends: 134334 [2019-09-08 10:30:38,616 INFO L226 Difference]: Without dead ends: 110474 [2019-09-08 10:30:38,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:30:38,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110474 states. [2019-09-08 10:31:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110474 to 87042. [2019-09-08 10:31:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87042 states. [2019-09-08 10:31:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87042 states to 87042 states and 105279 transitions. [2019-09-08 10:31:02,590 INFO L78 Accepts]: Start accepts. Automaton has 87042 states and 105279 transitions. Word has length 103 [2019-09-08 10:31:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:02,590 INFO L475 AbstractCegarLoop]: Abstraction has 87042 states and 105279 transitions. [2019-09-08 10:31:02,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:31:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 87042 states and 105279 transitions. [2019-09-08 10:31:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 10:31:02,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:02,596 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:31:02,597 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:02,597 INFO L82 PathProgramCache]: Analyzing trace with hash 56124154, now seen corresponding path program 1 times [2019-09-08 10:31:02,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:02,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:02,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:02,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:02,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:31:05,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:31:05,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:31:05,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:31:05,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:31:05,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:31:05,111 INFO L87 Difference]: Start difference. First operand 87042 states and 105279 transitions. Second operand 5 states. [2019-09-08 10:31:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:39,407 INFO L93 Difference]: Finished difference Result 162856 states and 197335 transitions. [2019-09-08 10:31:39,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:31:39,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-08 10:31:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:39,571 INFO L225 Difference]: With dead ends: 162856 [2019-09-08 10:31:39,571 INFO L226 Difference]: Without dead ends: 127757 [2019-09-08 10:31:39,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:31:39,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127757 states. [2019-09-08 10:32:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127757 to 109522. [2019-09-08 10:32:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109522 states. [2019-09-08 10:32:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109522 states to 109522 states and 132249 transitions. [2019-09-08 10:32:14,192 INFO L78 Accepts]: Start accepts. Automaton has 109522 states and 132249 transitions. Word has length 105 [2019-09-08 10:32:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:32:14,193 INFO L475 AbstractCegarLoop]: Abstraction has 109522 states and 132249 transitions. [2019-09-08 10:32:14,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:32:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 109522 states and 132249 transitions. [2019-09-08 10:32:14,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 10:32:14,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:32:14,200 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:32:14,200 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:32:14,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:32:14,200 INFO L82 PathProgramCache]: Analyzing trace with hash -116257775, now seen corresponding path program 1 times [2019-09-08 10:32:14,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:32:14,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:32:14,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:14,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:32:14,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:32:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:32:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 10:32:14,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:32:14,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:32:14,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:32:14,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:32:14,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:32:14,262 INFO L87 Difference]: Start difference. First operand 109522 states and 132249 transitions. Second operand 4 states. [2019-09-08 10:32:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:56,766 INFO L93 Difference]: Finished difference Result 169670 states and 205001 transitions. [2019-09-08 10:32:56,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:32:56,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-08 10:32:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:56,936 INFO L225 Difference]: With dead ends: 169670 [2019-09-08 10:32:56,936 INFO L226 Difference]: Without dead ends: 154116 [2019-09-08 10:32:56,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:32:57,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154116 states. [2019-09-08 10:33:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154116 to 109522. [2019-09-08 10:33:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109522 states. [2019-09-08 10:33:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109522 states to 109522 states and 132249 transitions. [2019-09-08 10:33:31,256 INFO L78 Accepts]: Start accepts. Automaton has 109522 states and 132249 transitions. Word has length 108 [2019-09-08 10:33:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:33:31,257 INFO L475 AbstractCegarLoop]: Abstraction has 109522 states and 132249 transitions. [2019-09-08 10:33:31,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:33:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 109522 states and 132249 transitions. [2019-09-08 10:33:31,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 10:33:31,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:33:31,264 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:33:31,264 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:33:31,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:33:31,264 INFO L82 PathProgramCache]: Analyzing trace with hash 236437644, now seen corresponding path program 1 times [2019-09-08 10:33:31,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:33:31,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:33:31,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:31,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:33:31,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:33:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:33:31,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:33:31,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:33:31,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:33:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:33:31,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:33:31,511 INFO L87 Difference]: Start difference. First operand 109522 states and 132249 transitions. Second operand 10 states. [2019-09-08 10:34:31,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:31,791 INFO L93 Difference]: Finished difference Result 257316 states and 309042 transitions. [2019-09-08 10:34:31,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 10:34:31,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 108 [2019-09-08 10:34:31,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:35,629 INFO L225 Difference]: With dead ends: 257316 [2019-09-08 10:34:35,629 INFO L226 Difference]: Without dead ends: 204984 [2019-09-08 10:34:35,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:34:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204984 states. [2019-09-08 10:35:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204984 to 142777. [2019-09-08 10:35:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142777 states. [2019-09-08 10:35:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142777 states to 142777 states and 172134 transitions. [2019-09-08 10:35:16,918 INFO L78 Accepts]: Start accepts. Automaton has 142777 states and 172134 transitions. Word has length 108 [2019-09-08 10:35:16,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:16,918 INFO L475 AbstractCegarLoop]: Abstraction has 142777 states and 172134 transitions. [2019-09-08 10:35:16,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:35:16,918 INFO L276 IsEmpty]: Start isEmpty. Operand 142777 states and 172134 transitions. [2019-09-08 10:35:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 10:35:16,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:16,927 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:35:16,927 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:16,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:16,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1996211207, now seen corresponding path program 1 times [2019-09-08 10:35:16,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:16,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:16,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:16,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:16,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 10:35:16,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:16,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:35:16,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:35:16,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:35:16,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:35:16,994 INFO L87 Difference]: Start difference. First operand 142777 states and 172134 transitions. Second operand 4 states. [2019-09-08 10:36:18,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:18,918 INFO L93 Difference]: Finished difference Result 242178 states and 292225 transitions. [2019-09-08 10:36:18,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:36:18,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-08 10:36:18,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:19,161 INFO L225 Difference]: With dead ends: 242178 [2019-09-08 10:36:19,161 INFO L226 Difference]: Without dead ends: 206315 [2019-09-08 10:36:19,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:36:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206315 states.