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_floodmax.4.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:02:32,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:02:32,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:02:32,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:02:32,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:02:32,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:02:32,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:02:32,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:02:32,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:02:32,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:02:32,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:02:32,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:02:32,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:02:32,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:02:32,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:02:32,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:02:32,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:02:32,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:02:32,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:02:32,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:02:32,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:02:32,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:02:32,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:02:32,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:02:32,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:02:32,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:02:32,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:02:32,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:02:32,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:02:32,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:02:32,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:02:32,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:02:32,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:02:32,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:02:32,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:02:32,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:02:32,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:02:32,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:02:32,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:02:32,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:02:32,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:02:32,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:02:32,113 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:02:32,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:02:32,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:02:32,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:02:32,115 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:02:32,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:02:32,115 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:02:32,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:02:32,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:02:32,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:02:32,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:02:32,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:02:32,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:02:32,117 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:02:32,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:02:32,117 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:02:32,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:02:32,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:02:32,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:02:32,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:02:32,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:02:32,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:02:32,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:02:32,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:02:32,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:02:32,119 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:02:32,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:02:32,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:02:32,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:02:32,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:02:32,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:02:32,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:02:32,186 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:02:32,187 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:02:32,187 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c [2019-09-08 10:02:32,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805978237/daee235673e041d0af2adc2fe4e27510/FLAG78b89deb8 [2019-09-08 10:02:32,871 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:02:32,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c [2019-09-08 10:02:32,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805978237/daee235673e041d0af2adc2fe4e27510/FLAG78b89deb8 [2019-09-08 10:02:33,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805978237/daee235673e041d0af2adc2fe4e27510 [2019-09-08 10:02:33,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:02:33,084 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:02:33,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:02:33,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:02:33,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:02:33,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:02:33" (1/1) ... [2019-09-08 10:02:33,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f35a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:33, skipping insertion in model container [2019-09-08 10:02:33,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:02:33" (1/1) ... [2019-09-08 10:02:33,102 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:02:33,268 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:02:34,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:02:34,391 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:02:34,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:02:34,880 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:02:34,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:34 WrapperNode [2019-09-08 10:02:34,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:02:34,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:02:34,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:02:34,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:02:34,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:34" (1/1) ... [2019-09-08 10:02:34,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:34" (1/1) ... [2019-09-08 10:02:34,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:34" (1/1) ... [2019-09-08 10:02:34,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:34" (1/1) ... [2019-09-08 10:02:35,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:34" (1/1) ... [2019-09-08 10:02:35,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:34" (1/1) ... [2019-09-08 10:02:35,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:34" (1/1) ... [2019-09-08 10:02:35,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:02:35,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:02:35,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:02:35,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:02:35,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02: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 10:02:35,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:02:35,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:02:35,209 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:02:35,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:02:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:02:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:02:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:02:35,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:02:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:02:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:02:35,212 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:02:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:02:35,213 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:02:35,214 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:02:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:02:35,215 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:02:35,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:02:35,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:02:35,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:02:38,432 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:02:38,432 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:02:38,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:02:38 BoogieIcfgContainer [2019-09-08 10:02:38,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:02:38,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:02:38,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:02:38,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:02:38,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:02:33" (1/3) ... [2019-09-08 10:02:38,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61edc0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:02:38, skipping insertion in model container [2019-09-08 10:02:38,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:34" (2/3) ... [2019-09-08 10:02:38,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61edc0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:02:38, skipping insertion in model container [2019-09-08 10:02:38,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:02:38" (3/3) ... [2019-09-08 10:02:38,452 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.BOUNDED-8.pals.c.p+lhb-reducer.c [2019-09-08 10:02:38,465 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:02:38,475 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 10:02:38,494 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 10:02:38,541 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:02:38,542 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:02:38,542 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:02:38,542 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:02:38,542 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:02:38,542 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:02:38,543 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:02:38,543 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:02:38,543 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:02:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states. [2019-09-08 10:02:38,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 10:02:38,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:38,624 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:38,626 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:38,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:38,631 INFO L82 PathProgramCache]: Analyzing trace with hash -613597225, now seen corresponding path program 1 times [2019-09-08 10:02:38,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:38,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:38,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:38,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:38,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:02:39,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:39,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:02:39,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:02:39,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:02:39,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:02:39,301 INFO L87 Difference]: Start difference. First operand 1078 states. Second operand 4 states. [2019-09-08 10:02:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:39,642 INFO L93 Difference]: Finished difference Result 1968 states and 3404 transitions. [2019-09-08 10:02:39,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:02:39,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-08 10:02:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:39,683 INFO L225 Difference]: With dead ends: 1968 [2019-09-08 10:02:39,684 INFO L226 Difference]: Without dead ends: 1074 [2019-09-08 10:02:39,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:02:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-09-08 10:02:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1074. [2019-09-08 10:02:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2019-09-08 10:02:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1817 transitions. [2019-09-08 10:02:39,853 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1817 transitions. Word has length 160 [2019-09-08 10:02:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:39,854 INFO L475 AbstractCegarLoop]: Abstraction has 1074 states and 1817 transitions. [2019-09-08 10:02:39,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:02:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1817 transitions. [2019-09-08 10:02:39,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 10:02:39,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:39,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:39,869 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:39,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:39,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1016669195, now seen corresponding path program 1 times [2019-09-08 10:02:39,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:39,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:39,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:39,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:02:40,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:40,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:40,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:40,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:40,224 INFO L87 Difference]: Start difference. First operand 1074 states and 1817 transitions. Second operand 3 states. [2019-09-08 10:02:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:40,550 INFO L93 Difference]: Finished difference Result 2711 states and 4600 transitions. [2019-09-08 10:02:40,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:40,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-09-08 10:02:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:40,565 INFO L225 Difference]: With dead ends: 2711 [2019-09-08 10:02:40,565 INFO L226 Difference]: Without dead ends: 1858 [2019-09-08 10:02:40,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:40,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2019-09-08 10:02:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1854. [2019-09-08 10:02:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-09-08 10:02:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 3106 transitions. [2019-09-08 10:02:40,640 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 3106 transitions. Word has length 201 [2019-09-08 10:02:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:40,645 INFO L475 AbstractCegarLoop]: Abstraction has 1854 states and 3106 transitions. [2019-09-08 10:02:40,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 3106 transitions. [2019-09-08 10:02:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 10:02:40,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:40,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:40,652 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:40,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash 277876415, now seen corresponding path program 1 times [2019-09-08 10:02:40,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:40,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:40,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:40,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:40,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:02:40,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:40,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:40,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:40,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:40,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:40,868 INFO L87 Difference]: Start difference. First operand 1854 states and 3106 transitions. Second operand 3 states. [2019-09-08 10:02:41,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:41,178 INFO L93 Difference]: Finished difference Result 3088 states and 5217 transitions. [2019-09-08 10:02:41,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:41,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-08 10:02:41,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:41,195 INFO L225 Difference]: With dead ends: 3088 [2019-09-08 10:02:41,196 INFO L226 Difference]: Without dead ends: 2227 [2019-09-08 10:02:41,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:41,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2019-09-08 10:02:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2223. [2019-09-08 10:02:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-09-08 10:02:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3736 transitions. [2019-09-08 10:02:41,278 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3736 transitions. Word has length 204 [2019-09-08 10:02:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:41,279 INFO L475 AbstractCegarLoop]: Abstraction has 2223 states and 3736 transitions. [2019-09-08 10:02:41,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3736 transitions. [2019-09-08 10:02:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 10:02:41,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:41,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:41,289 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:41,290 INFO L82 PathProgramCache]: Analyzing trace with hash 952115744, now seen corresponding path program 1 times [2019-09-08 10:02:41,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:41,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:41,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:41,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:02:41,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:41,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:41,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:41,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:41,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:41,435 INFO L87 Difference]: Start difference. First operand 2223 states and 3736 transitions. Second operand 3 states. [2019-09-08 10:02:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:41,690 INFO L93 Difference]: Finished difference Result 6037 states and 10144 transitions. [2019-09-08 10:02:41,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:41,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-09-08 10:02:41,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:41,712 INFO L225 Difference]: With dead ends: 6037 [2019-09-08 10:02:41,712 INFO L226 Difference]: Without dead ends: 4053 [2019-09-08 10:02:41,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4053 states. [2019-09-08 10:02:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4053 to 4049. [2019-09-08 10:02:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2019-09-08 10:02:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 6775 transitions. [2019-09-08 10:02:41,880 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 6775 transitions. Word has length 207 [2019-09-08 10:02:41,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:41,880 INFO L475 AbstractCegarLoop]: Abstraction has 4049 states and 6775 transitions. [2019-09-08 10:02:41,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 6775 transitions. [2019-09-08 10:02:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 10:02:41,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:41,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:41,892 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:41,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:41,893 INFO L82 PathProgramCache]: Analyzing trace with hash 17667418, now seen corresponding path program 1 times [2019-09-08 10:02:41,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:41,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:41,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:41,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:41,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:02:42,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:42,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:42,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:42,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:42,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:42,069 INFO L87 Difference]: Start difference. First operand 4049 states and 6775 transitions. Second operand 3 states. [2019-09-08 10:02:42,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:42,423 INFO L93 Difference]: Finished difference Result 7155 states and 12028 transitions. [2019-09-08 10:02:42,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:42,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-08 10:02:42,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:42,450 INFO L225 Difference]: With dead ends: 7155 [2019-09-08 10:02:42,451 INFO L226 Difference]: Without dead ends: 5163 [2019-09-08 10:02:42,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2019-09-08 10:02:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 5159. [2019-09-08 10:02:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-09-08 10:02:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 8645 transitions. [2019-09-08 10:02:42,666 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 8645 transitions. Word has length 210 [2019-09-08 10:02:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:42,667 INFO L475 AbstractCegarLoop]: Abstraction has 5159 states and 8645 transitions. [2019-09-08 10:02:42,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 8645 transitions. [2019-09-08 10:02:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 10:02:42,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:42,679 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:42,679 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:42,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:42,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1580390183, now seen corresponding path program 1 times [2019-09-08 10:02:42,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:42,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:42,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:42,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:42,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:02:42,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:42,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:42,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:42,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:42,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:42,817 INFO L87 Difference]: Start difference. First operand 5159 states and 8645 transitions. Second operand 3 states. [2019-09-08 10:02:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:43,248 INFO L93 Difference]: Finished difference Result 14521 states and 24273 transitions. [2019-09-08 10:02:43,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:43,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-09-08 10:02:43,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:43,298 INFO L225 Difference]: With dead ends: 14521 [2019-09-08 10:02:43,298 INFO L226 Difference]: Without dead ends: 9619 [2019-09-08 10:02:43,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:43,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9619 states. [2019-09-08 10:02:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9619 to 9615. [2019-09-08 10:02:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-09-08 10:02:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 15990 transitions. [2019-09-08 10:02:43,700 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 15990 transitions. Word has length 213 [2019-09-08 10:02:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:43,700 INFO L475 AbstractCegarLoop]: Abstraction has 9615 states and 15990 transitions. [2019-09-08 10:02:43,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 15990 transitions. [2019-09-08 10:02:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 10:02:43,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:43,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:43,728 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:43,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:43,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1696038503, now seen corresponding path program 1 times [2019-09-08 10:02:43,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:43,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:43,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:43,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:43,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:02:43,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:43,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:43,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:43,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:43,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:43,909 INFO L87 Difference]: Start difference. First operand 9615 states and 15990 transitions. Second operand 3 states. [2019-09-08 10:02:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:44,327 INFO L93 Difference]: Finished difference Result 17415 states and 29093 transitions. [2019-09-08 10:02:44,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:44,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-08 10:02:44,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:44,384 INFO L225 Difference]: With dead ends: 17415 [2019-09-08 10:02:44,385 INFO L226 Difference]: Without dead ends: 12505 [2019-09-08 10:02:44,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12505 states. [2019-09-08 10:02:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12505 to 12501. [2019-09-08 10:02:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12501 states. [2019-09-08 10:02:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12501 states to 12501 states and 20798 transitions. [2019-09-08 10:02:44,880 INFO L78 Accepts]: Start accepts. Automaton has 12501 states and 20798 transitions. Word has length 216 [2019-09-08 10:02:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:44,881 INFO L475 AbstractCegarLoop]: Abstraction has 12501 states and 20798 transitions. [2019-09-08 10:02:44,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 12501 states and 20798 transitions. [2019-09-08 10:02:44,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 10:02:44,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:44,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:44,905 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:44,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:44,905 INFO L82 PathProgramCache]: Analyzing trace with hash -240031560, now seen corresponding path program 1 times [2019-09-08 10:02:44,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:44,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:44,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:44,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:44,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:45,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 10:02:45,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:45,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:45,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:45,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:45,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:45,039 INFO L87 Difference]: Start difference. First operand 12501 states and 20798 transitions. Second operand 3 states. [2019-09-08 10:02:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:45,752 INFO L93 Difference]: Finished difference Result 35665 states and 59080 transitions. [2019-09-08 10:02:45,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:45,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-08 10:02:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:45,810 INFO L225 Difference]: With dead ends: 35665 [2019-09-08 10:02:45,810 INFO L226 Difference]: Without dead ends: 23439 [2019-09-08 10:02:45,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:45,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23439 states. [2019-09-08 10:02:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23439 to 23435. [2019-09-08 10:02:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23435 states. [2019-09-08 10:02:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23435 states to 23435 states and 38577 transitions. [2019-09-08 10:02:46,600 INFO L78 Accepts]: Start accepts. Automaton has 23435 states and 38577 transitions. Word has length 219 [2019-09-08 10:02:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:46,600 INFO L475 AbstractCegarLoop]: Abstraction has 23435 states and 38577 transitions. [2019-09-08 10:02:46,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 23435 states and 38577 transitions. [2019-09-08 10:02:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 10:02:46,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:46,644 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:46,645 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:46,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:46,645 INFO L82 PathProgramCache]: Analyzing trace with hash 236932990, now seen corresponding path program 1 times [2019-09-08 10:02:46,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:46,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:46,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:46,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:46,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:02:47,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:47,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:47,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:47,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:47,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:47,594 INFO L87 Difference]: Start difference. First operand 23435 states and 38577 transitions. Second operand 3 states. [2019-09-08 10:02:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:48,292 INFO L93 Difference]: Finished difference Result 42597 states and 70426 transitions. [2019-09-08 10:02:48,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:48,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-09-08 10:02:48,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:48,378 INFO L225 Difference]: With dead ends: 42597 [2019-09-08 10:02:48,378 INFO L226 Difference]: Without dead ends: 30363 [2019-09-08 10:02:48,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:48,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30363 states. [2019-09-08 10:02:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30363 to 30359. [2019-09-08 10:02:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30359 states. [2019-09-08 10:02:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30359 states to 30359 states and 49915 transitions. [2019-09-08 10:02:49,478 INFO L78 Accepts]: Start accepts. Automaton has 30359 states and 49915 transitions. Word has length 222 [2019-09-08 10:02:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:49,478 INFO L475 AbstractCegarLoop]: Abstraction has 30359 states and 49915 transitions. [2019-09-08 10:02:49,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 30359 states and 49915 transitions. [2019-09-08 10:02:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 10:02:49,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:49,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:49,528 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:49,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1518995773, now seen corresponding path program 1 times [2019-09-08 10:02:49,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:49,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:49,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:49,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:49,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:02:49,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:49,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:02:49,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:02:49,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:02:49,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:02:49,888 INFO L87 Difference]: Start difference. First operand 30359 states and 49915 transitions. Second operand 6 states. [2019-09-08 10:02:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:56,022 INFO L93 Difference]: Finished difference Result 183264 states and 303148 transitions. [2019-09-08 10:02:56,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 10:02:56,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-08 10:02:56,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:56,399 INFO L225 Difference]: With dead ends: 183264 [2019-09-08 10:02:56,399 INFO L226 Difference]: Without dead ends: 153184 [2019-09-08 10:02:56,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:02:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153184 states. [2019-09-08 10:03:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153184 to 59846. [2019-09-08 10:03:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59846 states. [2019-09-08 10:03:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59846 states to 59846 states and 97749 transitions. [2019-09-08 10:03:00,803 INFO L78 Accepts]: Start accepts. Automaton has 59846 states and 97749 transitions. Word has length 225 [2019-09-08 10:03:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:00,804 INFO L475 AbstractCegarLoop]: Abstraction has 59846 states and 97749 transitions. [2019-09-08 10:03:00,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:03:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 59846 states and 97749 transitions. [2019-09-08 10:03:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 10:03:00,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:00,863 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:03:00,864 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:00,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1749580756, now seen corresponding path program 1 times [2019-09-08 10:03:00,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:00,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:00,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:00,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:01,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:01,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:03:01,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:03:01,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:03:01,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:01,144 INFO L87 Difference]: Start difference. First operand 59846 states and 97749 transitions. Second operand 4 states. [2019-09-08 10:03:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:06,435 INFO L93 Difference]: Finished difference Result 177238 states and 291329 transitions. [2019-09-08 10:03:06,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:03:06,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2019-09-08 10:03:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:06,670 INFO L225 Difference]: With dead ends: 177238 [2019-09-08 10:03:06,671 INFO L226 Difference]: Without dead ends: 117671 [2019-09-08 10:03:06,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117671 states. [2019-09-08 10:03:10,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117671 to 98125. [2019-09-08 10:03:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98125 states. [2019-09-08 10:03:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98125 states to 98125 states and 160415 transitions. [2019-09-08 10:03:10,512 INFO L78 Accepts]: Start accepts. Automaton has 98125 states and 160415 transitions. Word has length 227 [2019-09-08 10:03:10,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:10,513 INFO L475 AbstractCegarLoop]: Abstraction has 98125 states and 160415 transitions. [2019-09-08 10:03:10,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:03:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 98125 states and 160415 transitions. [2019-09-08 10:03:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 10:03:10,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:10,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:03:10,588 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash 567593889, now seen corresponding path program 1 times [2019-09-08 10:03:10,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:10,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:10,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:10,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:10,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:10,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:10,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:03:10,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:03:10,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:03:10,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:10,748 INFO L87 Difference]: Start difference. First operand 98125 states and 160415 transitions. Second operand 4 states. [2019-09-08 10:03:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:18,371 INFO L93 Difference]: Finished difference Result 287177 states and 470612 transitions. [2019-09-08 10:03:18,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:03:18,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-09-08 10:03:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:18,708 INFO L225 Difference]: With dead ends: 287177 [2019-09-08 10:03:18,708 INFO L226 Difference]: Without dead ends: 189331 [2019-09-08 10:03:18,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:03:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189331 states. [2019-09-08 10:03:27,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189331 to 159443. [2019-09-08 10:03:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159443 states. [2019-09-08 10:03:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159443 states to 159443 states and 259641 transitions. [2019-09-08 10:03:27,898 INFO L78 Accepts]: Start accepts. Automaton has 159443 states and 259641 transitions. Word has length 228 [2019-09-08 10:03:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:27,898 INFO L475 AbstractCegarLoop]: Abstraction has 159443 states and 259641 transitions. [2019-09-08 10:03:27,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:03:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 159443 states and 259641 transitions. [2019-09-08 10:03:27,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-08 10:03:27,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:27,980 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:03:27,981 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:27,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:27,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1511413883, now seen corresponding path program 1 times [2019-09-08 10:03:27,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:27,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:27,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:27,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:27,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:28,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:28,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:03:28,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:03:28,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:03:28,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:03:28,124 INFO L87 Difference]: Start difference. First operand 159443 states and 259641 transitions. Second operand 4 states. [2019-09-08 10:03:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:41,410 INFO L93 Difference]: Finished difference Result 461695 states and 753665 transitions. [2019-09-08 10:03:41,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:03:41,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-08 10:03:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:41,790 INFO L225 Difference]: With dead ends: 461695 [2019-09-08 10:03:41,791 INFO L226 Difference]: Without dead ends: 302531 [2019-09-08 10:03:41,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:03:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302531 states. [2019-09-08 10:03:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302531 to 256589. [2019-09-08 10:03:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256589 states. [2019-09-08 10:03:56,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256589 states to 256589 states and 416159 transitions. [2019-09-08 10:03:56,628 INFO L78 Accepts]: Start accepts. Automaton has 256589 states and 416159 transitions. Word has length 229 [2019-09-08 10:03:56,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:56,628 INFO L475 AbstractCegarLoop]: Abstraction has 256589 states and 416159 transitions. [2019-09-08 10:03:56,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:03:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 256589 states and 416159 transitions. [2019-09-08 10:03:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 10:03:56,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:56,778 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:03:56,778 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:56,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:56,778 INFO L82 PathProgramCache]: Analyzing trace with hash -364230168, now seen corresponding path program 1 times [2019-09-08 10:03:56,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:56,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:56,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:56,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:03:56,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:56,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:03:56,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:03:56,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:03:56,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:03:56,942 INFO L87 Difference]: Start difference. First operand 256589 states and 416159 transitions. Second operand 7 states. [2019-09-08 10:04:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:53,060 INFO L93 Difference]: Finished difference Result 1167711 states and 1897697 transitions. [2019-09-08 10:04:53,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:04:53,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 230 [2019-09-08 10:04:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:54,451 INFO L225 Difference]: With dead ends: 1167711 [2019-09-08 10:04:54,452 INFO L226 Difference]: Without dead ends: 911401 [2019-09-08 10:04:54,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:04:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911401 states. [2019-09-08 10:05:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911401 to 663062. [2019-09-08 10:05:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663062 states. [2019-09-08 10:05:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663062 states to 663062 states and 1065947 transitions. [2019-09-08 10:05:49,814 INFO L78 Accepts]: Start accepts. Automaton has 663062 states and 1065947 transitions. Word has length 230 [2019-09-08 10:05:49,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:49,814 INFO L475 AbstractCegarLoop]: Abstraction has 663062 states and 1065947 transitions. [2019-09-08 10:05:49,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:05:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 663062 states and 1065947 transitions. [2019-09-08 10:05:50,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 10:05:50,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:05:50,307 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:50,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2078598738, now seen corresponding path program 1 times [2019-09-08 10:05:50,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:50,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:50,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:50,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:05:50,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:05:50,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:05:50,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:05:50,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:05:50,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:05:50,608 INFO L87 Difference]: Start difference. First operand 663062 states and 1065947 transitions. Second operand 3 states. [2019-09-08 10:06:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:06:17,837 INFO L93 Difference]: Finished difference Result 948227 states and 1530907 transitions. [2019-09-08 10:06:17,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:06:17,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-09-08 10:06:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:06:18,403 INFO L225 Difference]: With dead ends: 948227 [2019-09-08 10:06:18,404 INFO L226 Difference]: Without dead ends: 325335 [2019-09-08 10:06:18,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:06:19,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325335 states. [2019-09-08 10:06:46,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325335 to 325333. [2019-09-08 10:06:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325333 states. [2019-09-08 10:06:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325333 states to 325333 states and 526866 transitions. [2019-09-08 10:06:46,699 INFO L78 Accepts]: Start accepts. Automaton has 325333 states and 526866 transitions. Word has length 232 [2019-09-08 10:06:46,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:06:46,699 INFO L475 AbstractCegarLoop]: Abstraction has 325333 states and 526866 transitions. [2019-09-08 10:06:46,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:06:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 325333 states and 526866 transitions. [2019-09-08 10:06:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 10:06:47,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:06:47,630 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:06:47,630 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:06:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:06:47,631 INFO L82 PathProgramCache]: Analyzing trace with hash 91813434, now seen corresponding path program 1 times [2019-09-08 10:06:47,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:06:47,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:06:47,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:47,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:06:47,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:06:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:06:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:06:47,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:06:47,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:06:47,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:06:47,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:06:47,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:06:47,824 INFO L87 Difference]: Start difference. First operand 325333 states and 526866 transitions. Second operand 3 states. [2019-09-08 10:06:57,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:06:57,591 INFO L93 Difference]: Finished difference Result 429686 states and 696859 transitions. [2019-09-08 10:06:57,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:06:57,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-09-08 10:06:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:06:57,811 INFO L225 Difference]: With dead ends: 429686 [2019-09-08 10:06:57,811 INFO L226 Difference]: Without dead ends: 132164 [2019-09-08 10:06:58,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:06:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132164 states. [2019-09-08 10:07:11,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132164 to 132162. [2019-09-08 10:07:11,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132162 states. [2019-09-08 10:07:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132162 states to 132162 states and 214157 transitions. [2019-09-08 10:07:11,370 INFO L78 Accepts]: Start accepts. Automaton has 132162 states and 214157 transitions. Word has length 238 [2019-09-08 10:07:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:11,370 INFO L475 AbstractCegarLoop]: Abstraction has 132162 states and 214157 transitions. [2019-09-08 10:07:11,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 132162 states and 214157 transitions. [2019-09-08 10:07:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 10:07:11,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:11,437 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:11,437 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:11,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:11,438 INFO L82 PathProgramCache]: Analyzing trace with hash -169996818, now seen corresponding path program 1 times [2019-09-08 10:07:11,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:11,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:11,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:11,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:11,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:11,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:11,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:11,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:11,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:11,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:11,669 INFO L87 Difference]: Start difference. First operand 132162 states and 214157 transitions. Second operand 3 states. [2019-09-08 10:07:15,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:15,472 INFO L93 Difference]: Finished difference Result 172281 states and 279302 transitions. [2019-09-08 10:07:15,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:15,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-09-08 10:07:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:15,541 INFO L225 Difference]: With dead ends: 172281 [2019-09-08 10:07:15,541 INFO L226 Difference]: Without dead ends: 57713 [2019-09-08 10:07:15,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57713 states. [2019-09-08 10:07:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57713 to 57711. [2019-09-08 10:07:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57711 states. [2019-09-08 10:07:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57711 states to 57711 states and 93138 transitions. [2019-09-08 10:07:19,370 INFO L78 Accepts]: Start accepts. Automaton has 57711 states and 93138 transitions. Word has length 244 [2019-09-08 10:07:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:19,370 INFO L475 AbstractCegarLoop]: Abstraction has 57711 states and 93138 transitions. [2019-09-08 10:07:19,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 57711 states and 93138 transitions. [2019-09-08 10:07:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 10:07:19,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:19,402 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:19,402 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:19,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:19,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1356364358, now seen corresponding path program 1 times [2019-09-08 10:07:19,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:19,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:19,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:19,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:19,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:19,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:19,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:07:19,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:07:19,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:07:19,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:07:19,752 INFO L87 Difference]: Start difference. First operand 57711 states and 93138 transitions. Second operand 4 states. [2019-09-08 10:07:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:22,982 INFO L93 Difference]: Finished difference Result 103820 states and 167719 transitions. [2019-09-08 10:07:22,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:07:22,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2019-09-08 10:07:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:23,063 INFO L225 Difference]: With dead ends: 103820 [2019-09-08 10:07:23,063 INFO L226 Difference]: Without dead ends: 49718 [2019-09-08 10:07:23,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:07:23,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49718 states. [2019-09-08 10:07:25,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49718 to 49718. [2019-09-08 10:07:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49718 states. [2019-09-08 10:07:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49718 states to 49718 states and 80195 transitions. [2019-09-08 10:07:25,863 INFO L78 Accepts]: Start accepts. Automaton has 49718 states and 80195 transitions. Word has length 250 [2019-09-08 10:07:25,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:25,863 INFO L475 AbstractCegarLoop]: Abstraction has 49718 states and 80195 transitions. [2019-09-08 10:07:25,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:07:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 49718 states and 80195 transitions. [2019-09-08 10:07:25,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 10:07:25,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:25,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:25,889 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:25,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:25,890 INFO L82 PathProgramCache]: Analyzing trace with hash -458841138, now seen corresponding path program 1 times [2019-09-08 10:07:25,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:25,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:25,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:25,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:25,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:26,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:26,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:07:26,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:07:26,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:07:26,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:26,106 INFO L87 Difference]: Start difference. First operand 49718 states and 80195 transitions. Second operand 3 states. [2019-09-08 10:07:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:27,303 INFO L93 Difference]: Finished difference Result 66670 states and 107784 transitions. [2019-09-08 10:07:27,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:07:27,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-08 10:07:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:27,335 INFO L225 Difference]: With dead ends: 66670 [2019-09-08 10:07:27,335 INFO L226 Difference]: Without dead ends: 20314 [2019-09-08 10:07:27,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:07:27,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20314 states. [2019-09-08 10:07:28,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20314 to 20312. [2019-09-08 10:07:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20312 states. [2019-09-08 10:07:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20312 states to 20312 states and 32742 transitions. [2019-09-08 10:07:28,679 INFO L78 Accepts]: Start accepts. Automaton has 20312 states and 32742 transitions. Word has length 253 [2019-09-08 10:07:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:28,680 INFO L475 AbstractCegarLoop]: Abstraction has 20312 states and 32742 transitions. [2019-09-08 10:07:28,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:07:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 20312 states and 32742 transitions. [2019-09-08 10:07:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 10:07:28,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:28,690 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:28,691 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:28,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:28,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1177906378, now seen corresponding path program 1 times [2019-09-08 10:07:28,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:28,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:28,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:28,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:28,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:29,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:29,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:07:29,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:07:29,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:07:29,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:07:29,006 INFO L87 Difference]: Start difference. First operand 20312 states and 32742 transitions. Second operand 4 states. [2019-09-08 10:07:29,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:29,890 INFO L93 Difference]: Finished difference Result 37210 states and 60044 transitions. [2019-09-08 10:07:29,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:07:29,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2019-09-08 10:07:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:29,913 INFO L225 Difference]: With dead ends: 37210 [2019-09-08 10:07:29,913 INFO L226 Difference]: Without dead ends: 17722 [2019-09-08 10:07:29,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:07:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17722 states. [2019-09-08 10:07:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17722 to 17722. [2019-09-08 10:07:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17722 states. [2019-09-08 10:07:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17722 states to 17722 states and 28585 transitions. [2019-09-08 10:07:30,926 INFO L78 Accepts]: Start accepts. Automaton has 17722 states and 28585 transitions. Word has length 259 [2019-09-08 10:07:30,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:30,926 INFO L475 AbstractCegarLoop]: Abstraction has 17722 states and 28585 transitions. [2019-09-08 10:07:30,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:07:30,926 INFO L276 IsEmpty]: Start isEmpty. Operand 17722 states and 28585 transitions. [2019-09-08 10:07:30,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 10:07:30,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:30,935 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:30,935 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:30,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:30,936 INFO L82 PathProgramCache]: Analyzing trace with hash 281434320, now seen corresponding path program 1 times [2019-09-08 10:07:30,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:30,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:30,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:30,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:30,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:31,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:31,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:07:31,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:07:31,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:07:31,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:07:31,380 INFO L87 Difference]: Start difference. First operand 17722 states and 28585 transitions. Second operand 6 states. [2019-09-08 10:07:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:33,349 INFO L93 Difference]: Finished difference Result 42210 states and 68221 transitions. [2019-09-08 10:07:33,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:07:33,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2019-09-08 10:07:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:33,380 INFO L225 Difference]: With dead ends: 42210 [2019-09-08 10:07:33,381 INFO L226 Difference]: Without dead ends: 24767 [2019-09-08 10:07:33,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:07:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-09-08 10:07:34,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 17722. [2019-09-08 10:07:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17722 states. [2019-09-08 10:07:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17722 states to 17722 states and 28496 transitions. [2019-09-08 10:07:34,258 INFO L78 Accepts]: Start accepts. Automaton has 17722 states and 28496 transitions. Word has length 262 [2019-09-08 10:07:34,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:34,258 INFO L475 AbstractCegarLoop]: Abstraction has 17722 states and 28496 transitions. [2019-09-08 10:07:34,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:07:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand 17722 states and 28496 transitions. [2019-09-08 10:07:34,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 10:07:34,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:34,268 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:34,268 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:34,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:34,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1128256860, now seen corresponding path program 1 times [2019-09-08 10:07:34,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:34,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:34,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:34,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:34,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:34,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:34,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:07:34,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:07:34,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:07:34,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:07:34,583 INFO L87 Difference]: Start difference. First operand 17722 states and 28496 transitions. Second operand 5 states. [2019-09-08 10:07:37,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:37,200 INFO L93 Difference]: Finished difference Result 33395 states and 54082 transitions. [2019-09-08 10:07:37,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:07:37,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 265 [2019-09-08 10:07:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:37,235 INFO L225 Difference]: With dead ends: 33395 [2019-09-08 10:07:37,235 INFO L226 Difference]: Without dead ends: 28503 [2019-09-08 10:07:37,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:07:37,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28503 states. [2019-09-08 10:07:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28503 to 28495. [2019-09-08 10:07:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28495 states. [2019-09-08 10:07:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28495 states to 28495 states and 46039 transitions. [2019-09-08 10:07:38,983 INFO L78 Accepts]: Start accepts. Automaton has 28495 states and 46039 transitions. Word has length 265 [2019-09-08 10:07:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:38,983 INFO L475 AbstractCegarLoop]: Abstraction has 28495 states and 46039 transitions. [2019-09-08 10:07:38,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:07:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 28495 states and 46039 transitions. [2019-09-08 10:07:38,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 10:07:38,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:38,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:38,998 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:38,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:38,998 INFO L82 PathProgramCache]: Analyzing trace with hash -905871944, now seen corresponding path program 1 times [2019-09-08 10:07:38,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:38,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:38,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:39,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:39,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:39,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:39,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:07:39,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:07:39,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:07:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:07:39,347 INFO L87 Difference]: Start difference. First operand 28495 states and 46039 transitions. Second operand 6 states. [2019-09-08 10:07:43,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:43,068 INFO L93 Difference]: Finished difference Result 85527 states and 138617 transitions. [2019-09-08 10:07:43,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:07:43,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2019-09-08 10:07:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:43,130 INFO L225 Difference]: With dead ends: 85527 [2019-09-08 10:07:43,130 INFO L226 Difference]: Without dead ends: 57311 [2019-09-08 10:07:43,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:07:43,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57311 states. [2019-09-08 10:07:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57311 to 57303. [2019-09-08 10:07:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57303 states. [2019-09-08 10:07:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57303 states to 57303 states and 92494 transitions. [2019-09-08 10:07:47,050 INFO L78 Accepts]: Start accepts. Automaton has 57303 states and 92494 transitions. Word has length 265 [2019-09-08 10:07:47,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:47,050 INFO L475 AbstractCegarLoop]: Abstraction has 57303 states and 92494 transitions. [2019-09-08 10:07:47,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:07:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 57303 states and 92494 transitions. [2019-09-08 10:07:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 10:07:47,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:47,081 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:47,081 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:47,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:47,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1166167999, now seen corresponding path program 1 times [2019-09-08 10:07:47,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:47,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:47,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:47,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:47,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:47,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:47,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:07:47,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:07:47,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:07:47,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:07:47,380 INFO L87 Difference]: Start difference. First operand 57303 states and 92494 transitions. Second operand 4 states. [2019-09-08 10:07:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:07:50,824 INFO L93 Difference]: Finished difference Result 109922 states and 177486 transitions. [2019-09-08 10:07:50,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:07:50,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-09-08 10:07:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:07:50,880 INFO L225 Difference]: With dead ends: 109922 [2019-09-08 10:07:50,880 INFO L226 Difference]: Without dead ends: 53192 [2019-09-08 10:07:50,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:07:50,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53192 states. [2019-09-08 10:07:54,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53192 to 53192. [2019-09-08 10:07:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53192 states. [2019-09-08 10:07:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53192 states to 53192 states and 85879 transitions. [2019-09-08 10:07:54,765 INFO L78 Accepts]: Start accepts. Automaton has 53192 states and 85879 transitions. Word has length 266 [2019-09-08 10:07:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:54,765 INFO L475 AbstractCegarLoop]: Abstraction has 53192 states and 85879 transitions. [2019-09-08 10:07:54,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:07:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 53192 states and 85879 transitions. [2019-09-08 10:07:54,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-08 10:07:54,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:54,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:07:54,788 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:54,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:54,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1679455338, now seen corresponding path program 1 times [2019-09-08 10:07:54,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:54,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:54,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:54,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:54,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:07:55,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:55,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:07:55,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:07:55,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:07:55,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:07:55,046 INFO L87 Difference]: Start difference. First operand 53192 states and 85879 transitions. Second operand 9 states. [2019-09-08 10:08:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:08:19,693 INFO L93 Difference]: Finished difference Result 339515 states and 553181 transitions. [2019-09-08 10:08:19,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 10:08:19,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 272 [2019-09-08 10:08:19,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:08:20,095 INFO L225 Difference]: With dead ends: 339515 [2019-09-08 10:08:20,095 INFO L226 Difference]: Without dead ends: 305269 [2019-09-08 10:08:20,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 10:08:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305269 states. [2019-09-08 10:08:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305269 to 302936. [2019-09-08 10:08:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302936 states. [2019-09-08 10:08:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302936 states to 302936 states and 490956 transitions. [2019-09-08 10:08:52,403 INFO L78 Accepts]: Start accepts. Automaton has 302936 states and 490956 transitions. Word has length 272 [2019-09-08 10:08:52,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:08:52,404 INFO L475 AbstractCegarLoop]: Abstraction has 302936 states and 490956 transitions. [2019-09-08 10:08:52,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:08:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 302936 states and 490956 transitions. [2019-09-08 10:08:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 10:08:52,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:08:52,498 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:08:52,498 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:08:52,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:08:52,498 INFO L82 PathProgramCache]: Analyzing trace with hash 405955967, now seen corresponding path program 1 times [2019-09-08 10:08:52,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:08:52,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:08:52,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:52,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:08:52,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:08:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:08:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:08:52,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:08:52,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:08:52,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:08:52,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:08:52,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:08:52,639 INFO L87 Difference]: Start difference. First operand 302936 states and 490956 transitions. Second operand 3 states. [2019-09-08 10:09:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:09:25,795 INFO L93 Difference]: Finished difference Result 591105 states and 952326 transitions. [2019-09-08 10:09:25,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:09:25,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-09-08 10:09:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:09:26,430 INFO L225 Difference]: With dead ends: 591105 [2019-09-08 10:09:26,430 INFO L226 Difference]: Without dead ends: 359379 [2019-09-08 10:09:26,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:09:26,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359379 states. [2019-09-08 10:10:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359379 to 354857. [2019-09-08 10:10:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354857 states. [2019-09-08 10:10:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354857 states to 354857 states and 567297 transitions. [2019-09-08 10:10:01,901 INFO L78 Accepts]: Start accepts. Automaton has 354857 states and 567297 transitions. Word has length 282 [2019-09-08 10:10:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:10:01,901 INFO L475 AbstractCegarLoop]: Abstraction has 354857 states and 567297 transitions. [2019-09-08 10:10:01,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:10:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 354857 states and 567297 transitions. [2019-09-08 10:10:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-08 10:10:01,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:10:01,994 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:10:01,995 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:10:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:10:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash -873207398, now seen corresponding path program 1 times [2019-09-08 10:10:01,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:10:01,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:10:01,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:01,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:10:01,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:10:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:10:02,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:10:02,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:10:02,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:10:02,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:10:02,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:10:02,311 INFO L87 Difference]: Start difference. First operand 354857 states and 567297 transitions. Second operand 6 states. [2019-09-08 10:10:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:10:43,303 INFO L93 Difference]: Finished difference Result 701157 states and 1122496 transitions. [2019-09-08 10:10:43,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:10:43,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 283 [2019-09-08 10:10:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:10:44,009 INFO L225 Difference]: With dead ends: 701157 [2019-09-08 10:10:44,009 INFO L226 Difference]: Without dead ends: 450871 [2019-09-08 10:10:44,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:10:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450871 states. [2019-09-08 10:11:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450871 to 414352. [2019-09-08 10:11:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414352 states. [2019-09-08 10:11:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414352 states to 414352 states and 662422 transitions. [2019-09-08 10:11:26,056 INFO L78 Accepts]: Start accepts. Automaton has 414352 states and 662422 transitions. Word has length 283 [2019-09-08 10:11:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:11:26,057 INFO L475 AbstractCegarLoop]: Abstraction has 414352 states and 662422 transitions. [2019-09-08 10:11:26,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:11:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 414352 states and 662422 transitions. [2019-09-08 10:11:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-08 10:11:26,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:11:26,128 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:11:26,128 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:11:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:11:26,128 INFO L82 PathProgramCache]: Analyzing trace with hash 219415174, now seen corresponding path program 1 times [2019-09-08 10:11:26,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:11:26,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:11:26,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:26,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:11:26,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:11:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:11:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:11:26,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:11:26,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:11:26,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:11:26,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:11:26,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:11:26,450 INFO L87 Difference]: Start difference. First operand 414352 states and 662422 transitions. Second operand 6 states. [2019-09-08 10:12:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:12:24,313 INFO L93 Difference]: Finished difference Result 789497 states and 1265937 transitions. [2019-09-08 10:12:24,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:12:24,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 283 [2019-09-08 10:12:24,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:12:25,343 INFO L225 Difference]: With dead ends: 789497 [2019-09-08 10:12:25,343 INFO L226 Difference]: Without dead ends: 652489 [2019-09-08 10:12:25,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:12:26,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652489 states. [2019-09-08 10:13:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652489 to 461562. [2019-09-08 10:13:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461562 states. [2019-09-08 10:13:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461562 states to 461562 states and 738117 transitions. [2019-09-08 10:13:15,310 INFO L78 Accepts]: Start accepts. Automaton has 461562 states and 738117 transitions. Word has length 283 [2019-09-08 10:13:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:15,310 INFO L475 AbstractCegarLoop]: Abstraction has 461562 states and 738117 transitions. [2019-09-08 10:13:15,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:13:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 461562 states and 738117 transitions. [2019-09-08 10:13:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-08 10:13:15,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:15,397 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:13:15,397 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:15,398 INFO L82 PathProgramCache]: Analyzing trace with hash -628975310, now seen corresponding path program 1 times [2019-09-08 10:13:15,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:15,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:15,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:15,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:15,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:15,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:15,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:13:15,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:13:15,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:13:15,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:13:15,678 INFO L87 Difference]: Start difference. First operand 461562 states and 738117 transitions. Second operand 6 states.