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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:29:37,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:29:37,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:29:37,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:29:37,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:29:37,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:29:37,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:29:37,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:29:37,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:29:37,917 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:29:37,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:29:37,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:29:37,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:29:37,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:29:37,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:29:37,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:29:37,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:29:37,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:29:37,933 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:29:37,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:29:37,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:29:37,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:29:37,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:29:37,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:29:37,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:29:37,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:29:37,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:29:37,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:29:37,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:29:37,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:29:37,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:29:37,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:29:37,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:29:37,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:29:37,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:29:37,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:29:37,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:29:37,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:29:37,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:29:37,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:29:37,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:29:37,966 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:29:37,980 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:29:37,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:29:37,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:29:37,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:29:37,982 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:29:37,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:29:37,982 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:29:37,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:29:37,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:29:37,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:29:37,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:29:37,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:29:37,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:29:37,984 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:29:37,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:29:37,984 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:29:37,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:29:37,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:29:37,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:29:37,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:29:37,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:29:37,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:29:37,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:29:37,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:29:37,986 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:29:37,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:29:37,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:29:37,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:29:37,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:29:38,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:29:38,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:29:38,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:29:38,033 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:29:38,033 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:29:38,034 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 10:29:38,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544a83990/f574816c7b494000a6524622e4ef5344/FLAG7c61c54eb [2019-09-08 10:29:38,719 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:29:38,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 10:29:38,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544a83990/f574816c7b494000a6524622e4ef5344/FLAG7c61c54eb [2019-09-08 10:29:38,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/544a83990/f574816c7b494000a6524622e4ef5344 [2019-09-08 10:29:38,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:29:38,960 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:29:38,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:29:38,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:29:38,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:29:38,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:29:38" (1/1) ... [2019-09-08 10:29:38,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb9c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:38, skipping insertion in model container [2019-09-08 10:29:38,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:29:38" (1/1) ... [2019-09-08 10:29:38,981 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:29:39,082 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:29:39,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:29:39,796 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:29:40,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:29:40,195 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:29:40,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:40 WrapperNode [2019-09-08 10:29:40,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:29:40,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:29:40,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:29:40,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:29:40,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:40" (1/1) ... [2019-09-08 10:29:40,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:40" (1/1) ... [2019-09-08 10:29:40,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:40" (1/1) ... [2019-09-08 10:29:40,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:40" (1/1) ... [2019-09-08 10:29:40,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:40" (1/1) ... [2019-09-08 10:29:40,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:40" (1/1) ... [2019-09-08 10:29:40,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:40" (1/1) ... [2019-09-08 10:29:40,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:29:40,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:29:40,395 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:29:40,395 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:29:40,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:40" (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:29:40,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:29:40,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:29:40,473 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:29:40,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:29:40,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:29:40,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:29:40,475 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:29:40,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:29:40,475 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:29:40,476 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:29:40,476 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:29:40,476 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:29:40,477 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:29:40,477 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:29:40,478 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:29:40,478 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:29:40,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:29:40,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:29:42,533 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:29:42,534 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:29:42,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:29:42 BoogieIcfgContainer [2019-09-08 10:29:42,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:29:42,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:29:42,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:29:42,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:29:42,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:29:38" (1/3) ... [2019-09-08 10:29:42,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490fa8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:29:42, skipping insertion in model container [2019-09-08 10:29:42,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:29:40" (2/3) ... [2019-09-08 10:29:42,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490fa8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:29:42, skipping insertion in model container [2019-09-08 10:29:42,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:29:42" (3/3) ... [2019-09-08 10:29:42,543 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 10:29:42,553 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:29:42,570 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-08 10:29:42,587 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-08 10:29:42,621 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:29:42,621 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:29:42,621 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:29:42,622 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:29:42,622 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:29:42,622 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:29:42,622 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:29:42,622 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:29:42,622 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:29:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states. [2019-09-08 10:29:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:29:42,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:42,668 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:29:42,670 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash 612696190, now seen corresponding path program 1 times [2019-09-08 10:29:42,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:42,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:42,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:42,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:42,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:43,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:29:43,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:43,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:29:43,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:29:43,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:29:43,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:29:43,259 INFO L87 Difference]: Start difference. First operand 462 states. Second operand 5 states. [2019-09-08 10:29:43,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:43,992 INFO L93 Difference]: Finished difference Result 842 states and 1482 transitions. [2019-09-08 10:29:43,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:29:43,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-09-08 10:29:43,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:44,028 INFO L225 Difference]: With dead ends: 842 [2019-09-08 10:29:44,029 INFO L226 Difference]: Without dead ends: 489 [2019-09-08 10:29:44,041 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:29:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-08 10:29:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 483. [2019-09-08 10:29:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-08 10:29:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 653 transitions. [2019-09-08 10:29:44,150 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 653 transitions. Word has length 55 [2019-09-08 10:29:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:44,151 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 653 transitions. [2019-09-08 10:29:44,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:29:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 653 transitions. [2019-09-08 10:29:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:29:44,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:44,162 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:29:44,163 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:44,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:44,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1659380668, now seen corresponding path program 1 times [2019-09-08 10:29:44,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:44,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:44,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:44,395 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:29:44,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:44,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:29:44,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:29:44,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:29:44,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:29:44,399 INFO L87 Difference]: Start difference. First operand 483 states and 653 transitions. Second operand 3 states. [2019-09-08 10:29:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:44,470 INFO L93 Difference]: Finished difference Result 888 states and 1223 transitions. [2019-09-08 10:29:44,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:29:44,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-08 10:29:44,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:44,477 INFO L225 Difference]: With dead ends: 888 [2019-09-08 10:29:44,477 INFO L226 Difference]: Without dead ends: 662 [2019-09-08 10:29:44,479 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:29:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-09-08 10:29:44,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 654. [2019-09-08 10:29:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2019-09-08 10:29:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 875 transitions. [2019-09-08 10:29:44,525 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 875 transitions. Word has length 56 [2019-09-08 10:29:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:44,527 INFO L475 AbstractCegarLoop]: Abstraction has 654 states and 875 transitions. [2019-09-08 10:29:44,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:29:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 875 transitions. [2019-09-08 10:29:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:29:44,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:44,535 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:29:44,535 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:44,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:44,538 INFO L82 PathProgramCache]: Analyzing trace with hash 438922513, now seen corresponding path program 1 times [2019-09-08 10:29:44,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:44,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:44,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:44,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:44,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:44,709 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:29:44,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:44,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:29:44,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:29:44,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:29:44,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:29:44,712 INFO L87 Difference]: Start difference. First operand 654 states and 875 transitions. Second operand 3 states. [2019-09-08 10:29:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:44,784 INFO L93 Difference]: Finished difference Result 1245 states and 1728 transitions. [2019-09-08 10:29:44,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:29:44,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-08 10:29:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:44,790 INFO L225 Difference]: With dead ends: 1245 [2019-09-08 10:29:44,790 INFO L226 Difference]: Without dead ends: 918 [2019-09-08 10:29:44,791 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:29:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-09-08 10:29:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 912. [2019-09-08 10:29:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-08 10:29:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1241 transitions. [2019-09-08 10:29:44,830 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1241 transitions. Word has length 56 [2019-09-08 10:29:44,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:44,831 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1241 transitions. [2019-09-08 10:29:44,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:29:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1241 transitions. [2019-09-08 10:29:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:29:44,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:44,833 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:29:44,834 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:44,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:44,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2011379690, now seen corresponding path program 1 times [2019-09-08 10:29:44,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:44,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:44,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:44,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:44,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:44,959 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:29:44,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:44,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:29:44,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:29:44,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:29:44,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:29:44,961 INFO L87 Difference]: Start difference. First operand 912 states and 1241 transitions. Second operand 6 states. [2019-09-08 10:29:45,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:45,446 INFO L93 Difference]: Finished difference Result 2229 states and 3122 transitions. [2019-09-08 10:29:45,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:29:45,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:29:45,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:45,455 INFO L225 Difference]: With dead ends: 2229 [2019-09-08 10:29:45,455 INFO L226 Difference]: Without dead ends: 1493 [2019-09-08 10:29:45,457 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:29:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2019-09-08 10:29:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1475. [2019-09-08 10:29:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2019-09-08 10:29:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2069 transitions. [2019-09-08 10:29:45,526 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 2069 transitions. Word has length 56 [2019-09-08 10:29:45,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:45,527 INFO L475 AbstractCegarLoop]: Abstraction has 1475 states and 2069 transitions. [2019-09-08 10:29:45,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:29:45,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 2069 transitions. [2019-09-08 10:29:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:29:45,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:45,529 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:29:45,530 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:45,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:45,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1500009087, now seen corresponding path program 1 times [2019-09-08 10:29:45,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:45,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:45,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:45,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:45,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:45,691 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:29:45,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:45,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:29:45,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:29:45,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:29:45,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:29:45,694 INFO L87 Difference]: Start difference. First operand 1475 states and 2069 transitions. Second operand 6 states. [2019-09-08 10:29:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:46,232 INFO L93 Difference]: Finished difference Result 4628 states and 6581 transitions. [2019-09-08 10:29:46,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:29:46,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-08 10:29:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:46,252 INFO L225 Difference]: With dead ends: 4628 [2019-09-08 10:29:46,252 INFO L226 Difference]: Without dead ends: 3329 [2019-09-08 10:29:46,258 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:29:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2019-09-08 10:29:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3314. [2019-09-08 10:29:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3314 states. [2019-09-08 10:29:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 4673 transitions. [2019-09-08 10:29:46,535 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 4673 transitions. Word has length 57 [2019-09-08 10:29:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:46,536 INFO L475 AbstractCegarLoop]: Abstraction has 3314 states and 4673 transitions. [2019-09-08 10:29:46,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:29:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 4673 transitions. [2019-09-08 10:29:46,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:29:46,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:46,540 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:29:46,541 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:46,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:46,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1393968156, now seen corresponding path program 1 times [2019-09-08 10:29:46,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:46,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:46,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:46,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:46,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:46,639 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:29:46,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:46,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:29:46,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:29:46,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:29:46,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:29:46,641 INFO L87 Difference]: Start difference. First operand 3314 states and 4673 transitions. Second operand 3 states. [2019-09-08 10:29:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:46,943 INFO L93 Difference]: Finished difference Result 7482 states and 10677 transitions. [2019-09-08 10:29:46,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:29:46,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-08 10:29:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:46,971 INFO L225 Difference]: With dead ends: 7482 [2019-09-08 10:29:46,972 INFO L226 Difference]: Without dead ends: 4772 [2019-09-08 10:29:46,978 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:29:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2019-09-08 10:29:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4735. [2019-09-08 10:29:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4735 states. [2019-09-08 10:29:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 6623 transitions. [2019-09-08 10:29:47,281 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 6623 transitions. Word has length 57 [2019-09-08 10:29:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:47,285 INFO L475 AbstractCegarLoop]: Abstraction has 4735 states and 6623 transitions. [2019-09-08 10:29:47,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:29:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 6623 transitions. [2019-09-08 10:29:47,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:29:47,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:47,288 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:29:47,288 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:47,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:47,289 INFO L82 PathProgramCache]: Analyzing trace with hash 605372369, now seen corresponding path program 1 times [2019-09-08 10:29:47,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:47,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:47,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:47,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:47,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:47,437 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:29:47,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:47,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:29:47,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:29:47,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:29:47,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:29:47,440 INFO L87 Difference]: Start difference. First operand 4735 states and 6623 transitions. Second operand 7 states. [2019-09-08 10:29:49,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:49,399 INFO L93 Difference]: Finished difference Result 17576 states and 24991 transitions. [2019-09-08 10:29:49,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:29:49,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-08 10:29:49,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:49,476 INFO L225 Difference]: With dead ends: 17576 [2019-09-08 10:29:49,476 INFO L226 Difference]: Without dead ends: 15691 [2019-09-08 10:29:49,484 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:29:49,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15691 states. [2019-09-08 10:29:49,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15691 to 4757. [2019-09-08 10:29:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4757 states. [2019-09-08 10:29:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 6654 transitions. [2019-09-08 10:29:49,951 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 6654 transitions. Word has length 58 [2019-09-08 10:29:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:49,952 INFO L475 AbstractCegarLoop]: Abstraction has 4757 states and 6654 transitions. [2019-09-08 10:29:49,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:29:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 6654 transitions. [2019-09-08 10:29:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:29:49,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:49,955 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:29:49,956 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:49,956 INFO L82 PathProgramCache]: Analyzing trace with hash -879419620, now seen corresponding path program 1 times [2019-09-08 10:29:49,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:49,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:49,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:50,081 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:29:50,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:50,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:29:50,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:29:50,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:29:50,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:29:50,083 INFO L87 Difference]: Start difference. First operand 4757 states and 6654 transitions. Second operand 7 states. [2019-09-08 10:29:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:51,843 INFO L93 Difference]: Finished difference Result 15866 states and 22488 transitions. [2019-09-08 10:29:51,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:29:51,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-08 10:29:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:51,890 INFO L225 Difference]: With dead ends: 15866 [2019-09-08 10:29:51,891 INFO L226 Difference]: Without dead ends: 13712 [2019-09-08 10:29:51,899 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:29:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13712 states. [2019-09-08 10:29:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13712 to 4771. [2019-09-08 10:29:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4771 states. [2019-09-08 10:29:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 6672 transitions. [2019-09-08 10:29:52,334 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 6672 transitions. Word has length 58 [2019-09-08 10:29:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:52,334 INFO L475 AbstractCegarLoop]: Abstraction has 4771 states and 6672 transitions. [2019-09-08 10:29:52,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:29:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 6672 transitions. [2019-09-08 10:29:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:29:52,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:52,338 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:29:52,339 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:52,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1079105450, now seen corresponding path program 1 times [2019-09-08 10:29:52,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:52,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:52,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:52,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:52,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:52,441 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:29:52,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:52,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:29:52,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:29:52,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:29:52,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:29:52,443 INFO L87 Difference]: Start difference. First operand 4771 states and 6672 transitions. Second operand 7 states. [2019-09-08 10:29:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:54,698 INFO L93 Difference]: Finished difference Result 23387 states and 33175 transitions. [2019-09-08 10:29:54,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:29:54,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-09-08 10:29:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:54,752 INFO L225 Difference]: With dead ends: 23387 [2019-09-08 10:29:54,752 INFO L226 Difference]: Without dead ends: 20992 [2019-09-08 10:29:54,766 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:29:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20992 states. [2019-09-08 10:29:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20992 to 4805. [2019-09-08 10:29:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4805 states. [2019-09-08 10:29:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4805 states to 4805 states and 6716 transitions. [2019-09-08 10:29:55,579 INFO L78 Accepts]: Start accepts. Automaton has 4805 states and 6716 transitions. Word has length 58 [2019-09-08 10:29:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:55,579 INFO L475 AbstractCegarLoop]: Abstraction has 4805 states and 6716 transitions. [2019-09-08 10:29:55,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:29:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4805 states and 6716 transitions. [2019-09-08 10:29:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:29:55,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:55,591 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:29:55,592 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:55,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:55,592 INFO L82 PathProgramCache]: Analyzing trace with hash 184722790, now seen corresponding path program 1 times [2019-09-08 10:29:55,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:55,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:55,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:55,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:55,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:55,775 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:29:55,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:55,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:29:55,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:29:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:29:55,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:29:55,777 INFO L87 Difference]: Start difference. First operand 4805 states and 6716 transitions. Second operand 9 states. [2019-09-08 10:29:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:58,343 INFO L93 Difference]: Finished difference Result 21049 states and 30018 transitions. [2019-09-08 10:29:58,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:29:58,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-08 10:29:58,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:58,388 INFO L225 Difference]: With dead ends: 21049 [2019-09-08 10:29:58,389 INFO L226 Difference]: Without dead ends: 17669 [2019-09-08 10:29:58,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:29:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17669 states. [2019-09-08 10:29:59,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17669 to 4771. [2019-09-08 10:29:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4771 states. [2019-09-08 10:29:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 6670 transitions. [2019-09-08 10:29:59,044 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 6670 transitions. Word has length 59 [2019-09-08 10:29:59,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:29:59,045 INFO L475 AbstractCegarLoop]: Abstraction has 4771 states and 6670 transitions. [2019-09-08 10:29:59,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:29:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 6670 transitions. [2019-09-08 10:29:59,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:29:59,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:29:59,049 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:29:59,049 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:29:59,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:29:59,050 INFO L82 PathProgramCache]: Analyzing trace with hash -869337794, now seen corresponding path program 1 times [2019-09-08 10:29:59,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:29:59,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:29:59,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:59,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:29:59,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:29:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:29:59,227 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:29:59,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:29:59,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:29:59,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:29:59,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:29:59,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:29:59,229 INFO L87 Difference]: Start difference. First operand 4771 states and 6670 transitions. Second operand 9 states. [2019-09-08 10:30:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:01,283 INFO L93 Difference]: Finished difference Result 10678 states and 15209 transitions. [2019-09-08 10:30:01,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 10:30:01,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-09-08 10:30:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:01,300 INFO L225 Difference]: With dead ends: 10678 [2019-09-08 10:30:01,300 INFO L226 Difference]: Without dead ends: 10673 [2019-09-08 10:30:01,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2019-09-08 10:30:01,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2019-09-08 10:30:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 4771. [2019-09-08 10:30:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4771 states. [2019-09-08 10:30:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 6668 transitions. [2019-09-08 10:30:01,810 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 6668 transitions. Word has length 59 [2019-09-08 10:30:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:01,811 INFO L475 AbstractCegarLoop]: Abstraction has 4771 states and 6668 transitions. [2019-09-08 10:30:01,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:30:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 6668 transitions. [2019-09-08 10:30:01,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:30:01,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:01,815 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:30:01,816 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:01,816 INFO L82 PathProgramCache]: Analyzing trace with hash -2011941325, now seen corresponding path program 1 times [2019-09-08 10:30:01,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:01,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:01,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:01,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:01,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:01,978 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:30:01,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:01,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:30:01,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:30:01,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:30:01,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:30:01,980 INFO L87 Difference]: Start difference. First operand 4771 states and 6668 transitions. Second operand 8 states. [2019-09-08 10:30:04,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:04,529 INFO L93 Difference]: Finished difference Result 17358 states and 24873 transitions. [2019-09-08 10:30:04,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:30:04,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-09-08 10:30:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:04,551 INFO L225 Difference]: With dead ends: 17358 [2019-09-08 10:30:04,551 INFO L226 Difference]: Without dead ends: 13608 [2019-09-08 10:30:04,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:30:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13608 states. [2019-09-08 10:30:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13608 to 4614. [2019-09-08 10:30:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4614 states. [2019-09-08 10:30:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 6462 transitions. [2019-09-08 10:30:05,538 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 6462 transitions. Word has length 59 [2019-09-08 10:30:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:05,539 INFO L475 AbstractCegarLoop]: Abstraction has 4614 states and 6462 transitions. [2019-09-08 10:30:05,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:30:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 6462 transitions. [2019-09-08 10:30:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:30:05,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:05,542 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] [2019-09-08 10:30:05,542 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:05,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2023106222, now seen corresponding path program 1 times [2019-09-08 10:30:05,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:05,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:05,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:05,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:05,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:05,601 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:30:05,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:05,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:30:05,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:30:05,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:30:05,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:05,602 INFO L87 Difference]: Start difference. First operand 4614 states and 6462 transitions. Second operand 3 states. [2019-09-08 10:30:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:05,993 INFO L93 Difference]: Finished difference Result 6705 states and 9435 transitions. [2019-09-08 10:30:05,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:05,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:30:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:05,998 INFO L225 Difference]: With dead ends: 6705 [2019-09-08 10:30:05,998 INFO L226 Difference]: Without dead ends: 4620 [2019-09-08 10:30:06,003 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:30:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4620 states. [2019-09-08 10:30:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4620 to 4614. [2019-09-08 10:30:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4614 states. [2019-09-08 10:30:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 6392 transitions. [2019-09-08 10:30:06,404 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 6392 transitions. Word has length 60 [2019-09-08 10:30:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:06,405 INFO L475 AbstractCegarLoop]: Abstraction has 4614 states and 6392 transitions. [2019-09-08 10:30:06,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:30:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 6392 transitions. [2019-09-08 10:30:06,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:30:06,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:06,407 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] [2019-09-08 10:30:06,408 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:06,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:06,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2132862918, now seen corresponding path program 1 times [2019-09-08 10:30:06,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:06,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:06,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:06,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:30:06,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:06,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:30:06,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:30:06,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:30:06,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:06,476 INFO L87 Difference]: Start difference. First operand 4614 states and 6392 transitions. Second operand 3 states. [2019-09-08 10:30:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:07,141 INFO L93 Difference]: Finished difference Result 6645 states and 9249 transitions. [2019-09-08 10:30:07,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:07,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:30:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:07,147 INFO L225 Difference]: With dead ends: 6645 [2019-09-08 10:30:07,147 INFO L226 Difference]: Without dead ends: 4621 [2019-09-08 10:30:07,156 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:30:07,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4621 states. [2019-09-08 10:30:07,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4621 to 4614. [2019-09-08 10:30:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4614 states. [2019-09-08 10:30:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 6317 transitions. [2019-09-08 10:30:07,634 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 6317 transitions. Word has length 60 [2019-09-08 10:30:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:07,635 INFO L475 AbstractCegarLoop]: Abstraction has 4614 states and 6317 transitions. [2019-09-08 10:30:07,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:30:07,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 6317 transitions. [2019-09-08 10:30:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:30:07,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:07,638 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] [2019-09-08 10:30:07,639 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:07,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:07,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1598100968, now seen corresponding path program 1 times [2019-09-08 10:30:07,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:07,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:07,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:07,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:07,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:07,696 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:30:07,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:07,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:30:07,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:30:07,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:30:07,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:07,698 INFO L87 Difference]: Start difference. First operand 4614 states and 6317 transitions. Second operand 3 states. [2019-09-08 10:30:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:08,164 INFO L93 Difference]: Finished difference Result 7151 states and 9819 transitions. [2019-09-08 10:30:08,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:08,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:30:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:08,169 INFO L225 Difference]: With dead ends: 7151 [2019-09-08 10:30:08,170 INFO L226 Difference]: Without dead ends: 4580 [2019-09-08 10:30:08,176 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:30:08,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4580 states. [2019-09-08 10:30:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4580 to 4574. [2019-09-08 10:30:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4574 states. [2019-09-08 10:30:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6172 transitions. [2019-09-08 10:30:08,558 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6172 transitions. Word has length 60 [2019-09-08 10:30:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:08,558 INFO L475 AbstractCegarLoop]: Abstraction has 4574 states and 6172 transitions. [2019-09-08 10:30:08,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:30:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6172 transitions. [2019-09-08 10:30:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:30:08,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:08,561 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:30:08,561 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1654307287, now seen corresponding path program 1 times [2019-09-08 10:30:08,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:08,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:08,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:08,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:08,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:08,616 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:30:08,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:08,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:30:08,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:30:08,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:30:08,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:08,617 INFO L87 Difference]: Start difference. First operand 4574 states and 6172 transitions. Second operand 3 states. [2019-09-08 10:30:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:09,278 INFO L93 Difference]: Finished difference Result 8443 states and 11497 transitions. [2019-09-08 10:30:09,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:09,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:30:09,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:09,283 INFO L225 Difference]: With dead ends: 8443 [2019-09-08 10:30:09,284 INFO L226 Difference]: Without dead ends: 5711 [2019-09-08 10:30:09,287 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:30:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2019-09-08 10:30:09,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 4191. [2019-09-08 10:30:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4191 states. [2019-09-08 10:30:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 5670 transitions. [2019-09-08 10:30:09,662 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 5670 transitions. Word has length 61 [2019-09-08 10:30:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:09,662 INFO L475 AbstractCegarLoop]: Abstraction has 4191 states and 5670 transitions. [2019-09-08 10:30:09,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:30:09,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 5670 transitions. [2019-09-08 10:30:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:30:09,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:09,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, 1, 1, 1, 1, 1] [2019-09-08 10:30:09,665 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:09,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:09,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1763616113, now seen corresponding path program 1 times [2019-09-08 10:30:09,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:09,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:09,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:09,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:09,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:09,715 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:30:09,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:09,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:30:09,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:30:09,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:30:09,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:09,717 INFO L87 Difference]: Start difference. First operand 4191 states and 5670 transitions. Second operand 3 states. [2019-09-08 10:30:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:10,390 INFO L93 Difference]: Finished difference Result 8185 states and 11205 transitions. [2019-09-08 10:30:10,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:10,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 10:30:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:10,397 INFO L225 Difference]: With dead ends: 8185 [2019-09-08 10:30:10,397 INFO L226 Difference]: Without dead ends: 5867 [2019-09-08 10:30:10,401 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:30:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5867 states. [2019-09-08 10:30:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5867 to 4130. [2019-09-08 10:30:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4130 states. [2019-09-08 10:30:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4130 states to 4130 states and 5583 transitions. [2019-09-08 10:30:10,852 INFO L78 Accepts]: Start accepts. Automaton has 4130 states and 5583 transitions. Word has length 62 [2019-09-08 10:30:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:10,852 INFO L475 AbstractCegarLoop]: Abstraction has 4130 states and 5583 transitions. [2019-09-08 10:30:10,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:30:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 4130 states and 5583 transitions. [2019-09-08 10:30:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:30:10,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:10,855 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:30:10,855 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:10,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:10,856 INFO L82 PathProgramCache]: Analyzing trace with hash -131917929, now seen corresponding path program 1 times [2019-09-08 10:30:10,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:10,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:10,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:10,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:10,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:10,912 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:30:10,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:10,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:30:10,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:30:10,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:30:10,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:10,914 INFO L87 Difference]: Start difference. First operand 4130 states and 5583 transitions. Second operand 3 states. [2019-09-08 10:30:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:11,701 INFO L93 Difference]: Finished difference Result 8072 states and 11034 transitions. [2019-09-08 10:30:11,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:11,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 10:30:11,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:11,707 INFO L225 Difference]: With dead ends: 8072 [2019-09-08 10:30:11,707 INFO L226 Difference]: Without dead ends: 5782 [2019-09-08 10:30:11,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:30:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5782 states. [2019-09-08 10:30:12,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5782 to 4043. [2019-09-08 10:30:12,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4043 states. [2019-09-08 10:30:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4043 states to 4043 states and 5466 transitions. [2019-09-08 10:30:12,208 INFO L78 Accepts]: Start accepts. Automaton has 4043 states and 5466 transitions. Word has length 62 [2019-09-08 10:30:12,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:12,208 INFO L475 AbstractCegarLoop]: Abstraction has 4043 states and 5466 transitions. [2019-09-08 10:30:12,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:30:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4043 states and 5466 transitions. [2019-09-08 10:30:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:30:12,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:12,210 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:30:12,211 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:12,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:12,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1773291386, now seen corresponding path program 1 times [2019-09-08 10:30:12,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:12,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:12,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:12,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:12,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:12,837 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:30:12,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:12,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:30:12,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:30:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:30:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:30:12,839 INFO L87 Difference]: Start difference. First operand 4043 states and 5466 transitions. Second operand 13 states. [2019-09-08 10:30:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:15,109 INFO L93 Difference]: Finished difference Result 6156 states and 8390 transitions. [2019-09-08 10:30:15,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:30:15,109 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-09-08 10:30:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:15,115 INFO L225 Difference]: With dead ends: 6156 [2019-09-08 10:30:15,115 INFO L226 Difference]: Without dead ends: 6152 [2019-09-08 10:30:15,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:30:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6152 states. [2019-09-08 10:30:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6152 to 4039. [2019-09-08 10:30:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4039 states. [2019-09-08 10:30:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4039 states to 4039 states and 5462 transitions. [2019-09-08 10:30:15,610 INFO L78 Accepts]: Start accepts. Automaton has 4039 states and 5462 transitions. Word has length 62 [2019-09-08 10:30:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:15,610 INFO L475 AbstractCegarLoop]: Abstraction has 4039 states and 5462 transitions. [2019-09-08 10:30:15,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:30:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 4039 states and 5462 transitions. [2019-09-08 10:30:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:30:15,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:15,613 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:30:15,613 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:15,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:15,613 INFO L82 PathProgramCache]: Analyzing trace with hash -625592832, now seen corresponding path program 1 times [2019-09-08 10:30:15,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:15,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:15,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:15,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:15,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:15,974 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:30:15,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:15,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:30:15,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:30:15,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:30:15,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:30:15,976 INFO L87 Difference]: Start difference. First operand 4039 states and 5462 transitions. Second operand 10 states. [2019-09-08 10:30:16,442 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 10:30:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:18,643 INFO L93 Difference]: Finished difference Result 8886 states and 12167 transitions. [2019-09-08 10:30:18,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:30:18,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-09-08 10:30:18,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:18,654 INFO L225 Difference]: With dead ends: 8886 [2019-09-08 10:30:18,654 INFO L226 Difference]: Without dead ends: 8297 [2019-09-08 10:30:18,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:30:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8297 states. [2019-09-08 10:30:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8297 to 3970. [2019-09-08 10:30:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3970 states. [2019-09-08 10:30:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3970 states to 3970 states and 5382 transitions. [2019-09-08 10:30:19,230 INFO L78 Accepts]: Start accepts. Automaton has 3970 states and 5382 transitions. Word has length 62 [2019-09-08 10:30:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:19,230 INFO L475 AbstractCegarLoop]: Abstraction has 3970 states and 5382 transitions. [2019-09-08 10:30:19,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:30:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3970 states and 5382 transitions. [2019-09-08 10:30:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:30:19,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:19,234 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:30:19,234 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:19,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:19,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2083745963, now seen corresponding path program 1 times [2019-09-08 10:30:19,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:19,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:19,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:19,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:19,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:19,321 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:30:19,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:19,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:30:19,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:30:19,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:30:19,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:30:19,323 INFO L87 Difference]: Start difference. First operand 3970 states and 5382 transitions. Second operand 6 states. [2019-09-08 10:30:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:21,334 INFO L93 Difference]: Finished difference Result 15327 states and 21191 transitions. [2019-09-08 10:30:21,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:30:21,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-08 10:30:21,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:21,352 INFO L225 Difference]: With dead ends: 15327 [2019-09-08 10:30:21,352 INFO L226 Difference]: Without dead ends: 12305 [2019-09-08 10:30:21,358 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:30:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12305 states. [2019-09-08 10:30:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12305 to 9884. [2019-09-08 10:30:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9884 states. [2019-09-08 10:30:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9884 states to 9884 states and 13340 transitions. [2019-09-08 10:30:22,991 INFO L78 Accepts]: Start accepts. Automaton has 9884 states and 13340 transitions. Word has length 72 [2019-09-08 10:30:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:22,991 INFO L475 AbstractCegarLoop]: Abstraction has 9884 states and 13340 transitions. [2019-09-08 10:30:22,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:30:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 9884 states and 13340 transitions. [2019-09-08 10:30:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:30:22,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:22,996 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:30:22,997 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:22,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:22,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1744904066, now seen corresponding path program 1 times [2019-09-08 10:30:22,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:22,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:22,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:22,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:22,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:23,077 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:30:23,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:23,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:30:23,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:30:23,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:30:23,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:30:23,079 INFO L87 Difference]: Start difference. First operand 9884 states and 13340 transitions. Second operand 5 states. [2019-09-08 10:30:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:24,557 INFO L93 Difference]: Finished difference Result 9890 states and 13343 transitions. [2019-09-08 10:30:24,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:30:24,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-09-08 10:30:24,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:24,572 INFO L225 Difference]: With dead ends: 9890 [2019-09-08 10:30:24,572 INFO L226 Difference]: Without dead ends: 9068 [2019-09-08 10:30:24,577 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:30:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9068 states. [2019-09-08 10:30:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9068 to 9064. [2019-09-08 10:30:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9064 states. [2019-09-08 10:30:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9064 states to 9064 states and 12265 transitions. [2019-09-08 10:30:26,033 INFO L78 Accepts]: Start accepts. Automaton has 9064 states and 12265 transitions. Word has length 73 [2019-09-08 10:30:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:26,033 INFO L475 AbstractCegarLoop]: Abstraction has 9064 states and 12265 transitions. [2019-09-08 10:30:26,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:30:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 9064 states and 12265 transitions. [2019-09-08 10:30:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:30:26,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:26,038 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] [2019-09-08 10:30:26,038 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:26,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:26,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1665118235, now seen corresponding path program 1 times [2019-09-08 10:30:26,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:26,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:26,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:26,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:26,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:26,118 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:30:26,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:26,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:30:26,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:30:26,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:30:26,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:30:26,120 INFO L87 Difference]: Start difference. First operand 9064 states and 12265 transitions. Second operand 6 states. [2019-09-08 10:30:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:29,257 INFO L93 Difference]: Finished difference Result 16603 states and 22321 transitions. [2019-09-08 10:30:29,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:30:29,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-09-08 10:30:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:29,275 INFO L225 Difference]: With dead ends: 16603 [2019-09-08 10:30:29,275 INFO L226 Difference]: Without dead ends: 16601 [2019-09-08 10:30:29,279 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:30:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16601 states. [2019-09-08 10:30:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16601 to 9289. [2019-09-08 10:30:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9289 states. [2019-09-08 10:30:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9289 states to 9289 states and 12415 transitions. [2019-09-08 10:30:30,948 INFO L78 Accepts]: Start accepts. Automaton has 9289 states and 12415 transitions. Word has length 74 [2019-09-08 10:30:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:30,948 INFO L475 AbstractCegarLoop]: Abstraction has 9289 states and 12415 transitions. [2019-09-08 10:30:30,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:30:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 9289 states and 12415 transitions. [2019-09-08 10:30:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:30:30,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:30,953 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:30:30,953 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1859339602, now seen corresponding path program 1 times [2019-09-08 10:30:30,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:30,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:30,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:30,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:30,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:31,016 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:30:31,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:31,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:30:31,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:30:31,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:30:31,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:31,018 INFO L87 Difference]: Start difference. First operand 9289 states and 12415 transitions. Second operand 3 states. [2019-09-08 10:30:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:34,467 INFO L93 Difference]: Finished difference Result 25126 states and 33617 transitions. [2019-09-08 10:30:34,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:34,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:30:34,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:34,488 INFO L225 Difference]: With dead ends: 25126 [2019-09-08 10:30:34,488 INFO L226 Difference]: Without dead ends: 16828 [2019-09-08 10:30:34,499 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:30:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16828 states. [2019-09-08 10:30:37,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16828 to 15767. [2019-09-08 10:30:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15767 states. [2019-09-08 10:30:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15767 states to 15767 states and 20948 transitions. [2019-09-08 10:30:37,119 INFO L78 Accepts]: Start accepts. Automaton has 15767 states and 20948 transitions. Word has length 75 [2019-09-08 10:30:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:37,119 INFO L475 AbstractCegarLoop]: Abstraction has 15767 states and 20948 transitions. [2019-09-08 10:30:37,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:30:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 15767 states and 20948 transitions. [2019-09-08 10:30:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:30:37,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:37,123 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] [2019-09-08 10:30:37,123 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:37,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:37,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1309001061, now seen corresponding path program 1 times [2019-09-08 10:30:37,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:37,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:37,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:37,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:37,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:37,175 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:30:37,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:37,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:30:37,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:30:37,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:30:37,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:37,177 INFO L87 Difference]: Start difference. First operand 15767 states and 20948 transitions. Second operand 3 states. [2019-09-08 10:30:42,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:42,330 INFO L93 Difference]: Finished difference Result 43906 states and 58215 transitions. [2019-09-08 10:30:42,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:42,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:30:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:42,381 INFO L225 Difference]: With dead ends: 43906 [2019-09-08 10:30:42,381 INFO L226 Difference]: Without dead ends: 28904 [2019-09-08 10:30:42,410 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:30:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28904 states. [2019-09-08 10:30:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28904 to 26762. [2019-09-08 10:30:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26762 states. [2019-09-08 10:30:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26762 states to 26762 states and 35121 transitions. [2019-09-08 10:30:48,244 INFO L78 Accepts]: Start accepts. Automaton has 26762 states and 35121 transitions. Word has length 76 [2019-09-08 10:30:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:48,244 INFO L475 AbstractCegarLoop]: Abstraction has 26762 states and 35121 transitions. [2019-09-08 10:30:48,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:30:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand 26762 states and 35121 transitions. [2019-09-08 10:30:48,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:30:48,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:48,248 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] [2019-09-08 10:30:48,249 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:48,249 INFO L82 PathProgramCache]: Analyzing trace with hash 449656965, now seen corresponding path program 1 times [2019-09-08 10:30:48,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:48,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:48,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:48,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:48,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:48,303 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:30:48,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:30:48,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:30:48,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:30:48,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:30:48,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:30:48,304 INFO L87 Difference]: Start difference. First operand 26762 states and 35121 transitions. Second operand 3 states. [2019-09-08 10:30:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:30:55,202 INFO L93 Difference]: Finished difference Result 65367 states and 85692 transitions. [2019-09-08 10:30:55,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:30:55,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 10:30:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:30:55,249 INFO L225 Difference]: With dead ends: 65367 [2019-09-08 10:30:55,249 INFO L226 Difference]: Without dead ends: 39407 [2019-09-08 10:30:55,273 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:30:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39407 states. [2019-09-08 10:31:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39407 to 39405. [2019-09-08 10:31:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39405 states. [2019-09-08 10:31:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39405 states to 39405 states and 51182 transitions. [2019-09-08 10:31:03,107 INFO L78 Accepts]: Start accepts. Automaton has 39405 states and 51182 transitions. Word has length 78 [2019-09-08 10:31:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:03,108 INFO L475 AbstractCegarLoop]: Abstraction has 39405 states and 51182 transitions. [2019-09-08 10:31:03,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:31:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 39405 states and 51182 transitions. [2019-09-08 10:31:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 10:31:03,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:03,113 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, 1, 1, 1, 1, 1, 1] [2019-09-08 10:31:03,114 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:03,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1613619318, now seen corresponding path program 1 times [2019-09-08 10:31:03,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:03,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:03,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:03,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:03,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:03,179 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:31:03,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:31:03,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:31:03,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:31:03,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:31:03,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:31:03,180 INFO L87 Difference]: Start difference. First operand 39405 states and 51182 transitions. Second operand 5 states. [2019-09-08 10:31:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:16,938 INFO L93 Difference]: Finished difference Result 108687 states and 139811 transitions. [2019-09-08 10:31:16,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:31:16,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-08 10:31:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:17,030 INFO L225 Difference]: With dead ends: 108687 [2019-09-08 10:31:17,030 INFO L226 Difference]: Without dead ends: 70084 [2019-09-08 10:31:17,071 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:31:17,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70084 states. [2019-09-08 10:31:26,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70084 to 43828. [2019-09-08 10:31:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43828 states. [2019-09-08 10:31:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43828 states to 43828 states and 56229 transitions. [2019-09-08 10:31:26,740 INFO L78 Accepts]: Start accepts. Automaton has 43828 states and 56229 transitions. Word has length 89 [2019-09-08 10:31:26,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:26,740 INFO L475 AbstractCegarLoop]: Abstraction has 43828 states and 56229 transitions. [2019-09-08 10:31:26,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:31:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand 43828 states and 56229 transitions. [2019-09-08 10:31:26,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:31:26,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:26,750 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, 1, 1, 1] [2019-09-08 10:31:26,751 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:26,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:26,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1950557848, now seen corresponding path program 1 times [2019-09-08 10:31:26,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:26,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:26,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:26,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:26,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:31:26,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:31:26,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:31:26,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:31:26,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:31:26,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:31:26,812 INFO L87 Difference]: Start difference. First operand 43828 states and 56229 transitions. Second operand 3 states. [2019-09-08 10:31:42,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:31:42,195 INFO L93 Difference]: Finished difference Result 124884 states and 159533 transitions. [2019-09-08 10:31:42,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:31:42,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 10:31:42,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:31:42,296 INFO L225 Difference]: With dead ends: 124884 [2019-09-08 10:31:42,296 INFO L226 Difference]: Without dead ends: 81858 [2019-09-08 10:31:42,335 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:31:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81858 states. [2019-09-08 10:31:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81858 to 71410. [2019-09-08 10:31:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71410 states. [2019-09-08 10:31:57,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71410 states to 71410 states and 90250 transitions. [2019-09-08 10:31:57,576 INFO L78 Accepts]: Start accepts. Automaton has 71410 states and 90250 transitions. Word has length 97 [2019-09-08 10:31:57,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:31:57,576 INFO L475 AbstractCegarLoop]: Abstraction has 71410 states and 90250 transitions. [2019-09-08 10:31:57,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:31:57,576 INFO L276 IsEmpty]: Start isEmpty. Operand 71410 states and 90250 transitions. [2019-09-08 10:31:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 10:31:57,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:31:57,586 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, 1, 1, 1] [2019-09-08 10:31:57,586 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:31:57,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:31:57,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1162840062, now seen corresponding path program 1 times [2019-09-08 10:31:57,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:31:57,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:31:57,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:57,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:57,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:31:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:57,706 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:31:57,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:31:57,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:31:57,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:31:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:31:57,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 10:31:57,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:31:58,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:31:58,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:31:58,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:31:58,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2019-09-08 10:31:58,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:31:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:31:58,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:31:58,372 INFO L87 Difference]: Start difference. First operand 71410 states and 90250 transitions. Second operand 13 states. [2019-09-08 10:32:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:32:57,916 INFO L93 Difference]: Finished difference Result 327495 states and 415037 transitions. [2019-09-08 10:32:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 10:32:57,916 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2019-09-08 10:32:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:32:58,584 INFO L225 Difference]: With dead ends: 327495 [2019-09-08 10:32:58,584 INFO L226 Difference]: Without dead ends: 256887 [2019-09-08 10:32:58,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 10:32:58,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256887 states. [2019-09-08 10:33:27,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256887 to 106700. [2019-09-08 10:33:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106700 states. [2019-09-08 10:33:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106700 states to 106700 states and 134726 transitions. [2019-09-08 10:33:27,709 INFO L78 Accepts]: Start accepts. Automaton has 106700 states and 134726 transitions. Word has length 99 [2019-09-08 10:33:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:33:27,710 INFO L475 AbstractCegarLoop]: Abstraction has 106700 states and 134726 transitions. [2019-09-08 10:33:27,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:33:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 106700 states and 134726 transitions. [2019-09-08 10:33:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 10:33:27,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:33:27,745 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] [2019-09-08 10:33:27,745 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:33:27,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:33:27,746 INFO L82 PathProgramCache]: Analyzing trace with hash 719809032, now seen corresponding path program 1 times [2019-09-08 10:33:27,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:33:27,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:33:27,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:27,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:33:27,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:33:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:33:27,821 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:33:27,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:33:27,822 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:33:27,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:33:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:33:28,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 1278 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:33:28,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:33:28,113 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:33:28,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:33:28,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-09-08 10:33:28,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:33:28,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:33:28,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:33:28,120 INFO L87 Difference]: Start difference. First operand 106700 states and 134726 transitions. Second operand 10 states. [2019-09-08 10:34:11,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:34:11,072 INFO L93 Difference]: Finished difference Result 274451 states and 345099 transitions. [2019-09-08 10:34:11,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:34:11,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2019-09-08 10:34:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:34:11,391 INFO L225 Difference]: With dead ends: 274451 [2019-09-08 10:34:11,392 INFO L226 Difference]: Without dead ends: 169898 [2019-09-08 10:34:11,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:34:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169898 states. [2019-09-08 10:34:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169898 to 113375. [2019-09-08 10:34:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113375 states. [2019-09-08 10:34:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113375 states to 113375 states and 140729 transitions. [2019-09-08 10:34:37,372 INFO L78 Accepts]: Start accepts. Automaton has 113375 states and 140729 transitions. Word has length 100 [2019-09-08 10:34:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:34:37,373 INFO L475 AbstractCegarLoop]: Abstraction has 113375 states and 140729 transitions. [2019-09-08 10:34:37,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:34:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 113375 states and 140729 transitions. [2019-09-08 10:34:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 10:34:37,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:34:37,384 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] [2019-09-08 10:34:37,385 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:34:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:34:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash -15585594, now seen corresponding path program 1 times [2019-09-08 10:34:37,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:34:37,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:34:37,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:37,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:34:37,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:34:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:34:37,462 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:34:37,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:34:37,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:34:37,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:34:37,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:34:37,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:34:37,464 INFO L87 Difference]: Start difference. First operand 113375 states and 140729 transitions. Second operand 5 states. [2019-09-08 10:34:38,745 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-09-08 10:35:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:35:11,771 INFO L93 Difference]: Finished difference Result 246521 states and 305698 transitions. [2019-09-08 10:35:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:35:11,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-08 10:35:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:35:11,953 INFO L225 Difference]: With dead ends: 246521 [2019-09-08 10:35:11,953 INFO L226 Difference]: Without dead ends: 134977 [2019-09-08 10:35:12,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:35:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134977 states. [2019-09-08 10:35:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134977 to 110166. [2019-09-08 10:35:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110166 states. [2019-09-08 10:35:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110166 states to 110166 states and 135041 transitions. [2019-09-08 10:35:41,034 INFO L78 Accepts]: Start accepts. Automaton has 110166 states and 135041 transitions. Word has length 101 [2019-09-08 10:35:41,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:35:41,034 INFO L475 AbstractCegarLoop]: Abstraction has 110166 states and 135041 transitions. [2019-09-08 10:35:41,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:35:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 110166 states and 135041 transitions. [2019-09-08 10:35:41,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 10:35:41,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:35:41,044 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:35:41,044 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:35:41,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:35:41,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1855442686, now seen corresponding path program 1 times [2019-09-08 10:35:41,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:35:41,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:35:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:41,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:35:41,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:35:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:35:41,146 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:35:41,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:35:41,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:35:41,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:35:41,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:35:41,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:35:41,147 INFO L87 Difference]: Start difference. First operand 110166 states and 135041 transitions. Second operand 5 states. [2019-09-08 10:36:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:36:14,450 INFO L93 Difference]: Finished difference Result 197638 states and 242639 transitions. [2019-09-08 10:36:14,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:36:14,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 10:36:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:36:14,617 INFO L225 Difference]: With dead ends: 197638 [2019-09-08 10:36:14,617 INFO L226 Difference]: Without dead ends: 149944 [2019-09-08 10:36:14,663 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:36:14,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149944 states. [2019-09-08 10:36:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149944 to 124632. [2019-09-08 10:36:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124632 states. [2019-09-08 10:36:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124632 states to 124632 states and 152437 transitions. [2019-09-08 10:36:46,399 INFO L78 Accepts]: Start accepts. Automaton has 124632 states and 152437 transitions. Word has length 103 [2019-09-08 10:36:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:36:46,400 INFO L475 AbstractCegarLoop]: Abstraction has 124632 states and 152437 transitions. [2019-09-08 10:36:46,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:36:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 124632 states and 152437 transitions. [2019-09-08 10:36:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 10:36:46,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:36:46,411 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:36:46,411 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:36:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:36:46,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1041085272, now seen corresponding path program 1 times [2019-09-08 10:36:46,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:36:46,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:36:46,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:46,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:36:46,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:36:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:36:46,511 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:36:46,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:36:46,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:36:46,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:36:46,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:36:46,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:36:46,514 INFO L87 Difference]: Start difference. First operand 124632 states and 152437 transitions. Second operand 4 states. [2019-09-08 10:37:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:37:54,510 INFO L93 Difference]: Finished difference Result 395833 states and 483628 transitions. [2019-09-08 10:37:54,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:37:54,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-08 10:37:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:37:54,914 INFO L225 Difference]: With dead ends: 395833 [2019-09-08 10:37:54,914 INFO L226 Difference]: Without dead ends: 273245 [2019-09-08 10:37:55,036 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:37:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273245 states. [2019-09-08 10:38:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273245 to 124092. [2019-09-08 10:38:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124092 states. [2019-09-08 10:38:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124092 states to 124092 states and 151810 transitions. [2019-09-08 10:38:25,525 INFO L78 Accepts]: Start accepts. Automaton has 124092 states and 151810 transitions. Word has length 105 [2019-09-08 10:38:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:38:25,526 INFO L475 AbstractCegarLoop]: Abstraction has 124092 states and 151810 transitions. [2019-09-08 10:38:25,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:38:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 124092 states and 151810 transitions. [2019-09-08 10:38:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 10:38:25,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:38:25,534 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:38:25,534 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:38:25,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:38:25,535 INFO L82 PathProgramCache]: Analyzing trace with hash 680245603, now seen corresponding path program 1 times [2019-09-08 10:38:25,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:38:25,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:38:25,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:25,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:38:25,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:38:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:38:25,829 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:38:25,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:38:25,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:38:25,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:38:25,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:38:25,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:38:25,831 INFO L87 Difference]: Start difference. First operand 124092 states and 151810 transitions. Second operand 5 states. [2019-09-08 10:39:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:39:23,158 INFO L93 Difference]: Finished difference Result 268847 states and 326251 transitions. [2019-09-08 10:39:23,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:39:23,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-08 10:39:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:39:23,469 INFO L225 Difference]: With dead ends: 268847 [2019-09-08 10:39:23,469 INFO L226 Difference]: Without dead ends: 226749 [2019-09-08 10:39:23,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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:39:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226749 states. [2019-09-08 10:39:54,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226749 to 123717. [2019-09-08 10:39:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123717 states. [2019-09-08 10:39:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123717 states to 123717 states and 151365 transitions. [2019-09-08 10:39:54,187 INFO L78 Accepts]: Start accepts. Automaton has 123717 states and 151365 transitions. Word has length 105 [2019-09-08 10:39:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:39:54,187 INFO L475 AbstractCegarLoop]: Abstraction has 123717 states and 151365 transitions. [2019-09-08 10:39:54,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:39:54,187 INFO L276 IsEmpty]: Start isEmpty. Operand 123717 states and 151365 transitions. [2019-09-08 10:39:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 10:39:54,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:39:54,194 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] [2019-09-08 10:39:54,195 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:39:54,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:39:54,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1800782462, now seen corresponding path program 1 times [2019-09-08 10:39:54,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:39:54,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:39:54,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:54,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:39:54,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:39:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:39:54,295 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:39:54,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:39:54,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:39:54,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:39:54,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:39:54,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:39:54,296 INFO L87 Difference]: Start difference. First operand 123717 states and 151365 transitions. Second operand 5 states. [2019-09-08 10:40:36,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:36,592 INFO L93 Difference]: Finished difference Result 187670 states and 229256 transitions. [2019-09-08 10:40:36,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:40:36,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-08 10:40:36,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:36,778 INFO L225 Difference]: With dead ends: 187670 [2019-09-08 10:40:36,778 INFO L226 Difference]: Without dead ends: 158371 [2019-09-08 10:40:36,824 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:40:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158371 states. [2019-09-08 10:41:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158371 to 139125. [2019-09-08 10:41:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139125 states. [2019-09-08 10:41:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139125 states to 139125 states and 169874 transitions. [2019-09-08 10:41:11,572 INFO L78 Accepts]: Start accepts. Automaton has 139125 states and 169874 transitions. Word has length 106 [2019-09-08 10:41:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:11,572 INFO L475 AbstractCegarLoop]: Abstraction has 139125 states and 169874 transitions. [2019-09-08 10:41:11,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:41:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 139125 states and 169874 transitions. [2019-09-08 10:41:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 10:41:11,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:11,584 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:41:11,584 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:11,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:11,585 INFO L82 PathProgramCache]: Analyzing trace with hash 543051623, now seen corresponding path program 1 times [2019-09-08 10:41:11,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:11,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:11,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:11,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:11,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:11,658 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:41:11,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:11,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:41:11,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:41:11,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:41:11,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:41:11,660 INFO L87 Difference]: Start difference. First operand 139125 states and 169874 transitions. Second operand 4 states. [2019-09-08 10:42:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:17,302 INFO L93 Difference]: Finished difference Result 324306 states and 396371 transitions. [2019-09-08 10:42:17,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:42:17,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-08 10:42:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:17,689 INFO L225 Difference]: With dead ends: 324306 [2019-09-08 10:42:17,689 INFO L226 Difference]: Without dead ends: 261120 [2019-09-08 10:42:17,922 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:42:18,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261120 states.