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.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:24:04,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:24:04,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:24:04,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:24:04,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:24:04,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:24:04,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:24:04,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:24:04,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:24:04,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:24:04,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:24:04,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:24:04,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:24:04,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:24:04,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:24:04,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:24:04,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:24:04,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:24:04,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:24:04,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:24:04,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:24:04,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:24:04,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:24:04,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:24:04,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:24:04,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:24:04,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:24:04,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:24:04,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:24:04,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:24:04,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:24:04,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:24:04,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:24:04,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:24:04,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:24:04,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:24:04,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:24:04,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:24:04,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:24:04,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:24:04,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:24:04,970 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 12:24:04,983 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:24:04,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:24:04,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:24:04,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:24:04,985 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:24:04,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:24:04,986 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:24:04,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:24:04,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:24:04,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:24:04,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:24:04,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:24:04,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:24:04,987 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:24:04,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:24:04,987 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:24:04,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:24:04,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:24:04,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:24:04,988 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:24:04,988 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:24:04,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:24:04,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:24:04,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:24:04,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:24:04,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:24:04,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:24:04,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:24:04,990 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:24:05,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:24:05,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:24:05,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:24:05,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:24:05,038 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:24:05,039 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-08 12:24:05,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/321c711be/abd9e92bff6f49b6881e09dce09d44db/FLAGbe00ea514 [2019-09-08 12:24:05,663 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:24:05,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-08 12:24:05,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/321c711be/abd9e92bff6f49b6881e09dce09d44db/FLAGbe00ea514 [2019-09-08 12:24:05,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/321c711be/abd9e92bff6f49b6881e09dce09d44db [2019-09-08 12:24:05,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:24:05,975 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:24:05,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:24:05,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:24:05,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:24:05,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:24:05" (1/1) ... [2019-09-08 12:24:05,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0320eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:24:05, skipping insertion in model container [2019-09-08 12:24:05,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:24:05" (1/1) ... [2019-09-08 12:24:05,994 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:24:06,084 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:24:06,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:24:06,720 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:24:06,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:24:06,884 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:24:06,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:24:06 WrapperNode [2019-09-08 12:24:06,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:24:06,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:24:06,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:24:06,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:24:06,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:24:06" (1/1) ... [2019-09-08 12:24:06,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:24:06" (1/1) ... [2019-09-08 12:24:06,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:24:06" (1/1) ... [2019-09-08 12:24:06,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:24:06" (1/1) ... [2019-09-08 12:24:06,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:24:06" (1/1) ... [2019-09-08 12:24:06,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:24:06" (1/1) ... [2019-09-08 12:24:06,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:24:06" (1/1) ... [2019-09-08 12:24:06,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:24:06,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:24:06,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:24:06,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:24:06,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:24:06" (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 12:24:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:24:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:24:07,049 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:24:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:24:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:24:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:24:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:24:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:24:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:24:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:24:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:24:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:24:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:24:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:24:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:24:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:24:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:24:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:24:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:24:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:24:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:24:08,364 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:24:08,365 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:24:08,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:24:08 BoogieIcfgContainer [2019-09-08 12:24:08,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:24:08,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:24:08,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:24:08,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:24:08,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:24:05" (1/3) ... [2019-09-08 12:24:08,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9761567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:24:08, skipping insertion in model container [2019-09-08 12:24:08,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:24:06" (2/3) ... [2019-09-08 12:24:08,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9761567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:24:08, skipping insertion in model container [2019-09-08 12:24:08,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:24:08" (3/3) ... [2019-09-08 12:24:08,379 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-08 12:24:08,392 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:24:08,416 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:24:08,433 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:24:08,477 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:24:08,478 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:24:08,478 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:24:08,478 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:24:08,478 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:24:08,478 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:24:08,479 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:24:08,479 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:24:08,479 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:24:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states. [2019-09-08 12:24:08,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:24:08,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:08,533 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, 1, 1, 1, 1, 1, 1] [2019-09-08 12:24:08,536 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:08,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:08,540 INFO L82 PathProgramCache]: Analyzing trace with hash 948780422, now seen corresponding path program 1 times [2019-09-08 12:24:08,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:08,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:08,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:08,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:08,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:08,951 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 12:24:08,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:08,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:24:08,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:24:08,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:24:08,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:24:08,975 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 4 states. [2019-09-08 12:24:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:09,157 INFO L93 Difference]: Finished difference Result 476 states and 774 transitions. [2019-09-08 12:24:09,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:24:09,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-08 12:24:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:09,180 INFO L225 Difference]: With dead ends: 476 [2019-09-08 12:24:09,181 INFO L226 Difference]: Without dead ends: 255 [2019-09-08 12:24:09,188 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 12:24:09,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-08 12:24:09,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-09-08 12:24:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 12:24:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 378 transitions. [2019-09-08 12:24:09,273 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 378 transitions. Word has length 95 [2019-09-08 12:24:09,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:09,273 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 378 transitions. [2019-09-08 12:24:09,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:24:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 378 transitions. [2019-09-08 12:24:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:24:09,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:09,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:09,283 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:09,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:09,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2104336594, now seen corresponding path program 1 times [2019-09-08 12:24:09,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:09,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:09,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:09,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:09,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:09,567 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 12:24:09,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:09,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:09,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:09,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:09,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:09,570 INFO L87 Difference]: Start difference. First operand 255 states and 378 transitions. Second operand 3 states. [2019-09-08 12:24:09,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:09,626 INFO L93 Difference]: Finished difference Result 573 states and 884 transitions. [2019-09-08 12:24:09,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:09,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-09-08 12:24:09,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:09,630 INFO L225 Difference]: With dead ends: 573 [2019-09-08 12:24:09,630 INFO L226 Difference]: Without dead ends: 372 [2019-09-08 12:24:09,633 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 12:24:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-08 12:24:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 370. [2019-09-08 12:24:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 12:24:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 560 transitions. [2019-09-08 12:24:09,687 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 560 transitions. Word has length 134 [2019-09-08 12:24:09,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:09,687 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 560 transitions. [2019-09-08 12:24:09,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:09,688 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 560 transitions. [2019-09-08 12:24:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:24:09,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:09,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:09,691 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:09,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:09,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1055745023, now seen corresponding path program 1 times [2019-09-08 12:24:09,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:09,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:09,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:09,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:09,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:09,844 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 12:24:09,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:09,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:09,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:09,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:09,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:09,848 INFO L87 Difference]: Start difference. First operand 370 states and 560 transitions. Second operand 3 states. [2019-09-08 12:24:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:09,907 INFO L93 Difference]: Finished difference Result 888 states and 1385 transitions. [2019-09-08 12:24:09,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:09,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 12:24:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:09,914 INFO L225 Difference]: With dead ends: 888 [2019-09-08 12:24:09,919 INFO L226 Difference]: Without dead ends: 578 [2019-09-08 12:24:09,923 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 12:24:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-08 12:24:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 576. [2019-09-08 12:24:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-08 12:24:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 886 transitions. [2019-09-08 12:24:09,966 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 886 transitions. Word has length 136 [2019-09-08 12:24:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:09,966 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 886 transitions. [2019-09-08 12:24:09,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 886 transitions. [2019-09-08 12:24:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 12:24:09,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:09,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:09,971 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:09,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:09,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1892333628, now seen corresponding path program 1 times [2019-09-08 12:24:09,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:09,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:09,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:10,123 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 12:24:10,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:10,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:10,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:10,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:10,126 INFO L87 Difference]: Start difference. First operand 576 states and 886 transitions. Second operand 3 states. [2019-09-08 12:24:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:10,183 INFO L93 Difference]: Finished difference Result 1448 states and 2273 transitions. [2019-09-08 12:24:10,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:10,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-09-08 12:24:10,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:10,192 INFO L225 Difference]: With dead ends: 1448 [2019-09-08 12:24:10,192 INFO L226 Difference]: Without dead ends: 938 [2019-09-08 12:24:10,194 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 12:24:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-09-08 12:24:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 936. [2019-09-08 12:24:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2019-09-08 12:24:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1454 transitions. [2019-09-08 12:24:10,231 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1454 transitions. Word has length 138 [2019-09-08 12:24:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:10,232 INFO L475 AbstractCegarLoop]: Abstraction has 936 states and 1454 transitions. [2019-09-08 12:24:10,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1454 transitions. [2019-09-08 12:24:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 12:24:10,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:10,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:10,236 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:10,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:10,237 INFO L82 PathProgramCache]: Analyzing trace with hash -92485214, now seen corresponding path program 1 times [2019-09-08 12:24:10,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:10,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:10,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:10,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:10,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:10,359 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 12:24:10,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:10,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:10,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:10,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:10,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:10,361 INFO L87 Difference]: Start difference. First operand 936 states and 1454 transitions. Second operand 3 states. [2019-09-08 12:24:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:10,446 INFO L93 Difference]: Finished difference Result 2414 states and 3797 transitions. [2019-09-08 12:24:10,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:10,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-08 12:24:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:10,459 INFO L225 Difference]: With dead ends: 2414 [2019-09-08 12:24:10,459 INFO L226 Difference]: Without dead ends: 1550 [2019-09-08 12:24:10,462 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 12:24:10,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2019-09-08 12:24:10,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1548. [2019-09-08 12:24:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-09-08 12:24:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2414 transitions. [2019-09-08 12:24:10,554 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2414 transitions. Word has length 140 [2019-09-08 12:24:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:10,554 INFO L475 AbstractCegarLoop]: Abstraction has 1548 states and 2414 transitions. [2019-09-08 12:24:10,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2414 transitions. [2019-09-08 12:24:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 12:24:10,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:10,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:10,564 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:10,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:10,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1568530186, now seen corresponding path program 1 times [2019-09-08 12:24:10,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:10,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:10,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:10,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:10,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:10,710 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 12:24:10,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:10,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:10,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:10,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:10,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:10,712 INFO L87 Difference]: Start difference. First operand 1548 states and 2414 transitions. Second operand 3 states. [2019-09-08 12:24:10,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:10,933 INFO L93 Difference]: Finished difference Result 4024 states and 6317 transitions. [2019-09-08 12:24:10,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:10,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-08 12:24:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:10,950 INFO L225 Difference]: With dead ends: 4024 [2019-09-08 12:24:10,951 INFO L226 Difference]: Without dead ends: 2554 [2019-09-08 12:24:10,954 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 12:24:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2019-09-08 12:24:11,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2552. [2019-09-08 12:24:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2552 states. [2019-09-08 12:24:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3974 transitions. [2019-09-08 12:24:11,091 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3974 transitions. Word has length 142 [2019-09-08 12:24:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:11,093 INFO L475 AbstractCegarLoop]: Abstraction has 2552 states and 3974 transitions. [2019-09-08 12:24:11,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3974 transitions. [2019-09-08 12:24:11,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:24:11,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:11,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:11,102 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:11,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:11,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2081311946, now seen corresponding path program 1 times [2019-09-08 12:24:11,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:11,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:11,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:11,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:11,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:11,209 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 12:24:11,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:11,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:11,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:11,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:11,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:11,211 INFO L87 Difference]: Start difference. First operand 2552 states and 3974 transitions. Second operand 3 states. [2019-09-08 12:24:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:11,398 INFO L93 Difference]: Finished difference Result 6586 states and 10277 transitions. [2019-09-08 12:24:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:11,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 12:24:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:11,422 INFO L225 Difference]: With dead ends: 6586 [2019-09-08 12:24:11,422 INFO L226 Difference]: Without dead ends: 4118 [2019-09-08 12:24:11,428 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 12:24:11,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2019-09-08 12:24:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 4116. [2019-09-08 12:24:11,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4116 states. [2019-09-08 12:24:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 6366 transitions. [2019-09-08 12:24:11,698 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 6366 transitions. Word has length 144 [2019-09-08 12:24:11,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:11,698 INFO L475 AbstractCegarLoop]: Abstraction has 4116 states and 6366 transitions. [2019-09-08 12:24:11,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 6366 transitions. [2019-09-08 12:24:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:11,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:11,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:11,711 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:11,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:11,712 INFO L82 PathProgramCache]: Analyzing trace with hash -638569554, now seen corresponding path program 1 times [2019-09-08 12:24:11,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:11,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:11,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:11,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:11,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:11,799 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 12:24:11,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:11,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:11,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:11,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:11,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:11,801 INFO L87 Difference]: Start difference. First operand 4116 states and 6366 transitions. Second operand 3 states. [2019-09-08 12:24:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:12,423 INFO L93 Difference]: Finished difference Result 11562 states and 17887 transitions. [2019-09-08 12:24:12,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:12,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 12:24:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:12,464 INFO L225 Difference]: With dead ends: 11562 [2019-09-08 12:24:12,464 INFO L226 Difference]: Without dead ends: 8132 [2019-09-08 12:24:12,472 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 12:24:12,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8132 states. [2019-09-08 12:24:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8132 to 8130. [2019-09-08 12:24:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8130 states. [2019-09-08 12:24:12,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8130 states to 8130 states and 12553 transitions. [2019-09-08 12:24:12,800 INFO L78 Accepts]: Start accepts. Automaton has 8130 states and 12553 transitions. Word has length 146 [2019-09-08 12:24:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:12,800 INFO L475 AbstractCegarLoop]: Abstraction has 8130 states and 12553 transitions. [2019-09-08 12:24:12,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 8130 states and 12553 transitions. [2019-09-08 12:24:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:12,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:12,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:12,824 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:12,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:12,825 INFO L82 PathProgramCache]: Analyzing trace with hash -24546701, now seen corresponding path program 1 times [2019-09-08 12:24:12,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:12,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:12,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:12,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:12,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:12,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 12:24:12,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:12,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:12,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:12,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:12,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:12,914 INFO L87 Difference]: Start difference. First operand 8130 states and 12553 transitions. Second operand 3 states. [2019-09-08 12:24:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:13,668 INFO L93 Difference]: Finished difference Result 22858 states and 35229 transitions. [2019-09-08 12:24:13,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:13,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 12:24:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:13,735 INFO L225 Difference]: With dead ends: 22858 [2019-09-08 12:24:13,735 INFO L226 Difference]: Without dead ends: 16104 [2019-09-08 12:24:13,753 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 12:24:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2019-09-08 12:24:14,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 16102. [2019-09-08 12:24:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16102 states. [2019-09-08 12:24:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16102 states to 16102 states and 24779 transitions. [2019-09-08 12:24:14,391 INFO L78 Accepts]: Start accepts. Automaton has 16102 states and 24779 transitions. Word has length 146 [2019-09-08 12:24:14,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:14,392 INFO L475 AbstractCegarLoop]: Abstraction has 16102 states and 24779 transitions. [2019-09-08 12:24:14,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand 16102 states and 24779 transitions. [2019-09-08 12:24:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:14,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:14,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:14,437 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:14,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:14,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1040738216, now seen corresponding path program 1 times [2019-09-08 12:24:14,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:14,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:14,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:14,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:14,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:14,532 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 12:24:14,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:14,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:14,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:14,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:14,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:14,534 INFO L87 Difference]: Start difference. First operand 16102 states and 24779 transitions. Second operand 3 states. [2019-09-08 12:24:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:16,161 INFO L93 Difference]: Finished difference Result 45632 states and 70069 transitions. [2019-09-08 12:24:16,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:16,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 12:24:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:16,255 INFO L225 Difference]: With dead ends: 45632 [2019-09-08 12:24:16,256 INFO L226 Difference]: Without dead ends: 32010 [2019-09-08 12:24:16,293 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 12:24:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32010 states. [2019-09-08 12:24:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32010 to 32008. [2019-09-08 12:24:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32008 states. [2019-09-08 12:24:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32008 states to 32008 states and 49087 transitions. [2019-09-08 12:24:17,520 INFO L78 Accepts]: Start accepts. Automaton has 32008 states and 49087 transitions. Word has length 146 [2019-09-08 12:24:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:17,521 INFO L475 AbstractCegarLoop]: Abstraction has 32008 states and 49087 transitions. [2019-09-08 12:24:17,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 32008 states and 49087 transitions. [2019-09-08 12:24:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:17,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:17,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:17,601 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1803601923, now seen corresponding path program 1 times [2019-09-08 12:24:17,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:17,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:17,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:17,739 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 12:24:17,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:17,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:24:17,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:24:17,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:24:17,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:24:17,741 INFO L87 Difference]: Start difference. First operand 32008 states and 49087 transitions. Second operand 5 states. [2019-09-08 12:24:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:19,039 INFO L93 Difference]: Finished difference Result 63964 states and 98120 transitions. [2019-09-08 12:24:19,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:24:19,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-09-08 12:24:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:19,093 INFO L225 Difference]: With dead ends: 63964 [2019-09-08 12:24:19,093 INFO L226 Difference]: Without dead ends: 32008 [2019-09-08 12:24:19,155 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 12:24:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32008 states. [2019-09-08 12:24:21,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32008 to 32008. [2019-09-08 12:24:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32008 states. [2019-09-08 12:24:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32008 states to 32008 states and 48822 transitions. [2019-09-08 12:24:21,412 INFO L78 Accepts]: Start accepts. Automaton has 32008 states and 48822 transitions. Word has length 146 [2019-09-08 12:24:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:21,413 INFO L475 AbstractCegarLoop]: Abstraction has 32008 states and 48822 transitions. [2019-09-08 12:24:21,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:24:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 32008 states and 48822 transitions. [2019-09-08 12:24:21,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:21,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:21,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:21,456 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:21,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:21,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1070960903, now seen corresponding path program 1 times [2019-09-08 12:24:21,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:21,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:21,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:21,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:21,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:24:21,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:21,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:24:21,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:24:21,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:24:21,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:24:21,580 INFO L87 Difference]: Start difference. First operand 32008 states and 48822 transitions. Second operand 5 states. [2019-09-08 12:24:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:22,979 INFO L93 Difference]: Finished difference Result 63874 states and 97471 transitions. [2019-09-08 12:24:22,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:24:22,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-09-08 12:24:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:23,036 INFO L225 Difference]: With dead ends: 63874 [2019-09-08 12:24:23,036 INFO L226 Difference]: Without dead ends: 32008 [2019-09-08 12:24:23,083 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 12:24:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32008 states. [2019-09-08 12:24:24,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32008 to 32008. [2019-09-08 12:24:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32008 states. [2019-09-08 12:24:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32008 states to 32008 states and 48430 transitions. [2019-09-08 12:24:24,549 INFO L78 Accepts]: Start accepts. Automaton has 32008 states and 48430 transitions. Word has length 146 [2019-09-08 12:24:24,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:24,550 INFO L475 AbstractCegarLoop]: Abstraction has 32008 states and 48430 transitions. [2019-09-08 12:24:24,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:24:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 32008 states and 48430 transitions. [2019-09-08 12:24:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:24,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:24,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:24,594 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:24,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:24,595 INFO L82 PathProgramCache]: Analyzing trace with hash -990480985, now seen corresponding path program 1 times [2019-09-08 12:24:24,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:24,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:24,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:24,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:24,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:24,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 12:24:24,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:24,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:24:24,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:24:24,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:24:24,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:24:24,711 INFO L87 Difference]: Start difference. First operand 32008 states and 48430 transitions. Second operand 5 states. [2019-09-08 12:24:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:26,011 INFO L93 Difference]: Finished difference Result 45554 states and 68871 transitions. [2019-09-08 12:24:26,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:24:26,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-09-08 12:24:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:26,029 INFO L225 Difference]: With dead ends: 45554 [2019-09-08 12:24:26,029 INFO L226 Difference]: Without dead ends: 16112 [2019-09-08 12:24:26,058 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 12:24:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16112 states. [2019-09-08 12:24:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16112 to 16112. [2019-09-08 12:24:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16112 states. [2019-09-08 12:24:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16112 states to 16112 states and 24324 transitions. [2019-09-08 12:24:26,537 INFO L78 Accepts]: Start accepts. Automaton has 16112 states and 24324 transitions. Word has length 146 [2019-09-08 12:24:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:26,537 INFO L475 AbstractCegarLoop]: Abstraction has 16112 states and 24324 transitions. [2019-09-08 12:24:26,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:24:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 16112 states and 24324 transitions. [2019-09-08 12:24:26,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:26,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:26,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:26,554 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:26,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1390725383, now seen corresponding path program 1 times [2019-09-08 12:24:26,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:26,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:26,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:26,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:26,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:26,649 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 12:24:26,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:26,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:26,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:26,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:26,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:26,651 INFO L87 Difference]: Start difference. First operand 16112 states and 24324 transitions. Second operand 3 states. [2019-09-08 12:24:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:27,437 INFO L93 Difference]: Finished difference Result 27508 states and 41222 transitions. [2019-09-08 12:24:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:27,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 12:24:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:27,452 INFO L225 Difference]: With dead ends: 27508 [2019-09-08 12:24:27,452 INFO L226 Difference]: Without dead ends: 14018 [2019-09-08 12:24:27,464 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 12:24:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14018 states. [2019-09-08 12:24:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14018 to 14016. [2019-09-08 12:24:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14016 states. [2019-09-08 12:24:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14016 states to 14016 states and 20852 transitions. [2019-09-08 12:24:27,886 INFO L78 Accepts]: Start accepts. Automaton has 14016 states and 20852 transitions. Word has length 146 [2019-09-08 12:24:27,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:27,886 INFO L475 AbstractCegarLoop]: Abstraction has 14016 states and 20852 transitions. [2019-09-08 12:24:27,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 14016 states and 20852 transitions. [2019-09-08 12:24:27,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:27,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:27,897 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:27,897 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:27,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:27,898 INFO L82 PathProgramCache]: Analyzing trace with hash -227357900, now seen corresponding path program 1 times [2019-09-08 12:24:27,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:27,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:27,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:27,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:27,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:28,008 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 12:24:28,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:28,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:28,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:28,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:28,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:28,010 INFO L87 Difference]: Start difference. First operand 14016 states and 20852 transitions. Second operand 3 states. [2019-09-08 12:24:28,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:28,265 INFO L93 Difference]: Finished difference Result 19716 states and 29238 transitions. [2019-09-08 12:24:28,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:28,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 12:24:28,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:28,273 INFO L225 Difference]: With dead ends: 19716 [2019-09-08 12:24:28,273 INFO L226 Difference]: Without dead ends: 7100 [2019-09-08 12:24:28,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 12:24:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7100 states. [2019-09-08 12:24:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7100 to 7098. [2019-09-08 12:24:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7098 states. [2019-09-08 12:24:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7098 states to 7098 states and 10474 transitions. [2019-09-08 12:24:28,499 INFO L78 Accepts]: Start accepts. Automaton has 7098 states and 10474 transitions. Word has length 146 [2019-09-08 12:24:28,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:28,499 INFO L475 AbstractCegarLoop]: Abstraction has 7098 states and 10474 transitions. [2019-09-08 12:24:28,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 7098 states and 10474 transitions. [2019-09-08 12:24:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:24:28,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:28,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:28,504 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:28,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:28,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2122099427, now seen corresponding path program 1 times [2019-09-08 12:24:28,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:28,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:28,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:28,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:28,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:28,836 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 12:24:28,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:28,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:24:28,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:24:28,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:24:28,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:24:28,841 INFO L87 Difference]: Start difference. First operand 7098 states and 10474 transitions. Second operand 8 states. [2019-09-08 12:24:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:31,436 INFO L93 Difference]: Finished difference Result 69906 states and 102848 transitions. [2019-09-08 12:24:31,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:24:31,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 146 [2019-09-08 12:24:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:31,502 INFO L225 Difference]: With dead ends: 69906 [2019-09-08 12:24:31,502 INFO L226 Difference]: Without dead ends: 62970 [2019-09-08 12:24:31,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:24:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62970 states. [2019-09-08 12:24:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62970 to 20756. [2019-09-08 12:24:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20756 states. [2019-09-08 12:24:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20756 states to 20756 states and 30304 transitions. [2019-09-08 12:24:32,824 INFO L78 Accepts]: Start accepts. Automaton has 20756 states and 30304 transitions. Word has length 146 [2019-09-08 12:24:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:32,824 INFO L475 AbstractCegarLoop]: Abstraction has 20756 states and 30304 transitions. [2019-09-08 12:24:32,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:24:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 20756 states and 30304 transitions. [2019-09-08 12:24:32,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:24:32,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:32,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:32,837 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:32,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:32,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1604732671, now seen corresponding path program 1 times [2019-09-08 12:24:32,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:32,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:32,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:32,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:32,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:32,932 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 12:24:32,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:32,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:32,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:32,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:32,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:32,934 INFO L87 Difference]: Start difference. First operand 20756 states and 30304 transitions. Second operand 3 states. [2019-09-08 12:24:33,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:33,758 INFO L93 Difference]: Finished difference Result 41354 states and 60421 transitions. [2019-09-08 12:24:33,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:33,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 12:24:33,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:33,781 INFO L225 Difference]: With dead ends: 41354 [2019-09-08 12:24:33,781 INFO L226 Difference]: Without dead ends: 20752 [2019-09-08 12:24:33,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 12:24:33,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20752 states. [2019-09-08 12:24:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20752 to 20752. [2019-09-08 12:24:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20752 states. [2019-09-08 12:24:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20752 states to 20752 states and 30292 transitions. [2019-09-08 12:24:35,602 INFO L78 Accepts]: Start accepts. Automaton has 20752 states and 30292 transitions. Word has length 150 [2019-09-08 12:24:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:35,602 INFO L475 AbstractCegarLoop]: Abstraction has 20752 states and 30292 transitions. [2019-09-08 12:24:35,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 20752 states and 30292 transitions. [2019-09-08 12:24:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:24:35,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:35,614 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:35,615 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:35,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:35,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1663507810, now seen corresponding path program 1 times [2019-09-08 12:24:35,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:35,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:35,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:35,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:35,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:35,699 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 12:24:35,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:35,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:24:35,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:24:35,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:24:35,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:24:35,700 INFO L87 Difference]: Start difference. First operand 20752 states and 30292 transitions. Second operand 3 states. [2019-09-08 12:24:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:36,267 INFO L93 Difference]: Finished difference Result 29300 states and 42646 transitions. [2019-09-08 12:24:36,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:24:36,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 12:24:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:36,280 INFO L225 Difference]: With dead ends: 29300 [2019-09-08 12:24:36,280 INFO L226 Difference]: Without dead ends: 10554 [2019-09-08 12:24:36,296 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 12:24:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10554 states. [2019-09-08 12:24:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10554 to 10552. [2019-09-08 12:24:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10552 states. [2019-09-08 12:24:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10552 states to 10552 states and 15284 transitions. [2019-09-08 12:24:36,732 INFO L78 Accepts]: Start accepts. Automaton has 10552 states and 15284 transitions. Word has length 150 [2019-09-08 12:24:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:36,732 INFO L475 AbstractCegarLoop]: Abstraction has 10552 states and 15284 transitions. [2019-09-08 12:24:36,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:24:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 10552 states and 15284 transitions. [2019-09-08 12:24:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:24:36,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:36,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:36,738 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:36,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:36,739 INFO L82 PathProgramCache]: Analyzing trace with hash 220267747, now seen corresponding path program 1 times [2019-09-08 12:24:36,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:36,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:36,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:36,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:36,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:36,896 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 12:24:36,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:36,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:24:36,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:24:36,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:24:36,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:24:36,898 INFO L87 Difference]: Start difference. First operand 10552 states and 15284 transitions. Second operand 8 states. [2019-09-08 12:24:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:39,291 INFO L93 Difference]: Finished difference Result 49878 states and 71915 transitions. [2019-09-08 12:24:39,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:24:39,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-08 12:24:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:39,343 INFO L225 Difference]: With dead ends: 49878 [2019-09-08 12:24:39,343 INFO L226 Difference]: Without dead ends: 46996 [2019-09-08 12:24:39,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:24:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46996 states. [2019-09-08 12:24:40,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46996 to 16676. [2019-09-08 12:24:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16676 states. [2019-09-08 12:24:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16676 states to 16676 states and 23964 transitions. [2019-09-08 12:24:40,632 INFO L78 Accepts]: Start accepts. Automaton has 16676 states and 23964 transitions. Word has length 150 [2019-09-08 12:24:40,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:40,632 INFO L475 AbstractCegarLoop]: Abstraction has 16676 states and 23964 transitions. [2019-09-08 12:24:40,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:24:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 16676 states and 23964 transitions. [2019-09-08 12:24:40,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:24:40,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:40,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:40,641 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:40,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:40,641 INFO L82 PathProgramCache]: Analyzing trace with hash -703606179, now seen corresponding path program 1 times [2019-09-08 12:24:40,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:40,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:40,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:40,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:40,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:40,824 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 12:24:40,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:40,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:24:40,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:24:40,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:24:40,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:24:40,826 INFO L87 Difference]: Start difference. First operand 16676 states and 23964 transitions. Second operand 8 states. [2019-09-08 12:24:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:43,364 INFO L93 Difference]: Finished difference Result 46654 states and 66963 transitions. [2019-09-08 12:24:43,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:24:43,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-08 12:24:43,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:43,403 INFO L225 Difference]: With dead ends: 46654 [2019-09-08 12:24:43,403 INFO L226 Difference]: Without dead ends: 38044 [2019-09-08 12:24:43,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:24:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38044 states. [2019-09-08 12:24:44,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38044 to 23004. [2019-09-08 12:24:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23004 states. [2019-09-08 12:24:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23004 states to 23004 states and 32956 transitions. [2019-09-08 12:24:44,910 INFO L78 Accepts]: Start accepts. Automaton has 23004 states and 32956 transitions. Word has length 150 [2019-09-08 12:24:44,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:44,910 INFO L475 AbstractCegarLoop]: Abstraction has 23004 states and 32956 transitions. [2019-09-08 12:24:44,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:24:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 23004 states and 32956 transitions. [2019-09-08 12:24:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:24:44,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:44,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:44,926 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1833502417, now seen corresponding path program 1 times [2019-09-08 12:24:44,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:44,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:44,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:44,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:44,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:45,773 WARN L188 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-09-08 12:24:45,924 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 12:24:45,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:45,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:24:45,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:24:45,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:24:45,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:24:45,927 INFO L87 Difference]: Start difference. First operand 23004 states and 32956 transitions. Second operand 8 states. [2019-09-08 12:24:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:47,828 INFO L93 Difference]: Finished difference Result 48980 states and 70296 transitions. [2019-09-08 12:24:47,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:24:47,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-08 12:24:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:47,859 INFO L225 Difference]: With dead ends: 48980 [2019-09-08 12:24:47,859 INFO L226 Difference]: Without dead ends: 26134 [2019-09-08 12:24:47,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:24:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26134 states. [2019-09-08 12:24:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26134 to 23004. [2019-09-08 12:24:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23004 states. [2019-09-08 12:24:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23004 states to 23004 states and 32728 transitions. [2019-09-08 12:24:49,506 INFO L78 Accepts]: Start accepts. Automaton has 23004 states and 32728 transitions. Word has length 150 [2019-09-08 12:24:49,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:49,506 INFO L475 AbstractCegarLoop]: Abstraction has 23004 states and 32728 transitions. [2019-09-08 12:24:49,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:24:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 23004 states and 32728 transitions. [2019-09-08 12:24:49,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:24:49,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:49,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:49,519 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:49,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:49,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1274348331, now seen corresponding path program 1 times [2019-09-08 12:24:49,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:49,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:49,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:49,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:49,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:49,641 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 12:24:49,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:49,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:24:49,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:24:49,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:24:49,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:24:49,643 INFO L87 Difference]: Start difference. First operand 23004 states and 32728 transitions. Second operand 5 states. [2019-09-08 12:24:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:24:52,250 INFO L93 Difference]: Finished difference Result 46298 states and 66051 transitions. [2019-09-08 12:24:52,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:24:52,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-09-08 12:24:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:24:52,287 INFO L225 Difference]: With dead ends: 46298 [2019-09-08 12:24:52,287 INFO L226 Difference]: Without dead ends: 37720 [2019-09-08 12:24:52,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:24:52,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37720 states. [2019-09-08 12:24:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37720 to 34804. [2019-09-08 12:24:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34804 states. [2019-09-08 12:24:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34804 states to 34804 states and 49664 transitions. [2019-09-08 12:24:54,722 INFO L78 Accepts]: Start accepts. Automaton has 34804 states and 49664 transitions. Word has length 151 [2019-09-08 12:24:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:24:54,722 INFO L475 AbstractCegarLoop]: Abstraction has 34804 states and 49664 transitions. [2019-09-08 12:24:54,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:24:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 34804 states and 49664 transitions. [2019-09-08 12:24:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:24:54,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:24:54,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:54,739 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:24:54,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:24:54,740 INFO L82 PathProgramCache]: Analyzing trace with hash 247030735, now seen corresponding path program 1 times [2019-09-08 12:24:54,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:24:54,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:24:54,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:54,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:24:54,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:24:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:24:54,938 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 12:24:54,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:24:54,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:24:54,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:24:54,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:24:54,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:24:54,940 INFO L87 Difference]: Start difference. First operand 34804 states and 49664 transitions. Second operand 8 states. [2019-09-08 12:25:00,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:00,203 INFO L93 Difference]: Finished difference Result 84606 states and 120815 transitions. [2019-09-08 12:25:00,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:25:00,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 151 [2019-09-08 12:25:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:00,277 INFO L225 Difference]: With dead ends: 84606 [2019-09-08 12:25:00,277 INFO L226 Difference]: Without dead ends: 67484 [2019-09-08 12:25:00,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:25:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67484 states. [2019-09-08 12:25:03,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67484 to 40708. [2019-09-08 12:25:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40708 states. [2019-09-08 12:25:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40708 states to 40708 states and 57952 transitions. [2019-09-08 12:25:03,243 INFO L78 Accepts]: Start accepts. Automaton has 40708 states and 57952 transitions. Word has length 151 [2019-09-08 12:25:03,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:03,243 INFO L475 AbstractCegarLoop]: Abstraction has 40708 states and 57952 transitions. [2019-09-08 12:25:03,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:25:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 40708 states and 57952 transitions. [2019-09-08 12:25:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:25:03,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:03,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:25:03,261 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:03,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:03,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1556684379, now seen corresponding path program 1 times [2019-09-08 12:25:03,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:03,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:03,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:03,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:03,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:03,455 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 12:25:03,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:03,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:25:03,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:25:03,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:25:03,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:25:03,457 INFO L87 Difference]: Start difference. First operand 40708 states and 57952 transitions. Second operand 8 states. [2019-09-08 12:25:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:08,717 INFO L93 Difference]: Finished difference Result 87814 states and 125267 transitions. [2019-09-08 12:25:08,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:25:08,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 151 [2019-09-08 12:25:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:08,787 INFO L225 Difference]: With dead ends: 87814 [2019-09-08 12:25:08,787 INFO L226 Difference]: Without dead ends: 70660 [2019-09-08 12:25:08,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:25:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70660 states. [2019-09-08 12:25:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70660 to 47036. [2019-09-08 12:25:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47036 states. [2019-09-08 12:25:13,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47036 states to 47036 states and 66880 transitions. [2019-09-08 12:25:13,535 INFO L78 Accepts]: Start accepts. Automaton has 47036 states and 66880 transitions. Word has length 151 [2019-09-08 12:25:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:13,535 INFO L475 AbstractCegarLoop]: Abstraction has 47036 states and 66880 transitions. [2019-09-08 12:25:13,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:25:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 47036 states and 66880 transitions. [2019-09-08 12:25:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:25:13,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:13,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:25:13,557 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:13,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:13,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1301984749, now seen corresponding path program 1 times [2019-09-08 12:25:13,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:13,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:13,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:13,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:13,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:13,698 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 12:25:13,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:13,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:25:13,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:25:13,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:25:13,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:25:13,700 INFO L87 Difference]: Start difference. First operand 47036 states and 66880 transitions. Second operand 5 states. [2019-09-08 12:25:17,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:25:17,993 INFO L93 Difference]: Finished difference Result 64898 states and 92687 transitions. [2019-09-08 12:25:17,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:25:17,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-09-08 12:25:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:25:18,050 INFO L225 Difference]: With dead ends: 64898 [2019-09-08 12:25:18,050 INFO L226 Difference]: Without dead ends: 56288 [2019-09-08 12:25:18,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:25:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56288 states. [2019-09-08 12:25:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56288 to 53436. [2019-09-08 12:25:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53436 states. [2019-09-08 12:25:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53436 states to 53436 states and 76076 transitions. [2019-09-08 12:25:22,216 INFO L78 Accepts]: Start accepts. Automaton has 53436 states and 76076 transitions. Word has length 151 [2019-09-08 12:25:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:25:22,216 INFO L475 AbstractCegarLoop]: Abstraction has 53436 states and 76076 transitions. [2019-09-08 12:25:22,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:25:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 53436 states and 76076 transitions. [2019-09-08 12:25:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 12:25:22,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:25:22,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:25:22,243 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:25:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:25:22,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1710125902, now seen corresponding path program 1 times [2019-09-08 12:25:22,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:25:22,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:25:22,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:22,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:25:22,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:25:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:25:22,506 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 12:25:22,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:25:22,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:25:22,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:25:22,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:25:22,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:25:22,508 INFO L87 Difference]: Start difference. First operand 53436 states and 76076 transitions. Second operand 10 states. [2019-09-08 12:26:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:26:05,205 INFO L93 Difference]: Finished difference Result 513284 states and 726083 transitions. [2019-09-08 12:26:05,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:26:05,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2019-09-08 12:26:05,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:26:05,870 INFO L225 Difference]: With dead ends: 513284 [2019-09-08 12:26:05,870 INFO L226 Difference]: Without dead ends: 459978 [2019-09-08 12:26:05,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:26:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459978 states. [2019-09-08 12:26:22,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459978 to 103256. [2019-09-08 12:26:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103256 states. [2019-09-08 12:26:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103256 states to 103256 states and 146036 transitions. [2019-09-08 12:26:22,987 INFO L78 Accepts]: Start accepts. Automaton has 103256 states and 146036 transitions. Word has length 153 [2019-09-08 12:26:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:26:22,987 INFO L475 AbstractCegarLoop]: Abstraction has 103256 states and 146036 transitions. [2019-09-08 12:26:22,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:26:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 103256 states and 146036 transitions. [2019-09-08 12:26:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 12:26:23,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:26:23,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:26:23,449 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:26:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:26:23,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1003999422, now seen corresponding path program 1 times [2019-09-08 12:26:23,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:26:23,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:26:23,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:23,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:26:23,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:26:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:26:23,680 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 12:26:23,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:26:23,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:26:23,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:26:23,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:26:23,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:26:23,682 INFO L87 Difference]: Start difference. First operand 103256 states and 146036 transitions. Second operand 10 states. [2019-09-08 12:27:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:27:43,035 INFO L93 Difference]: Finished difference Result 772701 states and 1087907 transitions. [2019-09-08 12:27:43,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:27:43,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2019-09-08 12:27:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:27:43,975 INFO L225 Difference]: With dead ends: 772701 [2019-09-08 12:27:43,975 INFO L226 Difference]: Without dead ends: 669975 [2019-09-08 12:27:44,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:27:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669975 states. [2019-09-08 12:27:59,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669975 to 101669. [2019-09-08 12:27:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101669 states. [2019-09-08 12:28:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101669 states to 101669 states and 143686 transitions. [2019-09-08 12:28:00,128 INFO L78 Accepts]: Start accepts. Automaton has 101669 states and 143686 transitions. Word has length 153 [2019-09-08 12:28:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:00,129 INFO L475 AbstractCegarLoop]: Abstraction has 101669 states and 143686 transitions. [2019-09-08 12:28:00,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:28:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 101669 states and 143686 transitions. [2019-09-08 12:28:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 12:28:00,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:00,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:28:00,163 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:00,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:00,164 INFO L82 PathProgramCache]: Analyzing trace with hash 80125496, now seen corresponding path program 1 times [2019-09-08 12:28:00,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:00,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:00,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:00,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:00,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:00,425 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 12:28:00,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:00,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:28:00,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:28:00,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:28:00,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:28:00,427 INFO L87 Difference]: Start difference. First operand 101669 states and 143686 transitions. Second operand 10 states. [2019-09-08 12:29:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:50,199 INFO L93 Difference]: Finished difference Result 900395 states and 1268397 transitions. [2019-09-08 12:29:50,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:29:50,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2019-09-08 12:29:50,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:51,333 INFO L225 Difference]: With dead ends: 900395 [2019-09-08 12:29:51,333 INFO L226 Difference]: Without dead ends: 802137 [2019-09-08 12:29:51,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:29:52,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802137 states. [2019-09-08 12:30:16,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802137 to 101877. [2019-09-08 12:30:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101877 states. [2019-09-08 12:30:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101877 states to 101877 states and 143929 transitions. [2019-09-08 12:30:16,936 INFO L78 Accepts]: Start accepts. Automaton has 101877 states and 143929 transitions. Word has length 153 [2019-09-08 12:30:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:16,936 INFO L475 AbstractCegarLoop]: Abstraction has 101877 states and 143929 transitions. [2019-09-08 12:30:16,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:30:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 101877 states and 143929 transitions. [2019-09-08 12:30:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 12:30:16,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:16,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:30:16,967 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:16,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:16,968 INFO L82 PathProgramCache]: Analyzing trace with hash 896430731, now seen corresponding path program 1 times [2019-09-08 12:30:16,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:16,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:16,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:16,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:16,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:17,050 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 12:30:17,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:17,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:30:17,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:30:17,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:30:17,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:30:17,052 INFO L87 Difference]: Start difference. First operand 101877 states and 143929 transitions. Second operand 3 states. [2019-09-08 12:30:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:25,155 INFO L93 Difference]: Finished difference Result 150297 states and 212299 transitions. [2019-09-08 12:30:25,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:30:25,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-08 12:30:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:25,210 INFO L225 Difference]: With dead ends: 150297 [2019-09-08 12:30:25,210 INFO L226 Difference]: Without dead ends: 52015 [2019-09-08 12:30:25,275 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 12:30:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52015 states. [2019-09-08 12:30:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52015 to 52013. [2019-09-08 12:30:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52013 states. [2019-09-08 12:30:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52013 states to 52013 states and 72903 transitions. [2019-09-08 12:30:33,417 INFO L78 Accepts]: Start accepts. Automaton has 52013 states and 72903 transitions. Word has length 153 [2019-09-08 12:30:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:33,417 INFO L475 AbstractCegarLoop]: Abstraction has 52013 states and 72903 transitions. [2019-09-08 12:30:33,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:30:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 52013 states and 72903 transitions. [2019-09-08 12:30:33,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 12:30:33,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:33,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:30:33,434 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:33,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:33,435 INFO L82 PathProgramCache]: Analyzing trace with hash 118660324, now seen corresponding path program 1 times [2019-09-08 12:30:33,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:33,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:33,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:33,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:33,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:33,647 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 12:30:33,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:33,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:30:33,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:30:33,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:30:33,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:30:33,649 INFO L87 Difference]: Start difference. First operand 52013 states and 72903 transitions. Second operand 10 states. [2019-09-08 12:31:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:21,601 INFO L93 Difference]: Finished difference Result 360197 states and 503995 transitions. [2019-09-08 12:31:21,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:31:21,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-08 12:31:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:21,949 INFO L225 Difference]: With dead ends: 360197 [2019-09-08 12:31:21,949 INFO L226 Difference]: Without dead ends: 309493 [2019-09-08 12:31:22,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:31:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309493 states. [2019-09-08 12:31:31,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309493 to 52601. [2019-09-08 12:31:31,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52601 states. [2019-09-08 12:31:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52601 states to 52601 states and 73599 transitions. [2019-09-08 12:31:31,819 INFO L78 Accepts]: Start accepts. Automaton has 52601 states and 73599 transitions. Word has length 154 [2019-09-08 12:31:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:31,820 INFO L475 AbstractCegarLoop]: Abstraction has 52601 states and 73599 transitions. [2019-09-08 12:31:31,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:31:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 52601 states and 73599 transitions. [2019-09-08 12:31:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:31:31,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:31,838 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:31:31,839 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:31,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:31,839 INFO L82 PathProgramCache]: Analyzing trace with hash -902049072, now seen corresponding path program 1 times [2019-09-08 12:31:31,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:31,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:31,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:31,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:31,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:31,892 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 12:31:31,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:31,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:31:31,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:31:31,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:31:31,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:31:31,894 INFO L87 Difference]: Start difference. First operand 52601 states and 73599 transitions. Second operand 3 states. [2019-09-08 12:31:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:40,159 INFO L93 Difference]: Finished difference Result 103393 states and 145148 transitions. [2019-09-08 12:31:40,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:31:40,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 12:31:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:40,206 INFO L225 Difference]: With dead ends: 103393 [2019-09-08 12:31:40,206 INFO L226 Difference]: Without dead ends: 51465 [2019-09-08 12:31:40,236 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 12:31:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51465 states. [2019-09-08 12:31:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51465 to 51465. [2019-09-08 12:31:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51465 states. [2019-09-08 12:31:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51465 states to 51465 states and 71789 transitions. [2019-09-08 12:31:50,331 INFO L78 Accepts]: Start accepts. Automaton has 51465 states and 71789 transitions. Word has length 155 [2019-09-08 12:31:50,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:50,331 INFO L475 AbstractCegarLoop]: Abstraction has 51465 states and 71789 transitions. [2019-09-08 12:31:50,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:31:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 51465 states and 71789 transitions. [2019-09-08 12:31:50,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:31:50,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:50,348 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:31:50,348 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:50,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:50,348 INFO L82 PathProgramCache]: Analyzing trace with hash 715005044, now seen corresponding path program 1 times [2019-09-08 12:31:50,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:50,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:50,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:50,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:50,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:50,576 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 12:31:50,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:50,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:31:50,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:31:50,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:31:50,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:31:50,578 INFO L87 Difference]: Start difference. First operand 51465 states and 71789 transitions. Second operand 10 states. [2019-09-08 12:33:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:10,645 INFO L93 Difference]: Finished difference Result 489706 states and 677432 transitions. [2019-09-08 12:33:10,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 12:33:10,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-08 12:33:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:11,255 INFO L225 Difference]: With dead ends: 489706 [2019-09-08 12:33:11,255 INFO L226 Difference]: Without dead ends: 439463 [2019-09-08 12:33:11,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:33:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439463 states. [2019-09-08 12:33:22,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439463 to 51251. [2019-09-08 12:33:22,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51251 states. [2019-09-08 12:33:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51251 states to 51251 states and 71459 transitions. [2019-09-08 12:33:22,886 INFO L78 Accepts]: Start accepts. Automaton has 51251 states and 71459 transitions. Word has length 155 [2019-09-08 12:33:22,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:22,887 INFO L475 AbstractCegarLoop]: Abstraction has 51251 states and 71459 transitions. [2019-09-08 12:33:22,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:33:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 51251 states and 71459 transitions. [2019-09-08 12:33:22,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 12:33:22,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:22,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:33:22,903 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:22,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:22,904 INFO L82 PathProgramCache]: Analyzing trace with hash -859379835, now seen corresponding path program 1 times [2019-09-08 12:33:22,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:22,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:22,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:22,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:22,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:22,990 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 12:33:22,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:22,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:33:22,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:33:22,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:33:22,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:33:22,991 INFO L87 Difference]: Start difference. First operand 51251 states and 71459 transitions. Second operand 3 states. [2019-09-08 12:33:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:28,098 INFO L93 Difference]: Finished difference Result 75191 states and 104829 transitions. [2019-09-08 12:33:28,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:33:28,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-09-08 12:33:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:28,123 INFO L225 Difference]: With dead ends: 75191 [2019-09-08 12:33:28,123 INFO L226 Difference]: Without dead ends: 26165 [2019-09-08 12:33:28,145 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 12:33:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26165 states. [2019-09-08 12:33:32,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26165 to 26163. [2019-09-08 12:33:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26163 states. [2019-09-08 12:33:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26163 states to 26163 states and 36117 transitions. [2019-09-08 12:33:32,792 INFO L78 Accepts]: Start accepts. Automaton has 26163 states and 36117 transitions. Word has length 155 [2019-09-08 12:33:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:32,793 INFO L475 AbstractCegarLoop]: Abstraction has 26163 states and 36117 transitions. [2019-09-08 12:33:32,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:33:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 26163 states and 36117 transitions. [2019-09-08 12:33:32,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 12:33:32,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:32,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:33:32,803 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:32,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:32,803 INFO L82 PathProgramCache]: Analyzing trace with hash -798133749, now seen corresponding path program 1 times [2019-09-08 12:33:32,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:32,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:32,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:32,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:32,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:33,095 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 12:33:33,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:33,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:33:33,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:33:33,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:33:33,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:33:33,096 INFO L87 Difference]: Start difference. First operand 26163 states and 36117 transitions. Second operand 10 states. [2019-09-08 12:34:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:12,378 INFO L93 Difference]: Finished difference Result 225017 states and 310389 transitions. [2019-09-08 12:34:12,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:34:12,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2019-09-08 12:34:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:12,610 INFO L225 Difference]: With dead ends: 225017 [2019-09-08 12:34:12,610 INFO L226 Difference]: Without dead ends: 200747 [2019-09-08 12:34:12,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:34:12,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200747 states. [2019-09-08 12:34:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200747 to 27043. [2019-09-08 12:34:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27043 states. [2019-09-08 12:34:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27043 states to 27043 states and 37219 transitions. [2019-09-08 12:34:19,325 INFO L78 Accepts]: Start accepts. Automaton has 27043 states and 37219 transitions. Word has length 156 [2019-09-08 12:34:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:19,325 INFO L475 AbstractCegarLoop]: Abstraction has 27043 states and 37219 transitions. [2019-09-08 12:34:19,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:34:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 27043 states and 37219 transitions. [2019-09-08 12:34:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 12:34:19,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:19,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:34:19,334 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:19,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:19,334 INFO L82 PathProgramCache]: Analyzing trace with hash 762384136, now seen corresponding path program 1 times [2019-09-08 12:34:19,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:19,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:19,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:19,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:19,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:19,420 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 12:34:19,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:19,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:34:19,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:34:19,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:34:19,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:34:19,422 INFO L87 Difference]: Start difference. First operand 27043 states and 37219 transitions. Second operand 3 states. [2019-09-08 12:34:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:23,832 INFO L93 Difference]: Finished difference Result 39015 states and 53769 transitions. [2019-09-08 12:34:23,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:34:23,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-09-08 12:34:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:23,848 INFO L225 Difference]: With dead ends: 39015 [2019-09-08 12:34:23,848 INFO L226 Difference]: Without dead ends: 14661 [2019-09-08 12:34:23,866 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 12:34:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14661 states. [2019-09-08 12:34:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14661 to 14659. [2019-09-08 12:34:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14659 states. [2019-09-08 12:34:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14659 states to 14659 states and 19893 transitions. [2019-09-08 12:34:26,636 INFO L78 Accepts]: Start accepts. Automaton has 14659 states and 19893 transitions. Word has length 156 [2019-09-08 12:34:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:26,636 INFO L475 AbstractCegarLoop]: Abstraction has 14659 states and 19893 transitions. [2019-09-08 12:34:26,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:34:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 14659 states and 19893 transitions. [2019-09-08 12:34:26,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 12:34:26,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:26,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:34:26,643 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:26,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:26,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1128759459, now seen corresponding path program 1 times [2019-09-08 12:34:26,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:26,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:26,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:26,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:26,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:26,698 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 12:34:26,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:26,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:34:26,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:34:26,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:34:26,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:34:26,700 INFO L87 Difference]: Start difference. First operand 14659 states and 19893 transitions. Second operand 3 states. [2019-09-08 12:34:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:29,436 INFO L93 Difference]: Finished difference Result 27265 states and 37302 transitions. [2019-09-08 12:34:29,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:34:29,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-09-08 12:34:29,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:29,449 INFO L225 Difference]: With dead ends: 27265 [2019-09-08 12:34:29,450 INFO L226 Difference]: Without dead ends: 13635 [2019-09-08 12:34:29,459 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 12:34:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13635 states. [2019-09-08 12:34:32,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13635 to 13635. [2019-09-08 12:34:32,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13635 states. [2019-09-08 12:34:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13635 states to 13635 states and 18503 transitions. [2019-09-08 12:34:32,066 INFO L78 Accepts]: Start accepts. Automaton has 13635 states and 18503 transitions. Word has length 157 [2019-09-08 12:34:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:32,066 INFO L475 AbstractCegarLoop]: Abstraction has 13635 states and 18503 transitions. [2019-09-08 12:34:32,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:34:32,066 INFO L276 IsEmpty]: Start isEmpty. Operand 13635 states and 18503 transitions. [2019-09-08 12:34:32,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 12:34:32,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:32,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:34:32,072 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:32,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:32,072 INFO L82 PathProgramCache]: Analyzing trace with hash 852948978, now seen corresponding path program 1 times [2019-09-08 12:34:32,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:32,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:32,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:32,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:32,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:32,184 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 12:34:32,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:32,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:34:32,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:34:32,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:34:32,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:34:32,191 INFO L87 Difference]: Start difference. First operand 13635 states and 18503 transitions. Second operand 4 states. [2019-09-08 12:34:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:34,913 INFO L93 Difference]: Finished difference Result 25677 states and 34852 transitions. [2019-09-08 12:34:34,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:34:34,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-08 12:34:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:34,925 INFO L225 Difference]: With dead ends: 25677 [2019-09-08 12:34:34,926 INFO L226 Difference]: Without dead ends: 13603 [2019-09-08 12:34:34,933 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 12:34:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13603 states. [2019-09-08 12:34:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13603 to 13595. [2019-09-08 12:34:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13595 states. [2019-09-08 12:34:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13595 states to 13595 states and 18291 transitions. [2019-09-08 12:34:37,534 INFO L78 Accepts]: Start accepts. Automaton has 13595 states and 18291 transitions. Word has length 157 [2019-09-08 12:34:37,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:37,534 INFO L475 AbstractCegarLoop]: Abstraction has 13595 states and 18291 transitions. [2019-09-08 12:34:37,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:34:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 13595 states and 18291 transitions. [2019-09-08 12:34:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 12:34:37,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:34:37,541 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:37,541 INFO L82 PathProgramCache]: Analyzing trace with hash 589870381, now seen corresponding path program 1 times [2019-09-08 12:34:37,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:37,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:37,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:37,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:37,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:37,605 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 12:34:37,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:37,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:34:37,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:34:37,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:34:37,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:34:37,607 INFO L87 Difference]: Start difference. First operand 13595 states and 18291 transitions. Second operand 3 states. [2019-09-08 12:34:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:41,690 INFO L93 Difference]: Finished difference Result 31711 states and 41885 transitions. [2019-09-08 12:34:41,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:34:41,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-08 12:34:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:41,711 INFO L225 Difference]: With dead ends: 31711 [2019-09-08 12:34:41,712 INFO L226 Difference]: Without dead ends: 19749 [2019-09-08 12:34:41,722 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 12:34:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19749 states. [2019-09-08 12:34:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19749 to 19067. [2019-09-08 12:34:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19067 states. [2019-09-08 12:34:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19067 states to 19067 states and 24331 transitions. [2019-09-08 12:34:45,642 INFO L78 Accepts]: Start accepts. Automaton has 19067 states and 24331 transitions. Word has length 159 [2019-09-08 12:34:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:45,642 INFO L475 AbstractCegarLoop]: Abstraction has 19067 states and 24331 transitions. [2019-09-08 12:34:45,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:34:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 19067 states and 24331 transitions. [2019-09-08 12:34:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 12:34:45,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:45,649 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:34:45,649 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:45,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1152054145, now seen corresponding path program 1 times [2019-09-08 12:34:45,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:45,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:45,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:45,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:45,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:45,734 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 12:34:45,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:45,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:34:45,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:34:45,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:34:45,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:34:45,735 INFO L87 Difference]: Start difference. First operand 19067 states and 24331 transitions. Second operand 3 states. [2019-09-08 12:34:50,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:50,244 INFO L93 Difference]: Finished difference Result 29383 states and 37845 transitions. [2019-09-08 12:34:50,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:34:50,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 12:34:50,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:50,263 INFO L225 Difference]: With dead ends: 29383 [2019-09-08 12:34:50,264 INFO L226 Difference]: Without dead ends: 21269 [2019-09-08 12:34:50,272 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 12:34:50,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21269 states. [2019-09-08 12:34:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21269 to 19251. [2019-09-08 12:34:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19251 states. [2019-09-08 12:34:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19251 states to 19251 states and 24555 transitions. [2019-09-08 12:34:54,425 INFO L78 Accepts]: Start accepts. Automaton has 19251 states and 24555 transitions. Word has length 160 [2019-09-08 12:34:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:54,425 INFO L475 AbstractCegarLoop]: Abstraction has 19251 states and 24555 transitions. [2019-09-08 12:34:54,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:34:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 19251 states and 24555 transitions. [2019-09-08 12:34:54,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:34:54,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:54,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:34:54,431 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:54,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:54,432 INFO L82 PathProgramCache]: Analyzing trace with hash 464817316, now seen corresponding path program 1 times [2019-09-08 12:34:54,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:54,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:54,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:54,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:54,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:54,507 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 12:34:54,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:54,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:34:54,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:34:54,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:34:54,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:34:54,508 INFO L87 Difference]: Start difference. First operand 19251 states and 24555 transitions. Second operand 3 states. [2019-09-08 12:34:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:58,718 INFO L93 Difference]: Finished difference Result 25967 states and 33241 transitions. [2019-09-08 12:34:58,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:34:58,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 12:34:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:58,734 INFO L225 Difference]: With dead ends: 25967 [2019-09-08 12:34:58,734 INFO L226 Difference]: Without dead ends: 19217 [2019-09-08 12:34:58,740 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 12:34:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19217 states. [2019-09-08 12:35:02,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19217 to 15403. [2019-09-08 12:35:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15403 states. [2019-09-08 12:35:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15403 states to 15403 states and 19549 transitions. [2019-09-08 12:35:02,468 INFO L78 Accepts]: Start accepts. Automaton has 15403 states and 19549 transitions. Word has length 161 [2019-09-08 12:35:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:02,468 INFO L475 AbstractCegarLoop]: Abstraction has 15403 states and 19549 transitions. [2019-09-08 12:35:02,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:35:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 15403 states and 19549 transitions. [2019-09-08 12:35:02,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:35:02,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:02,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:35:02,472 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:02,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:02,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1676333787, now seen corresponding path program 1 times [2019-09-08 12:35:02,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:02,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:02,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:02,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:02,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:02,527 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 12:35:02,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:02,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:35:02,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:35:02,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:35:02,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:35:02,529 INFO L87 Difference]: Start difference. First operand 15403 states and 19549 transitions. Second operand 4 states. [2019-09-08 12:35:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:10,161 INFO L93 Difference]: Finished difference Result 43919 states and 55950 transitions. [2019-09-08 12:35:10,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:35:10,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 12:35:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:10,190 INFO L225 Difference]: With dead ends: 43919 [2019-09-08 12:35:10,190 INFO L226 Difference]: Without dead ends: 30085 [2019-09-08 12:35:10,204 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 12:35:10,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30085 states. [2019-09-08 12:35:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30085 to 14919. [2019-09-08 12:35:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14919 states. [2019-09-08 12:35:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14919 states to 14919 states and 18968 transitions. [2019-09-08 12:35:14,288 INFO L78 Accepts]: Start accepts. Automaton has 14919 states and 18968 transitions. Word has length 161 [2019-09-08 12:35:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:14,288 INFO L475 AbstractCegarLoop]: Abstraction has 14919 states and 18968 transitions. [2019-09-08 12:35:14,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:35:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 14919 states and 18968 transitions. [2019-09-08 12:35:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:35:14,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:14,291 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:35:14,291 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:14,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1308062560, now seen corresponding path program 1 times [2019-09-08 12:35:14,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:14,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:14,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:14,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:14,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:14,351 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 12:35:14,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:14,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:35:14,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:35:14,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:35:14,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:35:14,352 INFO L87 Difference]: Start difference. First operand 14919 states and 18968 transitions. Second operand 3 states. [2019-09-08 12:35:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:18,347 INFO L93 Difference]: Finished difference Result 29283 states and 37302 transitions. [2019-09-08 12:35:18,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:35:18,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 12:35:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:18,362 INFO L225 Difference]: With dead ends: 29283 [2019-09-08 12:35:18,362 INFO L226 Difference]: Without dead ends: 15449 [2019-09-08 12:35:18,373 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 12:35:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15449 states. [2019-09-08 12:35:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15449 to 14927. [2019-09-08 12:35:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14927 states. [2019-09-08 12:35:22,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14927 states to 14927 states and 18784 transitions. [2019-09-08 12:35:22,241 INFO L78 Accepts]: Start accepts. Automaton has 14927 states and 18784 transitions. Word has length 161 [2019-09-08 12:35:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:22,241 INFO L475 AbstractCegarLoop]: Abstraction has 14927 states and 18784 transitions. [2019-09-08 12:35:22,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:35:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 14927 states and 18784 transitions. [2019-09-08 12:35:22,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 12:35:22,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:22,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:35:22,244 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:22,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:22,245 INFO L82 PathProgramCache]: Analyzing trace with hash -698062044, now seen corresponding path program 1 times [2019-09-08 12:35:22,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:22,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:22,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:22,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:22,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:22,349 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 12:35:22,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:22,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:35:22,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:35:22,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:35:22,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:35:22,350 INFO L87 Difference]: Start difference. First operand 14927 states and 18784 transitions. Second operand 6 states. [2019-09-08 12:35:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:28,488 INFO L93 Difference]: Finished difference Result 23460 states and 30089 transitions. [2019-09-08 12:35:28,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 12:35:28,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-08 12:35:28,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:28,510 INFO L225 Difference]: With dead ends: 23460 [2019-09-08 12:35:28,511 INFO L226 Difference]: Without dead ends: 23458 [2019-09-08 12:35:28,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:35:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23458 states. [2019-09-08 12:35:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23458 to 15247. [2019-09-08 12:35:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15247 states. [2019-09-08 12:35:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15247 states to 15247 states and 19056 transitions. [2019-09-08 12:35:32,550 INFO L78 Accepts]: Start accepts. Automaton has 15247 states and 19056 transitions. Word has length 161 [2019-09-08 12:35:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:32,550 INFO L475 AbstractCegarLoop]: Abstraction has 15247 states and 19056 transitions. [2019-09-08 12:35:32,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:35:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 15247 states and 19056 transitions. [2019-09-08 12:35:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 12:35:32,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:32,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:35:32,555 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:32,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash -904366186, now seen corresponding path program 1 times [2019-09-08 12:35:32,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:32,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:32,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:32,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:32,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:32,627 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 12:35:32,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:32,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:35:32,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:35:32,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:35:32,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:35:32,629 INFO L87 Difference]: Start difference. First operand 15247 states and 19056 transitions. Second operand 3 states. [2019-09-08 12:35:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:38,446 INFO L93 Difference]: Finished difference Result 35315 states and 44406 transitions. [2019-09-08 12:35:38,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:35:38,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-09-08 12:35:38,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:38,467 INFO L225 Difference]: With dead ends: 35315 [2019-09-08 12:35:38,467 INFO L226 Difference]: Without dead ends: 22193 [2019-09-08 12:35:38,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 12:35:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22193 states. [2019-09-08 12:35:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22193 to 22191. [2019-09-08 12:35:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22191 states. [2019-09-08 12:35:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22191 states to 22191 states and 27680 transitions. [2019-09-08 12:35:44,355 INFO L78 Accepts]: Start accepts. Automaton has 22191 states and 27680 transitions. Word has length 162 [2019-09-08 12:35:44,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:44,356 INFO L475 AbstractCegarLoop]: Abstraction has 22191 states and 27680 transitions. [2019-09-08 12:35:44,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:35:44,356 INFO L276 IsEmpty]: Start isEmpty. Operand 22191 states and 27680 transitions. [2019-09-08 12:35:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 12:35:44,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:44,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:35:44,364 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash -283014086, now seen corresponding path program 1 times [2019-09-08 12:35:44,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:44,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:44,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:44,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 12:35:44,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:44,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:35:44,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:35:44,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:35:44,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:35:44,581 INFO L87 Difference]: Start difference. First operand 22191 states and 27680 transitions. Second operand 5 states. [2019-09-08 12:35:54,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:54,380 INFO L93 Difference]: Finished difference Result 43819 states and 55030 transitions. [2019-09-08 12:35:54,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:35:54,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-09-08 12:35:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:54,410 INFO L225 Difference]: With dead ends: 43819 [2019-09-08 12:35:54,410 INFO L226 Difference]: Without dead ends: 32953 [2019-09-08 12:35:54,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:35:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32953 states. [2019-09-08 12:36:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32953 to 32947. [2019-09-08 12:36:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32947 states. [2019-09-08 12:36:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32947 states to 32947 states and 41346 transitions. [2019-09-08 12:36:04,189 INFO L78 Accepts]: Start accepts. Automaton has 32947 states and 41346 transitions. Word has length 193 [2019-09-08 12:36:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:04,189 INFO L475 AbstractCegarLoop]: Abstraction has 32947 states and 41346 transitions. [2019-09-08 12:36:04,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:36:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 32947 states and 41346 transitions. [2019-09-08 12:36:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 12:36:04,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:04,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:36:04,200 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:04,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:04,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1282710734, now seen corresponding path program 1 times [2019-09-08 12:36:04,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:04,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:04,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:04,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:04,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:04,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:36:04,573 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 12:36:04,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:04,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 12:36:04,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:36:04,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:36:04,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:36:05,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:36:05,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:36:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:36:05,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:36:05,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2019-09-08 12:36:05,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 12:36:05,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 12:36:05,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:36:05,610 INFO L87 Difference]: Start difference. First operand 32947 states and 41346 transitions. Second operand 23 states. [2019-09-08 12:36:05,753 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 12:36:08,051 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-09-08 12:36:09,096 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-08 12:36:10,857 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-08 12:36:11,090 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:36:11,244 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-08 12:36:11,529 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-08 12:36:12,675 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-08 12:36:12,838 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 12:36:13,304 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-08 12:36:13,458 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-08 12:36:13,588 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 12:36:13,741 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 12:36:13,891 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:36:14,324 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:36:14,647 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 12:36:16,664 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-08 12:36:17,053 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-08 12:36:17,225 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-08 12:36:17,395 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-08 12:36:17,575 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 12:36:20,182 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-08 12:36:20,844 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:36:21,026 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-08 12:36:21,365 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:36:22,023 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-08 12:36:22,925 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-08 12:36:23,140 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-08 12:36:23,638 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:36:23,818 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-08 12:36:24,005 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-08 12:36:26,004 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-08 12:36:26,226 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-08 12:36:27,358 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-08 12:36:27,611 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-08 12:36:28,866 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-08 12:36:29,100 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-09-08 12:36:29,400 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-08 12:36:30,562 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-08 12:36:30,707 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:36:30,925 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-09-08 12:36:31,090 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-09-08 12:36:31,406 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-08 12:36:31,547 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-08 12:36:32,650 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 12:36:32,912 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2019-09-08 12:36:33,101 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-08 12:36:33,314 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:36:33,470 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-08 12:36:33,661 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-08 12:36:34,993 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 12:36:35,303 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-08 12:36:35,508 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55