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_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:37:10,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:37:10,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:37:11,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:37:11,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:37:11,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:37:11,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:37:11,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:37:11,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:37:11,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:37:11,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:37:11,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:37:11,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:37:11,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:37:11,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:37:11,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:37:11,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:37:11,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:37:11,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:37:11,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:37:11,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:37:11,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:37:11,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:37:11,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:37:11,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:37:11,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:37:11,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:37:11,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:37:11,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:37:11,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:37:11,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:37:11,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:37:11,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:37:11,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:37:11,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:37:11,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:37:11,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:37:11,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:37:11,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:37:11,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:37:11,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:37:11,083 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 13:37:11,104 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:37:11,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:37:11,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:37:11,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:37:11,107 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:37:11,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:37:11,107 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:37:11,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:37:11,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:37:11,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:37:11,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:37:11,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:37:11,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:37:11,110 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:37:11,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:37:11,110 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:37:11,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:37:11,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:37:11,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:37:11,111 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:37:11,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:37:11,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:37:11,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:37:11,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:37:11,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:37:11,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:37:11,112 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:37:11,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:37:11,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:37:11,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:37:11,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:37:11,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:37:11,188 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:37:11,189 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:37:11,189 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:37:11,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0a09bff/4540ea436ff4425a84a789d6fe0ef77c/FLAG9244c1a52 [2019-09-08 13:37:11,879 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:37:11,879 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:37:11,907 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0a09bff/4540ea436ff4425a84a789d6fe0ef77c/FLAG9244c1a52 [2019-09-08 13:37:11,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd0a09bff/4540ea436ff4425a84a789d6fe0ef77c [2019-09-08 13:37:12,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:37:12,010 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:37:12,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:37:12,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:37:12,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:37:12,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:37:12" (1/1) ... [2019-09-08 13:37:12,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8c2810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:12, skipping insertion in model container [2019-09-08 13:37:12,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:37:12" (1/1) ... [2019-09-08 13:37:12,026 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:37:12,217 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:37:13,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:37:13,840 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:37:15,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:37:15,075 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:37:15,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:15 WrapperNode [2019-09-08 13:37:15,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:37:15,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:37:15,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:37:15,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:37:15,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:15" (1/1) ... [2019-09-08 13:37:15,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:15" (1/1) ... [2019-09-08 13:37:15,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:15" (1/1) ... [2019-09-08 13:37:15,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:15" (1/1) ... [2019-09-08 13:37:15,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:15" (1/1) ... [2019-09-08 13:37:15,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:15" (1/1) ... [2019-09-08 13:37:15,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:15" (1/1) ... [2019-09-08 13:37:15,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:37:15,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:37:15,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:37:15,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:37:15,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:15" (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 13:37:15,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:37:15,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:37:15,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:37:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:37:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:37:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:37:15,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:37:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:37:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:37:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:37:15,354 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:37:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:37:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:37:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:37:15,355 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:37:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:37:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:37:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:37:15,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:37:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:37:15,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:37:19,797 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:37:19,798 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:37:19,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:37:19 BoogieIcfgContainer [2019-09-08 13:37:19,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:37:19,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:37:19,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:37:19,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:37:19,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:37:12" (1/3) ... [2019-09-08 13:37:19,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2395547f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:37:19, skipping insertion in model container [2019-09-08 13:37:19,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:37:15" (2/3) ... [2019-09-08 13:37:19,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2395547f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:37:19, skipping insertion in model container [2019-09-08 13:37:19,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:37:19" (3/3) ... [2019-09-08 13:37:19,807 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:37:19,817 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:37:19,826 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-08 13:37:19,842 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-08 13:37:19,880 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:37:19,880 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:37:19,881 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:37:19,881 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:37:19,881 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:37:19,881 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:37:19,881 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:37:19,881 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:37:19,882 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:37:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states. [2019-09-08 13:37:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-08 13:37:19,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:19,959 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:19,962 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:19,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:19,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1721455487, now seen corresponding path program 1 times [2019-09-08 13:37:19,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:19,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:20,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:20,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:20,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:22,424 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 13:37:22,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:22,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:37:22,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:37:22,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:37:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:37:22,447 INFO L87 Difference]: Start difference. First operand 1506 states. Second operand 4 states. [2019-09-08 13:37:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:23,014 INFO L93 Difference]: Finished difference Result 4460 states and 8053 transitions. [2019-09-08 13:37:23,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:37:23,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 493 [2019-09-08 13:37:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:23,063 INFO L225 Difference]: With dead ends: 4460 [2019-09-08 13:37:23,063 INFO L226 Difference]: Without dead ends: 2963 [2019-09-08 13:37:23,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 13:37:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2019-09-08 13:37:23,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2906. [2019-09-08 13:37:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2906 states. [2019-09-08 13:37:23,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 4772 transitions. [2019-09-08 13:37:23,380 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 4772 transitions. Word has length 493 [2019-09-08 13:37:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:23,385 INFO L475 AbstractCegarLoop]: Abstraction has 2906 states and 4772 transitions. [2019-09-08 13:37:23,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:37:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 4772 transitions. [2019-09-08 13:37:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-09-08 13:37:23,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:23,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:23,408 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:23,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:23,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1748288376, now seen corresponding path program 1 times [2019-09-08 13:37:23,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:23,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:23,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:23,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:23,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:24,276 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 13:37:24,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:24,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:24,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:24,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:24,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:24,283 INFO L87 Difference]: Start difference. First operand 2906 states and 4772 transitions. Second operand 3 states. [2019-09-08 13:37:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:24,654 INFO L93 Difference]: Finished difference Result 8439 states and 13819 transitions. [2019-09-08 13:37:24,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:24,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 495 [2019-09-08 13:37:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:24,686 INFO L225 Difference]: With dead ends: 8439 [2019-09-08 13:37:24,686 INFO L226 Difference]: Without dead ends: 5747 [2019-09-08 13:37:24,696 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 13:37:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5747 states. [2019-09-08 13:37:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5747 to 5692. [2019-09-08 13:37:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5692 states. [2019-09-08 13:37:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5692 states to 5692 states and 9324 transitions. [2019-09-08 13:37:24,984 INFO L78 Accepts]: Start accepts. Automaton has 5692 states and 9324 transitions. Word has length 495 [2019-09-08 13:37:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:24,986 INFO L475 AbstractCegarLoop]: Abstraction has 5692 states and 9324 transitions. [2019-09-08 13:37:24,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5692 states and 9324 transitions. [2019-09-08 13:37:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-08 13:37:25,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:25,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:25,012 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:25,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:25,014 INFO L82 PathProgramCache]: Analyzing trace with hash -457766112, now seen corresponding path program 1 times [2019-09-08 13:37:25,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:25,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:25,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:25,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:25,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:25,358 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 13:37:25,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:25,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:25,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:25,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:25,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:25,360 INFO L87 Difference]: Start difference. First operand 5692 states and 9324 transitions. Second operand 3 states. [2019-09-08 13:37:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:25,762 INFO L93 Difference]: Finished difference Result 16979 states and 27804 transitions. [2019-09-08 13:37:25,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:25,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-09-08 13:37:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:25,825 INFO L225 Difference]: With dead ends: 16979 [2019-09-08 13:37:25,834 INFO L226 Difference]: Without dead ends: 11339 [2019-09-08 13:37:25,851 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 13:37:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11339 states. [2019-09-08 13:37:26,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11339 to 5739. [2019-09-08 13:37:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5739 states. [2019-09-08 13:37:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5739 states to 5739 states and 9398 transitions. [2019-09-08 13:37:26,213 INFO L78 Accepts]: Start accepts. Automaton has 5739 states and 9398 transitions. Word has length 496 [2019-09-08 13:37:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:26,214 INFO L475 AbstractCegarLoop]: Abstraction has 5739 states and 9398 transitions. [2019-09-08 13:37:26,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:26,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5739 states and 9398 transitions. [2019-09-08 13:37:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-09-08 13:37:26,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:26,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:26,235 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:26,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:26,236 INFO L82 PathProgramCache]: Analyzing trace with hash 920522733, now seen corresponding path program 1 times [2019-09-08 13:37:26,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:26,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:26,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:26,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:26,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:26,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:26,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:26,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:26,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:26,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:26,836 INFO L87 Difference]: Start difference. First operand 5739 states and 9398 transitions. Second operand 3 states. [2019-09-08 13:37:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:27,427 INFO L93 Difference]: Finished difference Result 16541 states and 26991 transitions. [2019-09-08 13:37:27,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:27,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2019-09-08 13:37:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:27,480 INFO L225 Difference]: With dead ends: 16541 [2019-09-08 13:37:27,481 INFO L226 Difference]: Without dead ends: 11201 [2019-09-08 13:37:27,494 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 13:37:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11201 states. [2019-09-08 13:37:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11201 to 11148. [2019-09-08 13:37:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11148 states. [2019-09-08 13:37:27,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11148 states to 11148 states and 18172 transitions. [2019-09-08 13:37:27,934 INFO L78 Accepts]: Start accepts. Automaton has 11148 states and 18172 transitions. Word has length 497 [2019-09-08 13:37:27,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:27,935 INFO L475 AbstractCegarLoop]: Abstraction has 11148 states and 18172 transitions. [2019-09-08 13:37:27,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:27,935 INFO L276 IsEmpty]: Start isEmpty. Operand 11148 states and 18172 transitions. [2019-09-08 13:37:27,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-09-08 13:37:27,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:27,967 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:27,967 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:27,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:27,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1290800648, now seen corresponding path program 1 times [2019-09-08 13:37:27,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:27,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:27,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:27,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:27,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:37:28,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:28,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:28,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:28,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:28,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:28,806 INFO L87 Difference]: Start difference. First operand 11148 states and 18172 transitions. Second operand 3 states. [2019-09-08 13:37:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:29,443 INFO L93 Difference]: Finished difference Result 33188 states and 54071 transitions. [2019-09-08 13:37:29,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:29,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2019-09-08 13:37:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:29,505 INFO L225 Difference]: With dead ends: 33188 [2019-09-08 13:37:29,505 INFO L226 Difference]: Without dead ends: 22184 [2019-09-08 13:37:29,539 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 13:37:29,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22184 states. [2019-09-08 13:37:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22184 to 11246. [2019-09-08 13:37:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11246 states. [2019-09-08 13:37:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11246 states to 11246 states and 18323 transitions. [2019-09-08 13:37:30,100 INFO L78 Accepts]: Start accepts. Automaton has 11246 states and 18323 transitions. Word has length 497 [2019-09-08 13:37:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:30,101 INFO L475 AbstractCegarLoop]: Abstraction has 11246 states and 18323 transitions. [2019-09-08 13:37:30,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 11246 states and 18323 transitions. [2019-09-08 13:37:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2019-09-08 13:37:30,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:30,134 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:30,134 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:30,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:30,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2135163825, now seen corresponding path program 1 times [2019-09-08 13:37:30,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:30,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:30,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:30,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:30,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:30,491 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 13:37:30,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:30,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:30,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:30,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:30,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:30,493 INFO L87 Difference]: Start difference. First operand 11246 states and 18323 transitions. Second operand 3 states. [2019-09-08 13:37:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:31,486 INFO L93 Difference]: Finished difference Result 33323 states and 54252 transitions. [2019-09-08 13:37:31,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:31,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 498 [2019-09-08 13:37:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:31,568 INFO L225 Difference]: With dead ends: 33323 [2019-09-08 13:37:31,568 INFO L226 Difference]: Without dead ends: 22301 [2019-09-08 13:37:31,604 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 13:37:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22301 states. [2019-09-08 13:37:32,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22301 to 11363. [2019-09-08 13:37:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11363 states. [2019-09-08 13:37:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11363 states to 11363 states and 18469 transitions. [2019-09-08 13:37:32,268 INFO L78 Accepts]: Start accepts. Automaton has 11363 states and 18469 transitions. Word has length 498 [2019-09-08 13:37:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:32,269 INFO L475 AbstractCegarLoop]: Abstraction has 11363 states and 18469 transitions. [2019-09-08 13:37:32,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 11363 states and 18469 transitions. [2019-09-08 13:37:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-08 13:37:32,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:32,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:32,294 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:32,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:32,295 INFO L82 PathProgramCache]: Analyzing trace with hash 434343195, now seen corresponding path program 1 times [2019-09-08 13:37:32,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:32,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:32,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:32,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:32,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:32,848 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 13:37:32,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:32,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:32,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:32,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:32,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:32,851 INFO L87 Difference]: Start difference. First operand 11363 states and 18469 transitions. Second operand 3 states. [2019-09-08 13:37:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:33,833 INFO L93 Difference]: Finished difference Result 21947 states and 35242 transitions. [2019-09-08 13:37:33,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:33,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-09-08 13:37:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:33,890 INFO L225 Difference]: With dead ends: 21947 [2019-09-08 13:37:33,890 INFO L226 Difference]: Without dead ends: 15101 [2019-09-08 13:37:33,915 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 13:37:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15101 states. [2019-09-08 13:37:34,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15101 to 12963. [2019-09-08 13:37:34,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12963 states. [2019-09-08 13:37:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12963 states to 12963 states and 21117 transitions. [2019-09-08 13:37:34,635 INFO L78 Accepts]: Start accepts. Automaton has 12963 states and 21117 transitions. Word has length 499 [2019-09-08 13:37:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:34,635 INFO L475 AbstractCegarLoop]: Abstraction has 12963 states and 21117 transitions. [2019-09-08 13:37:34,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 12963 states and 21117 transitions. [2019-09-08 13:37:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-08 13:37:34,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:34,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:34,659 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:34,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:34,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1580825355, now seen corresponding path program 1 times [2019-09-08 13:37:34,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:34,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:34,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:34,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:34,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:35,475 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 13:37:35,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:35,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:37:35,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:37:35,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:37:35,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:37:35,478 INFO L87 Difference]: Start difference. First operand 12963 states and 21117 transitions. Second operand 4 states. [2019-09-08 13:37:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:36,369 INFO L93 Difference]: Finished difference Result 36830 states and 59765 transitions. [2019-09-08 13:37:36,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:37:36,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 499 [2019-09-08 13:37:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:36,441 INFO L225 Difference]: With dead ends: 36830 [2019-09-08 13:37:36,442 INFO L226 Difference]: Without dead ends: 25284 [2019-09-08 13:37:36,478 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 13:37:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25284 states. [2019-09-08 13:37:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25284 to 13898. [2019-09-08 13:37:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13898 states. [2019-09-08 13:37:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13898 states to 13898 states and 22765 transitions. [2019-09-08 13:37:38,017 INFO L78 Accepts]: Start accepts. Automaton has 13898 states and 22765 transitions. Word has length 499 [2019-09-08 13:37:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:38,017 INFO L475 AbstractCegarLoop]: Abstraction has 13898 states and 22765 transitions. [2019-09-08 13:37:38,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:37:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 13898 states and 22765 transitions. [2019-09-08 13:37:38,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-08 13:37:38,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:38,040 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:38,040 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:38,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1152436018, now seen corresponding path program 1 times [2019-09-08 13:37:38,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:38,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:38,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:38,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:38,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:38,557 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 13:37:38,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:38,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:38,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:38,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:38,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:38,559 INFO L87 Difference]: Start difference. First operand 13898 states and 22765 transitions. Second operand 3 states. [2019-09-08 13:37:39,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:39,626 INFO L93 Difference]: Finished difference Result 38762 states and 63244 transitions. [2019-09-08 13:37:39,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:39,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-09-08 13:37:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:39,675 INFO L225 Difference]: With dead ends: 38762 [2019-09-08 13:37:39,675 INFO L226 Difference]: Without dead ends: 26424 [2019-09-08 13:37:39,703 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 13:37:39,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26424 states. [2019-09-08 13:37:40,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26424 to 26373. [2019-09-08 13:37:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26373 states. [2019-09-08 13:37:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26373 states to 26373 states and 42965 transitions. [2019-09-08 13:37:40,778 INFO L78 Accepts]: Start accepts. Automaton has 26373 states and 42965 transitions. Word has length 499 [2019-09-08 13:37:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:40,778 INFO L475 AbstractCegarLoop]: Abstraction has 26373 states and 42965 transitions. [2019-09-08 13:37:40,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 26373 states and 42965 transitions. [2019-09-08 13:37:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-09-08 13:37:40,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:40,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:40,809 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:40,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:40,810 INFO L82 PathProgramCache]: Analyzing trace with hash 493143023, now seen corresponding path program 1 times [2019-09-08 13:37:40,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:40,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:40,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:40,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:40,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:41,361 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 13:37:41,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:41,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:41,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:41,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:41,364 INFO L87 Difference]: Start difference. First operand 26373 states and 42965 transitions. Second operand 3 states. [2019-09-08 13:37:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:42,660 INFO L93 Difference]: Finished difference Result 51401 states and 83026 transitions. [2019-09-08 13:37:42,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:42,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 501 [2019-09-08 13:37:42,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:42,702 INFO L225 Difference]: With dead ends: 51401 [2019-09-08 13:37:42,702 INFO L226 Difference]: Without dead ends: 35617 [2019-09-08 13:37:42,721 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 13:37:42,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35617 states. [2019-09-08 13:37:43,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35617 to 32085. [2019-09-08 13:37:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32085 states. [2019-09-08 13:37:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32085 states to 32085 states and 52405 transitions. [2019-09-08 13:37:43,989 INFO L78 Accepts]: Start accepts. Automaton has 32085 states and 52405 transitions. Word has length 501 [2019-09-08 13:37:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:43,990 INFO L475 AbstractCegarLoop]: Abstraction has 32085 states and 52405 transitions. [2019-09-08 13:37:43,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:37:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 32085 states and 52405 transitions. [2019-09-08 13:37:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-08 13:37:44,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:44,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:44,016 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:44,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:44,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1370211641, now seen corresponding path program 1 times [2019-09-08 13:37:44,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:44,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:44,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:44,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:44,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:45,688 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 13:37:45,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:45,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:37:45,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:37:45,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:37:45,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:37:45,692 INFO L87 Difference]: Start difference. First operand 32085 states and 52405 transitions. Second operand 4 states. [2019-09-08 13:37:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:48,835 INFO L93 Difference]: Finished difference Result 94407 states and 154228 transitions. [2019-09-08 13:37:48,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:37:48,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 502 [2019-09-08 13:37:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:48,923 INFO L225 Difference]: With dead ends: 94407 [2019-09-08 13:37:48,923 INFO L226 Difference]: Without dead ends: 62585 [2019-09-08 13:37:48,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 13:37:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62585 states. [2019-09-08 13:37:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62585 to 62540. [2019-09-08 13:37:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62540 states. [2019-09-08 13:37:51,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62540 states to 62540 states and 101772 transitions. [2019-09-08 13:37:51,586 INFO L78 Accepts]: Start accepts. Automaton has 62540 states and 101772 transitions. Word has length 502 [2019-09-08 13:37:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:37:51,587 INFO L475 AbstractCegarLoop]: Abstraction has 62540 states and 101772 transitions. [2019-09-08 13:37:51,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:37:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 62540 states and 101772 transitions. [2019-09-08 13:37:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2019-09-08 13:37:51,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:37:51,637 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:51,637 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:37:51,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:37:51,638 INFO L82 PathProgramCache]: Analyzing trace with hash 68937512, now seen corresponding path program 1 times [2019-09-08 13:37:51,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:37:51,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:37:51,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:51,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:37:51,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:37:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:37:52,146 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 13:37:52,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:37:52,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:37:52,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:37:52,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:37:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:37:52,150 INFO L87 Difference]: Start difference. First operand 62540 states and 101772 transitions. Second operand 3 states. [2019-09-08 13:37:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:37:58,207 INFO L93 Difference]: Finished difference Result 181075 states and 293905 transitions. [2019-09-08 13:37:58,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:37:58,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 504 [2019-09-08 13:37:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:37:58,353 INFO L225 Difference]: With dead ends: 181075 [2019-09-08 13:37:58,354 INFO L226 Difference]: Without dead ends: 122103 [2019-09-08 13:37:58,429 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 13:37:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122103 states. [2019-09-08 13:38:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122103 to 122060. [2019-09-08 13:38:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122060 states. [2019-09-08 13:38:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122060 states to 122060 states and 197735 transitions. [2019-09-08 13:38:03,653 INFO L78 Accepts]: Start accepts. Automaton has 122060 states and 197735 transitions. Word has length 504 [2019-09-08 13:38:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:03,653 INFO L475 AbstractCegarLoop]: Abstraction has 122060 states and 197735 transitions. [2019-09-08 13:38:03,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:38:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 122060 states and 197735 transitions. [2019-09-08 13:38:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2019-09-08 13:38:03,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:03,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:03,726 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:03,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:03,727 INFO L82 PathProgramCache]: Analyzing trace with hash -252481168, now seen corresponding path program 1 times [2019-09-08 13:38:03,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:03,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:03,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:03,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:03,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:04,053 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 13:38:04,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:04,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:38:04,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:38:04,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:38:04,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:38:04,055 INFO L87 Difference]: Start difference. First operand 122060 states and 197735 transitions. Second operand 3 states. [2019-09-08 13:38:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:14,949 INFO L93 Difference]: Finished difference Result 345494 states and 556425 transitions. [2019-09-08 13:38:14,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:38:14,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 504 [2019-09-08 13:38:14,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:15,251 INFO L225 Difference]: With dead ends: 345494 [2019-09-08 13:38:15,251 INFO L226 Difference]: Without dead ends: 233926 [2019-09-08 13:38:15,362 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 13:38:15,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233926 states. [2019-09-08 13:38:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233926 to 123822. [2019-09-08 13:38:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123822 states. [2019-09-08 13:38:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123822 states to 123822 states and 200393 transitions. [2019-09-08 13:38:24,658 INFO L78 Accepts]: Start accepts. Automaton has 123822 states and 200393 transitions. Word has length 504 [2019-09-08 13:38:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:24,659 INFO L475 AbstractCegarLoop]: Abstraction has 123822 states and 200393 transitions. [2019-09-08 13:38:24,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:38:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand 123822 states and 200393 transitions. [2019-09-08 13:38:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-09-08 13:38:24,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:24,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:24,744 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:24,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:24,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1705109268, now seen corresponding path program 1 times [2019-09-08 13:38:24,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:24,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:24,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:24,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:24,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:25,086 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 13:38:25,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:25,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:38:25,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:38:25,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:38:25,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:38:25,088 INFO L87 Difference]: Start difference. First operand 123822 states and 200393 transitions. Second operand 3 states. [2019-09-08 13:38:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:38:35,297 INFO L93 Difference]: Finished difference Result 260070 states and 420442 transitions. [2019-09-08 13:38:35,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:38:35,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 505 [2019-09-08 13:38:35,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:38:35,515 INFO L225 Difference]: With dead ends: 260070 [2019-09-08 13:38:35,515 INFO L226 Difference]: Without dead ends: 177870 [2019-09-08 13:38:35,596 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 13:38:35,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177870 states. [2019-09-08 13:38:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177870 to 164078. [2019-09-08 13:38:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164078 states. [2019-09-08 13:38:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164078 states to 164078 states and 266537 transitions. [2019-09-08 13:38:46,758 INFO L78 Accepts]: Start accepts. Automaton has 164078 states and 266537 transitions. Word has length 505 [2019-09-08 13:38:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:38:46,759 INFO L475 AbstractCegarLoop]: Abstraction has 164078 states and 266537 transitions. [2019-09-08 13:38:46,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:38:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 164078 states and 266537 transitions. [2019-09-08 13:38:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-09-08 13:38:46,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:38:46,832 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:38:46,832 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:38:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:38:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1657302847, now seen corresponding path program 1 times [2019-09-08 13:38:46,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:38:46,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:38:46,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:46,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:38:46,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:38:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:38:47,115 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 13:38:47,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:38:47,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:38:47,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:38:47,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:38:47,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:38:47,117 INFO L87 Difference]: Start difference. First operand 164078 states and 266537 transitions. Second operand 3 states. [2019-09-08 13:39:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:06,355 INFO L93 Difference]: Finished difference Result 469136 states and 758956 transitions. [2019-09-08 13:39:06,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:06,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 505 [2019-09-08 13:39:06,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:06,837 INFO L225 Difference]: With dead ends: 469136 [2019-09-08 13:39:06,837 INFO L226 Difference]: Without dead ends: 316860 [2019-09-08 13:39:07,006 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 13:39:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316860 states. [2019-09-08 13:39:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316860 to 166628. [2019-09-08 13:39:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166628 states. [2019-09-08 13:39:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166628 states to 166628 states and 270206 transitions. [2019-09-08 13:39:17,069 INFO L78 Accepts]: Start accepts. Automaton has 166628 states and 270206 transitions. Word has length 505 [2019-09-08 13:39:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:39:17,069 INFO L475 AbstractCegarLoop]: Abstraction has 166628 states and 270206 transitions. [2019-09-08 13:39:17,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:39:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 166628 states and 270206 transitions. [2019-09-08 13:39:17,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2019-09-08 13:39:17,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:39:17,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:39:17,157 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:39:17,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:39:17,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1317208899, now seen corresponding path program 1 times [2019-09-08 13:39:17,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:39:17,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:39:17,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:17,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:39:17,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:39:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:39:17,712 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 13:39:17,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:39:17,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:39:17,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:39:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:39:17,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:39:17,715 INFO L87 Difference]: Start difference. First operand 166628 states and 270206 transitions. Second operand 3 states. [2019-09-08 13:39:37,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:39:37,871 INFO L93 Difference]: Finished difference Result 491373 states and 796356 transitions. [2019-09-08 13:39:37,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:39:37,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 506 [2019-09-08 13:39:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:39:38,734 INFO L225 Difference]: With dead ends: 491373 [2019-09-08 13:39:38,735 INFO L226 Difference]: Without dead ends: 328759 [2019-09-08 13:39:38,869 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 13:39:39,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328759 states. [2019-09-08 13:40:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328759 to 328718. [2019-09-08 13:40:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328718 states. [2019-09-08 13:40:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328718 states to 328718 states and 531250 transitions. [2019-09-08 13:40:03,287 INFO L78 Accepts]: Start accepts. Automaton has 328718 states and 531250 transitions. Word has length 506 [2019-09-08 13:40:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:03,288 INFO L475 AbstractCegarLoop]: Abstraction has 328718 states and 531250 transitions. [2019-09-08 13:40:03,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 328718 states and 531250 transitions. [2019-09-08 13:40:03,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-08 13:40:03,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:03,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:40:03,459 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:03,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:03,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1780361346, now seen corresponding path program 1 times [2019-09-08 13:40:03,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:03,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:03,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:03,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:03,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:03,889 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 13:40:03,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:03,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:03,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:03,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:03,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:03,891 INFO L87 Difference]: Start difference. First operand 328718 states and 531250 transitions. Second operand 3 states. [2019-09-08 13:40:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:49,554 INFO L93 Difference]: Finished difference Result 963083 states and 1554326 transitions. [2019-09-08 13:40:49,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:49,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 508 [2019-09-08 13:40:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:50,622 INFO L225 Difference]: With dead ends: 963083 [2019-09-08 13:40:50,622 INFO L226 Difference]: Without dead ends: 645502 [2019-09-08 13:40:50,952 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 13:40:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645502 states. [2019-09-08 13:41:36,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645502 to 645463. [2019-09-08 13:41:36,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645463 states. [2019-09-08 13:41:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645463 states to 645463 states and 1039025 transitions. [2019-09-08 13:41:38,530 INFO L78 Accepts]: Start accepts. Automaton has 645463 states and 1039025 transitions. Word has length 508 [2019-09-08 13:41:38,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:41:38,530 INFO L475 AbstractCegarLoop]: Abstraction has 645463 states and 1039025 transitions. [2019-09-08 13:41:38,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:41:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 645463 states and 1039025 transitions. [2019-09-08 13:41:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-08 13:41:38,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:41:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:38,889 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:41:38,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:41:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1512920997, now seen corresponding path program 1 times [2019-09-08 13:41:38,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:41:38,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:41:38,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:38,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:41:38,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:41:39,500 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 13:41:39,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:41:39,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:41:39,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:41:39,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:41:39,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:41:39,502 INFO L87 Difference]: Start difference. First operand 645463 states and 1039025 transitions. Second operand 4 states. [2019-09-08 13:43:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:43:17,849 INFO L93 Difference]: Finished difference Result 1819512 states and 2921521 transitions. [2019-09-08 13:43:17,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:43:17,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 508 [2019-09-08 13:43:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:43:19,832 INFO L225 Difference]: With dead ends: 1819512 [2019-09-08 13:43:19,833 INFO L226 Difference]: Without dead ends: 1209821 [2019-09-08 13:43:20,317 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 13:43:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209821 states. [2019-09-08 13:44:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209821 to 660161. [2019-09-08 13:44:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660161 states. [2019-09-08 13:44:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660161 states to 660161 states and 1065026 transitions. [2019-09-08 13:44:25,475 INFO L78 Accepts]: Start accepts. Automaton has 660161 states and 1065026 transitions. Word has length 508 [2019-09-08 13:44:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:44:25,476 INFO L475 AbstractCegarLoop]: Abstraction has 660161 states and 1065026 transitions. [2019-09-08 13:44:25,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:44:25,476 INFO L276 IsEmpty]: Start isEmpty. Operand 660161 states and 1065026 transitions. [2019-09-08 13:44:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-09-08 13:44:25,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:44:25,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:44:25,901 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:44:25,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:44:25,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1373317365, now seen corresponding path program 1 times [2019-09-08 13:44:25,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:44:25,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:44:25,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:44:25,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:44:25,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:44:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:44:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:44:26,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:44:26,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:44:26,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:44:26,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:44:26,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:44:26,177 INFO L87 Difference]: Start difference. First operand 660161 states and 1065026 transitions. Second operand 3 states. [2019-09-08 13:45:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:45:54,484 INFO L93 Difference]: Finished difference Result 1512071 states and 2441075 transitions. [2019-09-08 13:45:54,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:45:54,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 510 [2019-09-08 13:45:54,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:45:56,080 INFO L225 Difference]: With dead ends: 1512071 [2019-09-08 13:45:56,080 INFO L226 Difference]: Without dead ends: 1023907 [2019-09-08 13:45:56,489 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 13:45:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023907 states. [2019-09-08 13:47:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023907 to 945601. [2019-09-08 13:47:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945601 states. [2019-09-08 13:47:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945601 states to 945601 states and 1534658 transitions. [2019-09-08 13:47:17,827 INFO L78 Accepts]: Start accepts. Automaton has 945601 states and 1534658 transitions. Word has length 510 [2019-09-08 13:47:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:47:17,827 INFO L475 AbstractCegarLoop]: Abstraction has 945601 states and 1534658 transitions. [2019-09-08 13:47:17,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:47:17,828 INFO L276 IsEmpty]: Start isEmpty. Operand 945601 states and 1534658 transitions. [2019-09-08 13:47:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-09-08 13:47:18,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:47:18,204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:47:18,204 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:47:18,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:47:18,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1277584190, now seen corresponding path program 1 times [2019-09-08 13:47:18,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:47:18,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:47:18,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:47:18,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:47:18,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:47:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:47:31,797 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 13:47:31,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:47:31,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:47:31,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:47:31,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:47:31,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:47:31,799 INFO L87 Difference]: Start difference. First operand 945601 states and 1534658 transitions. Second operand 9 states.