java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:00:28,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:00:28,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:00:28,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:00:28,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:00:28,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:00:28,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:00:28,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:00:28,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:00:28,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:00:28,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:00:28,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:00:28,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:00:28,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:00:28,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:00:28,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:00:28,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:00:28,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:00:28,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:00:28,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:00:28,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:00:28,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:00:28,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:00:28,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:00:28,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:00:28,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:00:28,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:00:28,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:00:28,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:00:28,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:00:28,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:00:28,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:00:28,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:00:28,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:00:28,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:00:28,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:00:28,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:00:28,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:00:28,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:00:28,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:00:28,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:00:28,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 11:00:28,814 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:00:28,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:00:28,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:00:28,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:00:28,816 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:00:28,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:00:28,817 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:00:28,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:00:28,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:00:28,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:00:28,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:00:28,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:00:28,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:00:28,818 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:00:28,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:00:28,819 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:00:28,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:00:28,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:00:28,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:00:28,820 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:00:28,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:00:28,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:00:28,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:00:28,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:00:28,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:00:28,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:00:28,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:00:28,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:00:28,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:00:28,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:00:28,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:00:28,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:00:28,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:00:28,870 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:00:28,871 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 11:00:28,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2485f27a/7a1258ab146d4288907906414c346c92/FLAG4e2fa206f [2019-09-08 11:00:29,988 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:00:29,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 11:00:30,051 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2485f27a/7a1258ab146d4288907906414c346c92/FLAG4e2fa206f [2019-09-08 11:00:30,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2485f27a/7a1258ab146d4288907906414c346c92 [2019-09-08 11:00:30,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:00:30,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:00:30,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:00:30,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:00:30,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:00:30,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:00:30" (1/1) ... [2019-09-08 11:00:30,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55725c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:00:30, skipping insertion in model container [2019-09-08 11:00:30,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:00:30" (1/1) ... [2019-09-08 11:00:30,304 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:00:30,628 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:00:32,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:00:33,025 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:00:34,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:00:34,351 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:00:34,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:00:34 WrapperNode [2019-09-08 11:00:34,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:00:34,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:00:34,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:00:34,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:00:34,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:00:34" (1/1) ... [2019-09-08 11:00:34,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:00:34" (1/1) ... [2019-09-08 11:00:34,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:00:34" (1/1) ... [2019-09-08 11:00:34,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:00:34" (1/1) ... [2019-09-08 11:00:34,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:00:34" (1/1) ... [2019-09-08 11:00:34,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:00:34" (1/1) ... [2019-09-08 11:00:34,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:00:34" (1/1) ... [2019-09-08 11:00:34,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:00:34,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:00:34,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:00:34,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:00:34,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:00:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:00:35,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:00:35,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:00:35,024 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:00:35,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:00:35,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:00:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:00:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:00:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:00:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:00:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:00:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:00:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:00:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:00:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:00:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:00:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:00:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:00:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:00:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:00:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:00:44,970 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:00:44,970 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:00:44,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:00:44 BoogieIcfgContainer [2019-09-08 11:00:44,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:00:44,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:00:44,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:00:44,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:00:44,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:00:30" (1/3) ... [2019-09-08 11:00:44,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18906fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:00:44, skipping insertion in model container [2019-09-08 11:00:44,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:00:34" (2/3) ... [2019-09-08 11:00:44,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18906fae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:00:44, skipping insertion in model container [2019-09-08 11:00:44,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:00:44" (3/3) ... [2019-09-08 11:00:44,983 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 11:00:44,993 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:00:45,004 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:00:45,023 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:00:45,068 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:00:45,069 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:00:45,069 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:00:45,069 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:00:45,069 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:00:45,069 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:00:45,069 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:00:45,069 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:00:45,070 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:00:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states. [2019-09-08 11:00:45,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:00:45,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:45,184 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:00:45,186 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:45,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:45,193 INFO L82 PathProgramCache]: Analyzing trace with hash -603174102, now seen corresponding path program 1 times [2019-09-08 11:00:45,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:45,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:45,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:45,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:45,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:46,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:46,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:00:46,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:00:46,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:00:46,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:00:46,218 INFO L87 Difference]: Start difference. First operand 2880 states. Second operand 3 states. [2019-09-08 11:00:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:46,617 INFO L93 Difference]: Finished difference Result 3408 states and 6363 transitions. [2019-09-08 11:00:46,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:00:46,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 11:00:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:46,653 INFO L225 Difference]: With dead ends: 3408 [2019-09-08 11:00:46,653 INFO L226 Difference]: Without dead ends: 3128 [2019-09-08 11:00:46,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:00:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2019-09-08 11:00:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 3126. [2019-09-08 11:00:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2019-09-08 11:00:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 4014 transitions. [2019-09-08 11:00:46,865 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 4014 transitions. Word has length 83 [2019-09-08 11:00:46,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:46,867 INFO L475 AbstractCegarLoop]: Abstraction has 3126 states and 4014 transitions. [2019-09-08 11:00:46,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:00:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4014 transitions. [2019-09-08 11:00:46,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:00:46,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:46,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:00:46,881 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:46,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:46,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1620390027, now seen corresponding path program 1 times [2019-09-08 11:00:46,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:46,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:46,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:46,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:47,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:47,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:00:47,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:00:47,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:00:47,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:00:47,269 INFO L87 Difference]: Start difference. First operand 3126 states and 4014 transitions. Second operand 3 states. [2019-09-08 11:00:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:47,973 INFO L93 Difference]: Finished difference Result 3954 states and 5232 transitions. [2019-09-08 11:00:47,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:00:47,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-08 11:00:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:47,993 INFO L225 Difference]: With dead ends: 3954 [2019-09-08 11:00:47,993 INFO L226 Difference]: Without dead ends: 3620 [2019-09-08 11:00:47,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:00:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3620 states. [2019-09-08 11:00:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3620 to 3618. [2019-09-08 11:00:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2019-09-08 11:00:48,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4716 transitions. [2019-09-08 11:00:48,115 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4716 transitions. Word has length 83 [2019-09-08 11:00:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:48,118 INFO L475 AbstractCegarLoop]: Abstraction has 3618 states and 4716 transitions. [2019-09-08 11:00:48,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:00:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4716 transitions. [2019-09-08 11:00:48,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:00:48,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:48,132 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:00:48,132 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:48,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1718910594, now seen corresponding path program 1 times [2019-09-08 11:00:48,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:48,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:48,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:48,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:48,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:48,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:48,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:00:48,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:00:48,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:00:48,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:00:48,534 INFO L87 Difference]: Start difference. First operand 3618 states and 4716 transitions. Second operand 5 states. [2019-09-08 11:00:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:50,833 INFO L93 Difference]: Finished difference Result 6268 states and 8415 transitions. [2019-09-08 11:00:50,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:00:50,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-08 11:00:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:50,854 INFO L225 Difference]: With dead ends: 6268 [2019-09-08 11:00:50,854 INFO L226 Difference]: Without dead ends: 3526 [2019-09-08 11:00:50,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:00:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3526 states. [2019-09-08 11:00:51,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3526 to 3524. [2019-09-08 11:00:51,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2019-09-08 11:00:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4764 transitions. [2019-09-08 11:00:51,103 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4764 transitions. Word has length 83 [2019-09-08 11:00:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:51,104 INFO L475 AbstractCegarLoop]: Abstraction has 3524 states and 4764 transitions. [2019-09-08 11:00:51,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:00:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4764 transitions. [2019-09-08 11:00:51,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:00:51,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:51,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:00:51,113 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:51,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:51,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1561724747, now seen corresponding path program 1 times [2019-09-08 11:00:51,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:51,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:51,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:51,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:51,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:51,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:51,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:00:51,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:00:51,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:00:51,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:00:51,615 INFO L87 Difference]: Start difference. First operand 3524 states and 4764 transitions. Second operand 6 states. [2019-09-08 11:00:53,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:53,661 INFO L93 Difference]: Finished difference Result 8349 states and 11701 transitions. [2019-09-08 11:00:53,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:00:53,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-08 11:00:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:53,693 INFO L225 Difference]: With dead ends: 8349 [2019-09-08 11:00:53,693 INFO L226 Difference]: Without dead ends: 5436 [2019-09-08 11:00:53,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:00:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5436 states. [2019-09-08 11:00:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5436 to 5432. [2019-09-08 11:00:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5432 states. [2019-09-08 11:00:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5432 states to 5432 states and 7664 transitions. [2019-09-08 11:00:53,967 INFO L78 Accepts]: Start accepts. Automaton has 5432 states and 7664 transitions. Word has length 84 [2019-09-08 11:00:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:53,967 INFO L475 AbstractCegarLoop]: Abstraction has 5432 states and 7664 transitions. [2019-09-08 11:00:53,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:00:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5432 states and 7664 transitions. [2019-09-08 11:00:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:00:53,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:53,985 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] [2019-09-08 11:00:53,985 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:53,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:53,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2054514782, now seen corresponding path program 1 times [2019-09-08 11:00:53,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:53,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:53,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:53,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:53,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:54,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:54,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:00:54,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:00:54,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:00:54,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:00:54,393 INFO L87 Difference]: Start difference. First operand 5432 states and 7664 transitions. Second operand 5 states. [2019-09-08 11:00:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:56,122 INFO L93 Difference]: Finished difference Result 11159 states and 15902 transitions. [2019-09-08 11:00:56,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:00:56,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 11:00:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:56,158 INFO L225 Difference]: With dead ends: 11159 [2019-09-08 11:00:56,158 INFO L226 Difference]: Without dead ends: 6550 [2019-09-08 11:00:56,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:00:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6550 states. [2019-09-08 11:00:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6550 to 6536. [2019-09-08 11:00:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-09-08 11:00:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 9190 transitions. [2019-09-08 11:00:56,495 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 9190 transitions. Word has length 85 [2019-09-08 11:00:56,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:56,496 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 9190 transitions. [2019-09-08 11:00:56,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:00:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 9190 transitions. [2019-09-08 11:00:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:00:56,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:56,511 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] [2019-09-08 11:00:56,511 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:56,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:56,511 INFO L82 PathProgramCache]: Analyzing trace with hash -916306546, now seen corresponding path program 1 times [2019-09-08 11:00:56,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:56,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:56,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:56,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:56,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:56,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:56,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:00:56,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:00:56,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:00:56,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:00:56,759 INFO L87 Difference]: Start difference. First operand 6536 states and 9190 transitions. Second operand 3 states. [2019-09-08 11:00:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:57,164 INFO L93 Difference]: Finished difference Result 14359 states and 20524 transitions. [2019-09-08 11:00:57,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:00:57,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-08 11:00:57,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:57,202 INFO L225 Difference]: With dead ends: 14359 [2019-09-08 11:00:57,202 INFO L226 Difference]: Without dead ends: 9506 [2019-09-08 11:00:57,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:00:57,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9506 states. [2019-09-08 11:00:57,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9506 to 9480. [2019-09-08 11:00:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9480 states. [2019-09-08 11:00:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9480 states to 9480 states and 13312 transitions. [2019-09-08 11:00:57,590 INFO L78 Accepts]: Start accepts. Automaton has 9480 states and 13312 transitions. Word has length 85 [2019-09-08 11:00:57,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:57,590 INFO L475 AbstractCegarLoop]: Abstraction has 9480 states and 13312 transitions. [2019-09-08 11:00:57,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:00:57,591 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states and 13312 transitions. [2019-09-08 11:00:57,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:00:57,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:57,604 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] [2019-09-08 11:00:57,605 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:57,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:57,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2114238153, now seen corresponding path program 1 times [2019-09-08 11:00:57,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:57,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:57,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:57,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:57,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:57,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:57,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:00:57,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:00:57,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:00:57,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:00:57,835 INFO L87 Difference]: Start difference. First operand 9480 states and 13312 transitions. Second operand 3 states. [2019-09-08 11:00:58,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:58,452 INFO L93 Difference]: Finished difference Result 24555 states and 34944 transitions. [2019-09-08 11:00:58,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:00:58,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-08 11:00:58,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:58,493 INFO L225 Difference]: With dead ends: 24555 [2019-09-08 11:00:58,493 INFO L226 Difference]: Without dead ends: 16606 [2019-09-08 11:00:58,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:00:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16606 states. [2019-09-08 11:00:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16606 to 16574. [2019-09-08 11:00:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16574 states. [2019-09-08 11:00:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16574 states to 16574 states and 23266 transitions. [2019-09-08 11:00:59,170 INFO L78 Accepts]: Start accepts. Automaton has 16574 states and 23266 transitions. Word has length 85 [2019-09-08 11:00:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:59,171 INFO L475 AbstractCegarLoop]: Abstraction has 16574 states and 23266 transitions. [2019-09-08 11:00:59,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:00:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 16574 states and 23266 transitions. [2019-09-08 11:00:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:00:59,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:59,191 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] [2019-09-08 11:00:59,192 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:59,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:59,192 INFO L82 PathProgramCache]: Analyzing trace with hash 928058945, now seen corresponding path program 1 times [2019-09-08 11:00:59,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:59,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:59,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:59,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:59,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:59,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:59,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:00:59,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:00:59,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:00:59,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:00:59,434 INFO L87 Difference]: Start difference. First operand 16574 states and 23266 transitions. Second operand 5 states. [2019-09-08 11:01:01,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:01,472 INFO L93 Difference]: Finished difference Result 43101 states and 61389 transitions. [2019-09-08 11:01:01,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:01:01,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 11:01:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:01,543 INFO L225 Difference]: With dead ends: 43101 [2019-09-08 11:01:01,544 INFO L226 Difference]: Without dead ends: 27363 [2019-09-08 11:01:01,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:01:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27363 states. [2019-09-08 11:01:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27363 to 27361. [2019-09-08 11:01:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27361 states. [2019-09-08 11:01:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27361 states to 27361 states and 38852 transitions. [2019-09-08 11:01:02,664 INFO L78 Accepts]: Start accepts. Automaton has 27361 states and 38852 transitions. Word has length 85 [2019-09-08 11:01:02,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:02,664 INFO L475 AbstractCegarLoop]: Abstraction has 27361 states and 38852 transitions. [2019-09-08 11:01:02,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:01:02,664 INFO L276 IsEmpty]: Start isEmpty. Operand 27361 states and 38852 transitions. [2019-09-08 11:01:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:01:02,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:02,684 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] [2019-09-08 11:01:02,684 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:02,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1383795896, now seen corresponding path program 1 times [2019-09-08 11:01:02,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:02,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:02,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:02,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:02,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:02,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:02,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:01:02,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:01:02,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:01:02,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:02,885 INFO L87 Difference]: Start difference. First operand 27361 states and 38852 transitions. Second operand 3 states. [2019-09-08 11:01:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:04,028 INFO L93 Difference]: Finished difference Result 61034 states and 87101 transitions. [2019-09-08 11:01:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:01:04,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-08 11:01:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:04,126 INFO L225 Difference]: With dead ends: 61034 [2019-09-08 11:01:04,127 INFO L226 Difference]: Without dead ends: 38211 [2019-09-08 11:01:04,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38211 states. [2019-09-08 11:01:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38211 to 38089. [2019-09-08 11:01:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38089 states. [2019-09-08 11:01:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38089 states to 38089 states and 53293 transitions. [2019-09-08 11:01:06,730 INFO L78 Accepts]: Start accepts. Automaton has 38089 states and 53293 transitions. Word has length 86 [2019-09-08 11:01:06,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:06,730 INFO L475 AbstractCegarLoop]: Abstraction has 38089 states and 53293 transitions. [2019-09-08 11:01:06,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:01:06,730 INFO L276 IsEmpty]: Start isEmpty. Operand 38089 states and 53293 transitions. [2019-09-08 11:01:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:01:06,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:06,759 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] [2019-09-08 11:01:06,759 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:06,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2015781570, now seen corresponding path program 1 times [2019-09-08 11:01:06,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:06,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:06,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:06,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:06,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:07,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:07,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:01:07,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:01:07,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:01:07,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:01:07,040 INFO L87 Difference]: Start difference. First operand 38089 states and 53293 transitions. Second operand 5 states. [2019-09-08 11:01:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:09,874 INFO L93 Difference]: Finished difference Result 89463 states and 125594 transitions. [2019-09-08 11:01:09,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:01:09,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 11:01:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:09,983 INFO L225 Difference]: With dead ends: 89463 [2019-09-08 11:01:09,984 INFO L226 Difference]: Without dead ends: 52651 [2019-09-08 11:01:10,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:01:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52651 states. [2019-09-08 11:01:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52651 to 52469. [2019-09-08 11:01:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52469 states. [2019-09-08 11:01:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52469 states to 52469 states and 73225 transitions. [2019-09-08 11:01:12,094 INFO L78 Accepts]: Start accepts. Automaton has 52469 states and 73225 transitions. Word has length 87 [2019-09-08 11:01:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:12,094 INFO L475 AbstractCegarLoop]: Abstraction has 52469 states and 73225 transitions. [2019-09-08 11:01:12,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:01:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 52469 states and 73225 transitions. [2019-09-08 11:01:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:01:12,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:12,124 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] [2019-09-08 11:01:12,124 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:12,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:12,124 INFO L82 PathProgramCache]: Analyzing trace with hash 57766554, now seen corresponding path program 1 times [2019-09-08 11:01:12,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:12,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:12,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:12,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:12,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:12,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:12,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:01:12,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:01:12,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:01:12,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:01:12,384 INFO L87 Difference]: Start difference. First operand 52469 states and 73225 transitions. Second operand 7 states. [2019-09-08 11:01:24,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:24,699 INFO L93 Difference]: Finished difference Result 249385 states and 352361 transitions. [2019-09-08 11:01:24,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:01:24,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-08 11:01:24,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:25,117 INFO L225 Difference]: With dead ends: 249385 [2019-09-08 11:01:25,118 INFO L226 Difference]: Without dead ends: 225206 [2019-09-08 11:01:25,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:01:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225206 states. [2019-09-08 11:01:29,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225206 to 52781. [2019-09-08 11:01:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52781 states. [2019-09-08 11:01:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52781 states to 52781 states and 73637 transitions. [2019-09-08 11:01:29,139 INFO L78 Accepts]: Start accepts. Automaton has 52781 states and 73637 transitions. Word has length 88 [2019-09-08 11:01:29,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:29,139 INFO L475 AbstractCegarLoop]: Abstraction has 52781 states and 73637 transitions. [2019-09-08 11:01:29,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:01:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 52781 states and 73637 transitions. [2019-09-08 11:01:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:01:29,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:29,156 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] [2019-09-08 11:01:29,156 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:29,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:29,156 INFO L82 PathProgramCache]: Analyzing trace with hash -811257953, now seen corresponding path program 1 times [2019-09-08 11:01:29,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:29,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:29,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:29,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:29,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:29,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:29,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:01:29,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:01:29,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:01:29,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:01:29,398 INFO L87 Difference]: Start difference. First operand 52781 states and 73637 transitions. Second operand 7 states. [2019-09-08 11:01:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:44,856 INFO L93 Difference]: Finished difference Result 248400 states and 350332 transitions. [2019-09-08 11:01:44,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:01:44,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-08 11:01:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:45,224 INFO L225 Difference]: With dead ends: 248400 [2019-09-08 11:01:45,225 INFO L226 Difference]: Without dead ends: 221760 [2019-09-08 11:01:45,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:01:45,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221760 states. [2019-09-08 11:01:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221760 to 53445. [2019-09-08 11:01:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53445 states. [2019-09-08 11:01:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53445 states to 53445 states and 74521 transitions. [2019-09-08 11:01:49,645 INFO L78 Accepts]: Start accepts. Automaton has 53445 states and 74521 transitions. Word has length 88 [2019-09-08 11:01:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:49,646 INFO L475 AbstractCegarLoop]: Abstraction has 53445 states and 74521 transitions. [2019-09-08 11:01:49,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:01:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 53445 states and 74521 transitions. [2019-09-08 11:01:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:01:49,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:49,666 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] [2019-09-08 11:01:49,666 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:49,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:49,666 INFO L82 PathProgramCache]: Analyzing trace with hash 270537802, now seen corresponding path program 1 times [2019-09-08 11:01:49,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:49,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:49,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:49,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:49,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:49,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:49,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:01:49,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:01:49,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:01:49,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:01:49,897 INFO L87 Difference]: Start difference. First operand 53445 states and 74521 transitions. Second operand 7 states. [2019-09-08 11:02:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:13,170 INFO L93 Difference]: Finished difference Result 292115 states and 413608 transitions. [2019-09-08 11:02:13,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:02:13,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-08 11:02:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:13,575 INFO L225 Difference]: With dead ends: 292115 [2019-09-08 11:02:13,575 INFO L226 Difference]: Without dead ends: 271398 [2019-09-08 11:02:13,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:02:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271398 states. [2019-09-08 11:02:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271398 to 53615. [2019-09-08 11:02:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53615 states. [2019-09-08 11:02:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53615 states to 53615 states and 74741 transitions. [2019-09-08 11:02:19,291 INFO L78 Accepts]: Start accepts. Automaton has 53615 states and 74741 transitions. Word has length 88 [2019-09-08 11:02:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:19,291 INFO L475 AbstractCegarLoop]: Abstraction has 53615 states and 74741 transitions. [2019-09-08 11:02:19,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:02:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 53615 states and 74741 transitions. [2019-09-08 11:02:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:02:19,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:19,316 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] [2019-09-08 11:02:19,316 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:19,316 INFO L82 PathProgramCache]: Analyzing trace with hash -252688091, now seen corresponding path program 1 times [2019-09-08 11:02:19,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:19,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:19,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:19,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:19,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:02:19,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:19,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:02:19,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:02:19,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:02:19,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:19,983 INFO L87 Difference]: Start difference. First operand 53615 states and 74741 transitions. Second operand 7 states. [2019-09-08 11:02:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:38,649 INFO L93 Difference]: Finished difference Result 201376 states and 282867 transitions. [2019-09-08 11:02:38,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:02:38,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-08 11:02:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:38,879 INFO L225 Difference]: With dead ends: 201376 [2019-09-08 11:02:38,880 INFO L226 Difference]: Without dead ends: 173854 [2019-09-08 11:02:38,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:02:39,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173854 states. [2019-09-08 11:02:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173854 to 53699. [2019-09-08 11:02:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53699 states. [2019-09-08 11:02:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53699 states to 53699 states and 74849 transitions. [2019-09-08 11:02:44,276 INFO L78 Accepts]: Start accepts. Automaton has 53699 states and 74849 transitions. Word has length 88 [2019-09-08 11:02:44,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:44,276 INFO L475 AbstractCegarLoop]: Abstraction has 53699 states and 74849 transitions. [2019-09-08 11:02:44,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:02:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 53699 states and 74849 transitions. [2019-09-08 11:02:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:02:44,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:44,299 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] [2019-09-08 11:02:44,299 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:44,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:44,300 INFO L82 PathProgramCache]: Analyzing trace with hash -469974282, now seen corresponding path program 1 times [2019-09-08 11:02:44,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:44,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:44,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:44,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:44,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:02:44,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:44,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:02:44,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:02:44,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:02:44,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:44,518 INFO L87 Difference]: Start difference. First operand 53699 states and 74849 transitions. Second operand 7 states. [2019-09-08 11:03:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:10,232 INFO L93 Difference]: Finished difference Result 221381 states and 311597 transitions. [2019-09-08 11:03:10,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:03:10,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-09-08 11:03:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:10,503 INFO L225 Difference]: With dead ends: 221381 [2019-09-08 11:03:10,503 INFO L226 Difference]: Without dead ends: 196197 [2019-09-08 11:03:10,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:03:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196197 states. [2019-09-08 11:03:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196197 to 53990. [2019-09-08 11:03:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53990 states. [2019-09-08 11:03:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53990 states to 53990 states and 75250 transitions. [2019-09-08 11:03:16,862 INFO L78 Accepts]: Start accepts. Automaton has 53990 states and 75250 transitions. Word has length 88 [2019-09-08 11:03:16,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:16,862 INFO L475 AbstractCegarLoop]: Abstraction has 53990 states and 75250 transitions. [2019-09-08 11:03:16,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:03:16,862 INFO L276 IsEmpty]: Start isEmpty. Operand 53990 states and 75250 transitions. [2019-09-08 11:03:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:03:16,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:16,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:03:16,880 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:16,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1872353157, now seen corresponding path program 1 times [2019-09-08 11:03:16,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:16,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:16,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:16,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:16,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:03:17,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:17,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:03:17,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:03:17,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:03:17,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:03:17,637 INFO L87 Difference]: Start difference. First operand 53990 states and 75250 transitions. Second operand 8 states. [2019-09-08 11:03:40,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:40,658 INFO L93 Difference]: Finished difference Result 209793 states and 297737 transitions. [2019-09-08 11:03:40,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:03:40,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2019-09-08 11:03:40,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:40,884 INFO L225 Difference]: With dead ends: 209793 [2019-09-08 11:03:40,884 INFO L226 Difference]: Without dead ends: 168438 [2019-09-08 11:03:40,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:03:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168438 states. [2019-09-08 11:03:47,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168438 to 52510. [2019-09-08 11:03:47,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52510 states. [2019-09-08 11:03:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52510 states to 52510 states and 73201 transitions. [2019-09-08 11:03:47,840 INFO L78 Accepts]: Start accepts. Automaton has 52510 states and 73201 transitions. Word has length 89 [2019-09-08 11:03:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:47,840 INFO L475 AbstractCegarLoop]: Abstraction has 52510 states and 73201 transitions. [2019-09-08 11:03:47,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:03:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 52510 states and 73201 transitions. [2019-09-08 11:03:47,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:03:47,858 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:47,858 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:03:47,858 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:47,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:47,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1507959810, now seen corresponding path program 1 times [2019-09-08 11:03:47,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:47,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:47,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:47,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:47,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:03:48,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:48,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:03:48,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:03:48,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:03:48,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:03:48,182 INFO L87 Difference]: Start difference. First operand 52510 states and 73201 transitions. Second operand 9 states. [2019-09-08 11:04:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:18,248 INFO L93 Difference]: Finished difference Result 234662 states and 333413 transitions. [2019-09-08 11:04:18,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:04:18,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 11:04:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:18,535 INFO L225 Difference]: With dead ends: 234662 [2019-09-08 11:04:18,536 INFO L226 Difference]: Without dead ends: 196777 [2019-09-08 11:04:18,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:04:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196777 states. [2019-09-08 11:04:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196777 to 52478. [2019-09-08 11:04:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52478 states. [2019-09-08 11:04:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52478 states to 52478 states and 73141 transitions. [2019-09-08 11:04:26,290 INFO L78 Accepts]: Start accepts. Automaton has 52478 states and 73141 transitions. Word has length 89 [2019-09-08 11:04:26,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:26,291 INFO L475 AbstractCegarLoop]: Abstraction has 52478 states and 73141 transitions. [2019-09-08 11:04:26,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:04:26,291 INFO L276 IsEmpty]: Start isEmpty. Operand 52478 states and 73141 transitions. [2019-09-08 11:04:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:04:26,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:26,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:26,307 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:26,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:26,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1558975788, now seen corresponding path program 1 times [2019-09-08 11:04:26,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:26,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:26,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:26,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:26,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:26,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:26,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:04:26,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:04:26,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:04:26,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:04:26,525 INFO L87 Difference]: Start difference. First operand 52478 states and 73141 transitions. Second operand 7 states. [2019-09-08 11:05:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:02,978 INFO L93 Difference]: Finished difference Result 245564 states and 347461 transitions. [2019-09-08 11:05:02,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:05:02,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-08 11:05:02,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:03,319 INFO L225 Difference]: With dead ends: 245564 [2019-09-08 11:05:03,319 INFO L226 Difference]: Without dead ends: 222809 [2019-09-08 11:05:03,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:05:03,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222809 states. [2019-09-08 11:05:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222809 to 52553. [2019-09-08 11:05:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52553 states. [2019-09-08 11:05:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52553 states to 52553 states and 73241 transitions. [2019-09-08 11:05:11,256 INFO L78 Accepts]: Start accepts. Automaton has 52553 states and 73241 transitions. Word has length 89 [2019-09-08 11:05:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:11,256 INFO L475 AbstractCegarLoop]: Abstraction has 52553 states and 73241 transitions. [2019-09-08 11:05:11,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:05:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 52553 states and 73241 transitions. [2019-09-08 11:05:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:05:11,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:11,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:05:11,272 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:11,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:11,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1906086959, now seen corresponding path program 1 times [2019-09-08 11:05:11,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:11,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:11,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:11,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:11,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:05:11,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:11,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:05:11,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:05:11,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:05:11,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:05:11,485 INFO L87 Difference]: Start difference. First operand 52553 states and 73241 transitions. Second operand 7 states. [2019-09-08 11:05:49,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:49,855 INFO L93 Difference]: Finished difference Result 244660 states and 345587 transitions. [2019-09-08 11:05:49,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:05:49,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-08 11:05:49,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:50,190 INFO L225 Difference]: With dead ends: 244660 [2019-09-08 11:05:50,191 INFO L226 Difference]: Without dead ends: 219292 [2019-09-08 11:05:50,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:05:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219292 states. [2019-09-08 11:06:02,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219292 to 52701. [2019-09-08 11:06:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52701 states. [2019-09-08 11:06:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52701 states to 52701 states and 73439 transitions. [2019-09-08 11:06:02,297 INFO L78 Accepts]: Start accepts. Automaton has 52701 states and 73439 transitions. Word has length 89 [2019-09-08 11:06:02,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:02,297 INFO L475 AbstractCegarLoop]: Abstraction has 52701 states and 73439 transitions. [2019-09-08 11:06:02,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:06:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 52701 states and 73439 transitions. [2019-09-08 11:06:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:06:02,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:02,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:02,315 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:02,315 INFO L82 PathProgramCache]: Analyzing trace with hash 317477170, now seen corresponding path program 1 times [2019-09-08 11:06:02,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:02,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:02,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:02,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:02,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:02,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:02,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:06:02,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:06:02,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:06:02,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:06:02,602 INFO L87 Difference]: Start difference. First operand 52701 states and 73439 transitions. Second operand 9 states. [2019-09-08 11:06:35,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:35,953 INFO L93 Difference]: Finished difference Result 221345 states and 314430 transitions. [2019-09-08 11:06:35,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:06:35,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 11:06:35,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:36,207 INFO L225 Difference]: With dead ends: 221345 [2019-09-08 11:06:36,207 INFO L226 Difference]: Without dead ends: 182398 [2019-09-08 11:06:36,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:06:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182398 states. [2019-09-08 11:06:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182398 to 52127. [2019-09-08 11:06:45,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52127 states. [2019-09-08 11:06:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52127 states to 52127 states and 72656 transitions. [2019-09-08 11:06:45,456 INFO L78 Accepts]: Start accepts. Automaton has 52127 states and 72656 transitions. Word has length 89 [2019-09-08 11:06:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:45,457 INFO L475 AbstractCegarLoop]: Abstraction has 52127 states and 72656 transitions. [2019-09-08 11:06:45,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:06:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 52127 states and 72656 transitions. [2019-09-08 11:06:45,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:06:45,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:45,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] [2019-09-08 11:06:45,472 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:45,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:45,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1988876191, now seen corresponding path program 1 times [2019-09-08 11:06:45,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:45,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:45,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:45,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:45,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:45,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:45,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:06:45,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:06:45,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:06:45,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:06:45,768 INFO L87 Difference]: Start difference. First operand 52127 states and 72656 transitions. Second operand 9 states. [2019-09-08 11:07:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:26,204 INFO L93 Difference]: Finished difference Result 235928 states and 337317 transitions. [2019-09-08 11:07:26,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:07:26,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 11:07:26,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:26,471 INFO L225 Difference]: With dead ends: 235928 [2019-09-08 11:07:26,472 INFO L226 Difference]: Without dead ends: 197927 [2019-09-08 11:07:26,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:07:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197927 states. [2019-09-08 11:07:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197927 to 52041. [2019-09-08 11:07:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52041 states. [2019-09-08 11:07:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52041 states to 52041 states and 72532 transitions. [2019-09-08 11:07:35,952 INFO L78 Accepts]: Start accepts. Automaton has 52041 states and 72532 transitions. Word has length 89 [2019-09-08 11:07:35,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:35,952 INFO L475 AbstractCegarLoop]: Abstraction has 52041 states and 72532 transitions. [2019-09-08 11:07:35,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:07:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 52041 states and 72532 transitions. [2019-09-08 11:07:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:07:35,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:35,968 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:07:35,968 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:35,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:35,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1526338783, now seen corresponding path program 1 times [2019-09-08 11:07:35,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:35,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:35,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:35,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:35,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:07:36,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:36,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:07:36,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:07:36,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:07:36,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:07:36,222 INFO L87 Difference]: Start difference. First operand 52041 states and 72532 transitions. Second operand 7 states. [2019-09-08 11:08:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:08:24,375 INFO L93 Difference]: Finished difference Result 243852 states and 344481 transitions. [2019-09-08 11:08:24,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:08:24,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2019-09-08 11:08:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:08:24,711 INFO L225 Difference]: With dead ends: 243852 [2019-09-08 11:08:24,711 INFO L226 Difference]: Without dead ends: 218526 [2019-09-08 11:08:24,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:08:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218526 states. [2019-09-08 11:08:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218526 to 52146. [2019-09-08 11:08:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52146 states. [2019-09-08 11:08:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52146 states to 52146 states and 72672 transitions. [2019-09-08 11:08:34,597 INFO L78 Accepts]: Start accepts. Automaton has 52146 states and 72672 transitions. Word has length 89 [2019-09-08 11:08:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:34,597 INFO L475 AbstractCegarLoop]: Abstraction has 52146 states and 72672 transitions. [2019-09-08 11:08:34,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:08:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 52146 states and 72672 transitions. [2019-09-08 11:08:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:08:34,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:34,613 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:08:34,613 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:34,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:34,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1963014080, now seen corresponding path program 1 times [2019-09-08 11:08:34,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:34,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:34,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:34,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:34,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:08:34,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:34,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:08:34,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:08:34,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:08:34,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:08:34,910 INFO L87 Difference]: Start difference. First operand 52146 states and 72672 transitions. Second operand 9 states. [2019-09-08 11:09:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:20,967 INFO L93 Difference]: Finished difference Result 234841 states and 333768 transitions. [2019-09-08 11:09:20,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:09:20,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-08 11:09:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:21,273 INFO L225 Difference]: With dead ends: 234841 [2019-09-08 11:09:21,273 INFO L226 Difference]: Without dead ends: 196894 [2019-09-08 11:09:21,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:09:21,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196894 states. [2019-09-08 11:09:31,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196894 to 52087. [2019-09-08 11:09:31,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52087 states. [2019-09-08 11:09:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52087 states to 52087 states and 72583 transitions. [2019-09-08 11:09:31,756 INFO L78 Accepts]: Start accepts. Automaton has 52087 states and 72583 transitions. Word has length 89 [2019-09-08 11:09:31,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:31,756 INFO L475 AbstractCegarLoop]: Abstraction has 52087 states and 72583 transitions. [2019-09-08 11:09:31,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:09:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 52087 states and 72583 transitions. [2019-09-08 11:09:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:09:31,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:31,773 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] [2019-09-08 11:09:31,773 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:31,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:31,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1093801911, now seen corresponding path program 1 times [2019-09-08 11:09:31,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:31,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:31,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:31,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:31,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:32,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:32,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 11:09:32,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 11:09:32,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 11:09:32,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:09:32,717 INFO L87 Difference]: Start difference. First operand 52087 states and 72583 transitions. Second operand 15 states. [2019-09-08 11:11:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:24,917 INFO L93 Difference]: Finished difference Result 474811 states and 678384 transitions. [2019-09-08 11:11:24,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 11:11:24,917 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2019-09-08 11:11:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:25,640 INFO L225 Difference]: With dead ends: 474811 [2019-09-08 11:11:25,640 INFO L226 Difference]: Without dead ends: 436946 [2019-09-08 11:11:25,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 11:11:26,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436946 states. [2019-09-08 11:11:39,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436946 to 52051. [2019-09-08 11:11:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52051 states. [2019-09-08 11:11:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52051 states to 52051 states and 72511 transitions. [2019-09-08 11:11:39,649 INFO L78 Accepts]: Start accepts. Automaton has 52051 states and 72511 transitions. Word has length 90 [2019-09-08 11:11:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:39,650 INFO L475 AbstractCegarLoop]: Abstraction has 52051 states and 72511 transitions. [2019-09-08 11:11:39,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 11:11:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 52051 states and 72511 transitions. [2019-09-08 11:11:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:11:39,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:39,667 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] [2019-09-08 11:11:39,668 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:39,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1435232020, now seen corresponding path program 1 times [2019-09-08 11:11:39,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:39,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:39,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:39,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:39,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:11:39,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:39,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:11:39,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:11:39,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:11:39,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:11:39,899 INFO L87 Difference]: Start difference. First operand 52051 states and 72511 transitions. Second operand 7 states. [2019-09-08 11:12:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:12:35,161 INFO L93 Difference]: Finished difference Result 219256 states and 308632 transitions. [2019-09-08 11:12:35,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:12:35,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:12:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:12:35,485 INFO L225 Difference]: With dead ends: 219256 [2019-09-08 11:12:35,485 INFO L226 Difference]: Without dead ends: 194072 [2019-09-08 11:12:35,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:12:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194072 states. [2019-09-08 11:12:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194072 to 52364. [2019-09-08 11:12:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52364 states. [2019-09-08 11:12:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52364 states to 52364 states and 72949 transitions. [2019-09-08 11:12:52,226 INFO L78 Accepts]: Start accepts. Automaton has 52364 states and 72949 transitions. Word has length 90 [2019-09-08 11:12:52,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:12:52,226 INFO L475 AbstractCegarLoop]: Abstraction has 52364 states and 72949 transitions. [2019-09-08 11:12:52,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:12:52,226 INFO L276 IsEmpty]: Start isEmpty. Operand 52364 states and 72949 transitions. [2019-09-08 11:12:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:12:52,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:12:52,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] [2019-09-08 11:12:52,243 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:12:52,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:12:52,243 INFO L82 PathProgramCache]: Analyzing trace with hash 167167852, now seen corresponding path program 1 times [2019-09-08 11:12:52,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:12:52,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:12:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:52,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:12:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:12:52,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:12:52,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:12:52,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:12:52,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:12:52,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:12:52,840 INFO L87 Difference]: Start difference. First operand 52364 states and 72949 transitions. Second operand 12 states.