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.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:26:07,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:26:07,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:26:07,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:26:07,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:26:07,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:26:07,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:26:07,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:26:07,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:26:07,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:26:07,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:26:07,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:26:07,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:26:07,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:26:07,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:26:07,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:26:07,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:26:07,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:26:07,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:26:07,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:26:07,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:26:07,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:26:07,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:26:07,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:26:07,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:26:07,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:26:07,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:26:07,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:26:07,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:26:07,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:26:07,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:26:07,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:26:07,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:26:07,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:26:07,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:26:07,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:26:07,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:26:07,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:26:07,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:26:07,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:26:07,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:26:07,072 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:26:07,099 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:26:07,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:26:07,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:26:07,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:26:07,102 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:26:07,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:26:07,103 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:26:07,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:26:07,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:26:07,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:26:07,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:26:07,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:26:07,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:26:07,106 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:26:07,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:26:07,106 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:26:07,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:26:07,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:26:07,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:26:07,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:26:07,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:26:07,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:26:07,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:26:07,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:26:07,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:26:07,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:26:07,109 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:26:07,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:26:07,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:26:07,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:26:07,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:26:07,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:26:07,190 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:26:07,190 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:26:07,191 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.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:26:07,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd165575/8166a99663d2497b9a281cc195e0de8d/FLAGf7fc80157 [2019-09-08 13:26:08,000 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:26:08,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:26:08,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd165575/8166a99663d2497b9a281cc195e0de8d/FLAGf7fc80157 [2019-09-08 13:26:08,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd165575/8166a99663d2497b9a281cc195e0de8d [2019-09-08 13:26:08,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:26:08,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:26:08,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:26:08,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:26:08,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:26:08,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:26:08" (1/1) ... [2019-09-08 13:26:08,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2127733b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:08, skipping insertion in model container [2019-09-08 13:26:08,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:26:08" (1/1) ... [2019-09-08 13:26:08,131 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:26:08,294 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:26:09,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:26:09,736 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:26:10,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:26:10,770 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:26:10,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:10 WrapperNode [2019-09-08 13:26:10,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:26:10,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:26:10,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:26:10,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:26:10,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:10" (1/1) ... [2019-09-08 13:26:10,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:10" (1/1) ... [2019-09-08 13:26:10,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:10" (1/1) ... [2019-09-08 13:26:10,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:10" (1/1) ... [2019-09-08 13:26:10,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:10" (1/1) ... [2019-09-08 13:26:10,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:10" (1/1) ... [2019-09-08 13:26:10,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:10" (1/1) ... [2019-09-08 13:26:11,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:26:11,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:26:11,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:26:11,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:26:11,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:10" (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:26:11,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:26:11,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:26:11,094 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:26:11,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:26:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:26:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:26:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:26:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:26:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:26:11,096 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:26:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:26:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:26:11,097 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:26:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:26:11,098 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:26:11,099 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:26:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:26:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:26:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:26:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:26:14,534 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:26:14,534 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:26:14,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:26:14 BoogieIcfgContainer [2019-09-08 13:26:14,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:26:14,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:26:14,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:26:14,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:26:14,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:26:08" (1/3) ... [2019-09-08 13:26:14,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da5766e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:26:14, skipping insertion in model container [2019-09-08 13:26:14,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:10" (2/3) ... [2019-09-08 13:26:14,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da5766e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:26:14, skipping insertion in model container [2019-09-08 13:26:14,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:26:14" (3/3) ... [2019-09-08 13:26:14,545 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 13:26:14,556 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:26:14,567 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 13:26:14,587 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 13:26:14,635 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:26:14,636 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:26:14,636 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:26:14,636 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:26:14,636 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:26:14,636 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:26:14,637 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:26:14,637 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:26:14,637 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:26:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states. [2019-09-08 13:26:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:26:14,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:14,713 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] [2019-09-08 13:26:14,715 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:14,722 INFO L82 PathProgramCache]: Analyzing trace with hash -746248007, now seen corresponding path program 1 times [2019-09-08 13:26:14,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:14,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:14,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:15,751 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:26:15,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:15,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:15,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:15,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:15,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:15,775 INFO L87 Difference]: Start difference. First operand 997 states. Second operand 3 states. [2019-09-08 13:26:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:16,090 INFO L93 Difference]: Finished difference Result 1737 states and 3083 transitions. [2019-09-08 13:26:16,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:16,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 13:26:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:16,126 INFO L225 Difference]: With dead ends: 1737 [2019-09-08 13:26:16,127 INFO L226 Difference]: Without dead ends: 1431 [2019-09-08 13:26:16,139 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:26:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-09-08 13:26:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1429. [2019-09-08 13:26:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-09-08 13:26:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2185 transitions. [2019-09-08 13:26:16,361 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2185 transitions. Word has length 320 [2019-09-08 13:26:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:16,368 INFO L475 AbstractCegarLoop]: Abstraction has 1429 states and 2185 transitions. [2019-09-08 13:26:16,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2185 transitions. [2019-09-08 13:26:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:26:16,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:16,384 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] [2019-09-08 13:26:16,385 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:16,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:16,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1357486743, now seen corresponding path program 1 times [2019-09-08 13:26:16,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:16,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:16,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:16,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:16,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:16,778 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:26:16,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:16,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:16,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:16,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:16,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:16,784 INFO L87 Difference]: Start difference. First operand 1429 states and 2185 transitions. Second operand 3 states. [2019-09-08 13:26:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:17,036 INFO L93 Difference]: Finished difference Result 2740 states and 4241 transitions. [2019-09-08 13:26:17,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:17,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 13:26:17,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:17,053 INFO L225 Difference]: With dead ends: 2740 [2019-09-08 13:26:17,054 INFO L226 Difference]: Without dead ends: 2305 [2019-09-08 13:26:17,058 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:26:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2019-09-08 13:26:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2303. [2019-09-08 13:26:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2303 states. [2019-09-08 13:26:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 3541 transitions. [2019-09-08 13:26:17,191 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 3541 transitions. Word has length 320 [2019-09-08 13:26:17,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:17,193 INFO L475 AbstractCegarLoop]: Abstraction has 2303 states and 3541 transitions. [2019-09-08 13:26:17,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 3541 transitions. [2019-09-08 13:26:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:26:17,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:17,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:17,211 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash -387626201, now seen corresponding path program 1 times [2019-09-08 13:26:17,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:17,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:17,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:17,750 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:26:17,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:17,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:17,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:17,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:17,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:17,752 INFO L87 Difference]: Start difference. First operand 2303 states and 3541 transitions. Second operand 3 states. [2019-09-08 13:26:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:18,119 INFO L93 Difference]: Finished difference Result 4778 states and 7446 transitions. [2019-09-08 13:26:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:18,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 13:26:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:18,141 INFO L225 Difference]: With dead ends: 4778 [2019-09-08 13:26:18,142 INFO L226 Difference]: Without dead ends: 4105 [2019-09-08 13:26:18,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2019-09-08 13:26:18,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 4103. [2019-09-08 13:26:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4103 states. [2019-09-08 13:26:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4103 states to 4103 states and 6333 transitions. [2019-09-08 13:26:18,283 INFO L78 Accepts]: Start accepts. Automaton has 4103 states and 6333 transitions. Word has length 320 [2019-09-08 13:26:18,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:18,284 INFO L475 AbstractCegarLoop]: Abstraction has 4103 states and 6333 transitions. [2019-09-08 13:26:18,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 6333 transitions. [2019-09-08 13:26:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:26:18,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:18,295 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] [2019-09-08 13:26:18,296 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:18,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:18,297 INFO L82 PathProgramCache]: Analyzing trace with hash -387964825, now seen corresponding path program 1 times [2019-09-08 13:26:18,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:18,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:18,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:18,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:18,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:19,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:26:19,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:19,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:26:19,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:26:19,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:26:19,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:26:19,117 INFO L87 Difference]: Start difference. First operand 4103 states and 6333 transitions. Second operand 4 states. [2019-09-08 13:26:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:19,545 INFO L93 Difference]: Finished difference Result 12166 states and 18760 transitions. [2019-09-08 13:26:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:26:19,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-08 13:26:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:19,587 INFO L225 Difference]: With dead ends: 12166 [2019-09-08 13:26:19,587 INFO L226 Difference]: Without dead ends: 8078 [2019-09-08 13:26:19,602 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:26:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8078 states. [2019-09-08 13:26:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8078 to 7907. [2019-09-08 13:26:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7907 states. [2019-09-08 13:26:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7907 states to 7907 states and 12176 transitions. [2019-09-08 13:26:20,121 INFO L78 Accepts]: Start accepts. Automaton has 7907 states and 12176 transitions. Word has length 320 [2019-09-08 13:26:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:20,122 INFO L475 AbstractCegarLoop]: Abstraction has 7907 states and 12176 transitions. [2019-09-08 13:26:20,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:26:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 7907 states and 12176 transitions. [2019-09-08 13:26:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:26:20,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:20,141 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] [2019-09-08 13:26:20,142 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:20,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:20,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1741428615, now seen corresponding path program 1 times [2019-09-08 13:26:20,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:20,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:20,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:20,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:20,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:20,419 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:26:20,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:20,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:20,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:20,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:20,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:20,422 INFO L87 Difference]: Start difference. First operand 7907 states and 12176 transitions. Second operand 3 states. [2019-09-08 13:26:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:20,993 INFO L93 Difference]: Finished difference Result 23270 states and 35764 transitions. [2019-09-08 13:26:21,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:21,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 13:26:21,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:21,180 INFO L225 Difference]: With dead ends: 23270 [2019-09-08 13:26:21,180 INFO L226 Difference]: Without dead ends: 15492 [2019-09-08 13:26:21,200 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:26:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15492 states. [2019-09-08 13:26:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15492 to 15321. [2019-09-08 13:26:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15321 states. [2019-09-08 13:26:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15321 states to 15321 states and 23481 transitions. [2019-09-08 13:26:21,739 INFO L78 Accepts]: Start accepts. Automaton has 15321 states and 23481 transitions. Word has length 322 [2019-09-08 13:26:21,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:21,740 INFO L475 AbstractCegarLoop]: Abstraction has 15321 states and 23481 transitions. [2019-09-08 13:26:21,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:21,740 INFO L276 IsEmpty]: Start isEmpty. Operand 15321 states and 23481 transitions. [2019-09-08 13:26:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:26:21,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:21,772 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] [2019-09-08 13:26:21,773 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:21,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:21,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1240919436, now seen corresponding path program 1 times [2019-09-08 13:26:21,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:21,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:21,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:21,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:21,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:21,923 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:26:21,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:21,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:21,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:21,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:21,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:21,925 INFO L87 Difference]: Start difference. First operand 15321 states and 23481 transitions. Second operand 3 states. [2019-09-08 13:26:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:22,773 INFO L93 Difference]: Finished difference Result 45888 states and 70319 transitions. [2019-09-08 13:26:22,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:22,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 13:26:22,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:22,858 INFO L225 Difference]: With dead ends: 45888 [2019-09-08 13:26:22,858 INFO L226 Difference]: Without dead ends: 30609 [2019-09-08 13:26:22,898 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:26:22,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30609 states. [2019-09-08 13:26:23,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30609 to 15340. [2019-09-08 13:26:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15340 states. [2019-09-08 13:26:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15340 states to 15340 states and 23509 transitions. [2019-09-08 13:26:24,548 INFO L78 Accepts]: Start accepts. Automaton has 15340 states and 23509 transitions. Word has length 322 [2019-09-08 13:26:24,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:24,549 INFO L475 AbstractCegarLoop]: Abstraction has 15340 states and 23509 transitions. [2019-09-08 13:26:24,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 15340 states and 23509 transitions. [2019-09-08 13:26:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-08 13:26:24,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:24,580 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] [2019-09-08 13:26:24,580 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:24,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:24,581 INFO L82 PathProgramCache]: Analyzing trace with hash 543705657, now seen corresponding path program 1 times [2019-09-08 13:26:24,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:24,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:24,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:24,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:24,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:24,744 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:26:24,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:24,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:24,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:24,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:24,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:24,747 INFO L87 Difference]: Start difference. First operand 15340 states and 23509 transitions. Second operand 3 states. [2019-09-08 13:26:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:25,464 INFO L93 Difference]: Finished difference Result 45907 states and 70340 transitions. [2019-09-08 13:26:25,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:25,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-08 13:26:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:25,555 INFO L225 Difference]: With dead ends: 45907 [2019-09-08 13:26:25,555 INFO L226 Difference]: Without dead ends: 30627 [2019-09-08 13:26:25,605 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:26:25,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30627 states. [2019-09-08 13:26:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30627 to 15358. [2019-09-08 13:26:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15358 states. [2019-09-08 13:26:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15358 states to 15358 states and 23530 transitions. [2019-09-08 13:26:26,518 INFO L78 Accepts]: Start accepts. Automaton has 15358 states and 23530 transitions. Word has length 323 [2019-09-08 13:26:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:26,518 INFO L475 AbstractCegarLoop]: Abstraction has 15358 states and 23530 transitions. [2019-09-08 13:26:26,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 15358 states and 23530 transitions. [2019-09-08 13:26:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:26:26,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:26,544 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] [2019-09-08 13:26:26,545 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:26,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:26,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2007449599, now seen corresponding path program 1 times [2019-09-08 13:26:26,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:26,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:26,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:26,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:26,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:26,905 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:26:26,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:26,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:26:26,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:26:26,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:26:26,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:26:26,908 INFO L87 Difference]: Start difference. First operand 15358 states and 23530 transitions. Second operand 4 states. [2019-09-08 13:26:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:27,787 INFO L93 Difference]: Finished difference Result 45583 states and 69745 transitions. [2019-09-08 13:26:27,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:26:27,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-08 13:26:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:27,872 INFO L225 Difference]: With dead ends: 45583 [2019-09-08 13:26:27,873 INFO L226 Difference]: Without dead ends: 30554 [2019-09-08 13:26:27,917 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:26:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30554 states. [2019-09-08 13:26:28,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30554 to 15565. [2019-09-08 13:26:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15565 states. [2019-09-08 13:26:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15565 states to 15565 states and 23883 transitions. [2019-09-08 13:26:28,720 INFO L78 Accepts]: Start accepts. Automaton has 15565 states and 23883 transitions. Word has length 324 [2019-09-08 13:26:28,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:28,720 INFO L475 AbstractCegarLoop]: Abstraction has 15565 states and 23883 transitions. [2019-09-08 13:26:28,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:26:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 15565 states and 23883 transitions. [2019-09-08 13:26:28,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:26:28,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:28,742 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] [2019-09-08 13:26:28,743 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:28,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:28,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1304795810, now seen corresponding path program 1 times [2019-09-08 13:26:28,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:28,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:28,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:28,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:28,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:29,065 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:26:29,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:29,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:29,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:29,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:29,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:29,068 INFO L87 Difference]: Start difference. First operand 15565 states and 23883 transitions. Second operand 3 states. [2019-09-08 13:26:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:29,975 INFO L93 Difference]: Finished difference Result 43713 states and 66855 transitions. [2019-09-08 13:26:29,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:29,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:26:29,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:30,037 INFO L225 Difference]: With dead ends: 43713 [2019-09-08 13:26:30,037 INFO L226 Difference]: Without dead ends: 28568 [2019-09-08 13:26:30,070 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:26:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28568 states. [2019-09-08 13:26:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28568 to 28397. [2019-09-08 13:26:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28397 states. [2019-09-08 13:26:31,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28397 states to 28397 states and 43246 transitions. [2019-09-08 13:26:31,366 INFO L78 Accepts]: Start accepts. Automaton has 28397 states and 43246 transitions. Word has length 324 [2019-09-08 13:26:31,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:31,367 INFO L475 AbstractCegarLoop]: Abstraction has 28397 states and 43246 transitions. [2019-09-08 13:26:31,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:31,367 INFO L276 IsEmpty]: Start isEmpty. Operand 28397 states and 43246 transitions. [2019-09-08 13:26:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 13:26:31,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:31,392 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] [2019-09-08 13:26:31,393 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:31,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:31,393 INFO L82 PathProgramCache]: Analyzing trace with hash 901762143, now seen corresponding path program 1 times [2019-09-08 13:26:31,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:31,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:31,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:31,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:31,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:31,586 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:26:31,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:31,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:31,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:31,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:31,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:31,588 INFO L87 Difference]: Start difference. First operand 28397 states and 43246 transitions. Second operand 3 states. [2019-09-08 13:26:33,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:33,619 INFO L93 Difference]: Finished difference Result 67873 states and 104384 transitions. [2019-09-08 13:26:33,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:33,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-08 13:26:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:33,688 INFO L225 Difference]: With dead ends: 67873 [2019-09-08 13:26:33,688 INFO L226 Difference]: Without dead ends: 41231 [2019-09-08 13:26:33,731 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:26:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41231 states. [2019-09-08 13:26:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41231 to 35869. [2019-09-08 13:26:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35869 states. [2019-09-08 13:26:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35869 states to 35869 states and 55564 transitions. [2019-09-08 13:26:35,253 INFO L78 Accepts]: Start accepts. Automaton has 35869 states and 55564 transitions. Word has length 325 [2019-09-08 13:26:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:35,254 INFO L475 AbstractCegarLoop]: Abstraction has 35869 states and 55564 transitions. [2019-09-08 13:26:35,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:35,254 INFO L276 IsEmpty]: Start isEmpty. Operand 35869 states and 55564 transitions. [2019-09-08 13:26:35,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:26:35,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:35,273 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] [2019-09-08 13:26:35,274 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:35,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:35,274 INFO L82 PathProgramCache]: Analyzing trace with hash 642945536, now seen corresponding path program 1 times [2019-09-08 13:26:35,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:35,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:35,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:35,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:35,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:35,445 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:26:35,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:35,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:35,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:35,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:35,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:35,446 INFO L87 Difference]: Start difference. First operand 35869 states and 55564 transitions. Second operand 3 states. [2019-09-08 13:26:37,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:37,694 INFO L93 Difference]: Finished difference Result 106037 states and 163973 transitions. [2019-09-08 13:26:37,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:37,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:26:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:37,813 INFO L225 Difference]: With dead ends: 106037 [2019-09-08 13:26:37,813 INFO L226 Difference]: Without dead ends: 70971 [2019-09-08 13:26:37,873 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:26:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70971 states. [2019-09-08 13:26:40,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70971 to 35973. [2019-09-08 13:26:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35973 states. [2019-09-08 13:26:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35973 states to 35973 states and 55707 transitions. [2019-09-08 13:26:40,708 INFO L78 Accepts]: Start accepts. Automaton has 35973 states and 55707 transitions. Word has length 326 [2019-09-08 13:26:40,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:40,708 INFO L475 AbstractCegarLoop]: Abstraction has 35973 states and 55707 transitions. [2019-09-08 13:26:40,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 35973 states and 55707 transitions. [2019-09-08 13:26:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:26:40,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:40,735 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] [2019-09-08 13:26:40,735 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:40,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash 512545709, now seen corresponding path program 1 times [2019-09-08 13:26:40,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:40,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:40,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:40,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:40,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:40,917 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:26:40,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:40,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:40,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:40,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:40,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:40,920 INFO L87 Difference]: Start difference. First operand 35973 states and 55707 transitions. Second operand 3 states. [2019-09-08 13:26:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:43,527 INFO L93 Difference]: Finished difference Result 106169 states and 164139 transitions. [2019-09-08 13:26:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:43,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-08 13:26:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:43,618 INFO L225 Difference]: With dead ends: 106169 [2019-09-08 13:26:43,618 INFO L226 Difference]: Without dead ends: 71096 [2019-09-08 13:26:43,678 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:26:43,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71096 states. [2019-09-08 13:26:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71096 to 36098. [2019-09-08 13:26:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36098 states. [2019-09-08 13:26:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36098 states to 36098 states and 55853 transitions. [2019-09-08 13:26:46,743 INFO L78 Accepts]: Start accepts. Automaton has 36098 states and 55853 transitions. Word has length 327 [2019-09-08 13:26:46,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:46,743 INFO L475 AbstractCegarLoop]: Abstraction has 36098 states and 55853 transitions. [2019-09-08 13:26:46,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 36098 states and 55853 transitions. [2019-09-08 13:26:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:26:46,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:46,770 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] [2019-09-08 13:26:46,770 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:46,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:46,771 INFO L82 PathProgramCache]: Analyzing trace with hash 669895453, now seen corresponding path program 1 times [2019-09-08 13:26:46,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:46,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:46,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:46,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:46,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:46,943 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:26:46,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:46,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:46,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:46,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:46,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:46,945 INFO L87 Difference]: Start difference. First operand 36098 states and 55853 transitions. Second operand 3 states. [2019-09-08 13:26:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:49,765 INFO L93 Difference]: Finished difference Result 91718 states and 143015 transitions. [2019-09-08 13:26:49,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:49,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-08 13:26:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:49,832 INFO L225 Difference]: With dead ends: 91718 [2019-09-08 13:26:49,832 INFO L226 Difference]: Without dead ends: 57916 [2019-09-08 13:26:49,862 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:26:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57916 states. [2019-09-08 13:26:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57916 to 49770. [2019-09-08 13:26:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49770 states. [2019-09-08 13:26:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49770 states to 49770 states and 78203 transitions. [2019-09-08 13:26:52,296 INFO L78 Accepts]: Start accepts. Automaton has 49770 states and 78203 transitions. Word has length 328 [2019-09-08 13:26:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:52,297 INFO L475 AbstractCegarLoop]: Abstraction has 49770 states and 78203 transitions. [2019-09-08 13:26:52,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 49770 states and 78203 transitions. [2019-09-08 13:26:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:26:52,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:52,326 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] [2019-09-08 13:26:52,327 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:52,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash 814681459, now seen corresponding path program 1 times [2019-09-08 13:26:52,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:52,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:52,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:52,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:52,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:52,825 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:26:52,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:52,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:26:52,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:26:52,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:26:52,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:26:52,828 INFO L87 Difference]: Start difference. First operand 49770 states and 78203 transitions. Second operand 4 states. [2019-09-08 13:26:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:55,033 INFO L93 Difference]: Finished difference Result 95458 states and 149872 transitions. [2019-09-08 13:26:55,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:26:55,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-08 13:26:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:55,096 INFO L225 Difference]: With dead ends: 95458 [2019-09-08 13:26:55,096 INFO L226 Difference]: Without dead ends: 46551 [2019-09-08 13:26:55,149 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:26:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46551 states. [2019-09-08 13:26:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46551 to 46531. [2019-09-08 13:26:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46531 states. [2019-09-08 13:26:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46531 states to 46531 states and 73086 transitions. [2019-09-08 13:26:58,778 INFO L78 Accepts]: Start accepts. Automaton has 46531 states and 73086 transitions. Word has length 328 [2019-09-08 13:26:58,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:58,778 INFO L475 AbstractCegarLoop]: Abstraction has 46531 states and 73086 transitions. [2019-09-08 13:26:58,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:26:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 46531 states and 73086 transitions. [2019-09-08 13:26:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:26:58,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:58,797 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] [2019-09-08 13:26:58,798 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash 172661983, now seen corresponding path program 1 times [2019-09-08 13:26:58,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:58,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:58,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:58,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:58,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:59,168 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:26:59,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:59,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:26:59,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:26:59,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:26:59,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:26:59,170 INFO L87 Difference]: Start difference. First operand 46531 states and 73086 transitions. Second operand 5 states. [2019-09-08 13:27:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:02,672 INFO L93 Difference]: Finished difference Result 91363 states and 143530 transitions. [2019-09-08 13:27:02,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:27:02,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 328 [2019-09-08 13:27:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:02,739 INFO L225 Difference]: With dead ends: 91363 [2019-09-08 13:27:02,739 INFO L226 Difference]: Without dead ends: 46533 [2019-09-08 13:27:02,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:27:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46533 states. [2019-09-08 13:27:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46533 to 46531. [2019-09-08 13:27:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46531 states. [2019-09-08 13:27:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46531 states to 46531 states and 72852 transitions. [2019-09-08 13:27:05,181 INFO L78 Accepts]: Start accepts. Automaton has 46531 states and 72852 transitions. Word has length 328 [2019-09-08 13:27:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:05,181 INFO L475 AbstractCegarLoop]: Abstraction has 46531 states and 72852 transitions. [2019-09-08 13:27:05,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:27:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 46531 states and 72852 transitions. [2019-09-08 13:27:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:27:05,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:05,199 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] [2019-09-08 13:27:05,199 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1736727398, now seen corresponding path program 1 times [2019-09-08 13:27:05,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:05,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:05,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:05,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:05,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:05,752 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:27:05,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:05,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:27:05,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:27:05,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:27:05,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:27:05,756 INFO L87 Difference]: Start difference. First operand 46531 states and 72852 transitions. Second operand 4 states. [2019-09-08 13:27:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:11,027 INFO L93 Difference]: Finished difference Result 137904 states and 215929 transitions. [2019-09-08 13:27:11,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:27:11,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-08 13:27:11,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:11,144 INFO L225 Difference]: With dead ends: 137904 [2019-09-08 13:27:11,144 INFO L226 Difference]: Without dead ends: 91445 [2019-09-08 13:27:11,187 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:27:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91445 states. [2019-09-08 13:27:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91445 to 91288. [2019-09-08 13:27:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91288 states. [2019-09-08 13:27:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91288 states to 91288 states and 142378 transitions. [2019-09-08 13:27:15,848 INFO L78 Accepts]: Start accepts. Automaton has 91288 states and 142378 transitions. Word has length 328 [2019-09-08 13:27:15,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:15,849 INFO L475 AbstractCegarLoop]: Abstraction has 91288 states and 142378 transitions. [2019-09-08 13:27:15,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:27:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 91288 states and 142378 transitions. [2019-09-08 13:27:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:27:15,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:15,883 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] [2019-09-08 13:27:15,884 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:15,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:15,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1274556407, now seen corresponding path program 1 times [2019-09-08 13:27:15,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:15,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:15,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:15,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:15,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:16,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:16,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:27:16,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:27:16,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:27:16,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:16,125 INFO L87 Difference]: Start difference. First operand 91288 states and 142378 transitions. Second operand 3 states. [2019-09-08 13:27:26,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:26,416 INFO L93 Difference]: Finished difference Result 268136 states and 417590 transitions. [2019-09-08 13:27:26,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:26,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:27:26,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:26,620 INFO L225 Difference]: With dead ends: 268136 [2019-09-08 13:27:26,621 INFO L226 Difference]: Without dead ends: 178097 [2019-09-08 13:27:26,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:27:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178097 states. [2019-09-08 13:27:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178097 to 177944. [2019-09-08 13:27:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177944 states. [2019-09-08 13:27:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177944 states to 177944 states and 275916 transitions. [2019-09-08 13:27:39,581 INFO L78 Accepts]: Start accepts. Automaton has 177944 states and 275916 transitions. Word has length 330 [2019-09-08 13:27:39,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:39,582 INFO L475 AbstractCegarLoop]: Abstraction has 177944 states and 275916 transitions. [2019-09-08 13:27:39,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 177944 states and 275916 transitions. [2019-09-08 13:27:39,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:27:39,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:39,656 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] [2019-09-08 13:27:39,657 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:39,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:39,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1779435786, now seen corresponding path program 1 times [2019-09-08 13:27:39,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:39,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:39,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:39,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:39,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:39,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:39,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:27:39,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:27:39,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:27:39,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:39,845 INFO L87 Difference]: Start difference. First operand 177944 states and 275916 transitions. Second operand 3 states. [2019-09-08 13:27:58,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:58,095 INFO L93 Difference]: Finished difference Result 465980 states and 729551 transitions. [2019-09-08 13:27:58,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:58,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 13:27:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:58,610 INFO L225 Difference]: With dead ends: 465980 [2019-09-08 13:27:58,610 INFO L226 Difference]: Without dead ends: 295197 [2019-09-08 13:27:58,772 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:27:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295197 states. [2019-09-08 13:28:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295197 to 264856. [2019-09-08 13:28:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264856 states. [2019-09-08 13:28:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264856 states to 264856 states and 415796 transitions. [2019-09-08 13:28:20,624 INFO L78 Accepts]: Start accepts. Automaton has 264856 states and 415796 transitions. Word has length 332 [2019-09-08 13:28:20,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:20,624 INFO L475 AbstractCegarLoop]: Abstraction has 264856 states and 415796 transitions. [2019-09-08 13:28:20,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:28:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 264856 states and 415796 transitions. [2019-09-08 13:28:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:28:20,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:20,699 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] [2019-09-08 13:28:20,699 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:20,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1490284718, now seen corresponding path program 1 times [2019-09-08 13:28:20,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:20,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:20,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:20,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:20,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:20,931 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:28:20,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:20,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:28:20,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:28:20,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:28:20,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:20,933 INFO L87 Difference]: Start difference. First operand 264856 states and 415796 transitions. Second operand 3 states. [2019-09-08 13:28:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:55,723 INFO L93 Difference]: Finished difference Result 783213 states and 1229388 transitions. [2019-09-08 13:28:55,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:28:55,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 13:28:55,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:56,553 INFO L225 Difference]: With dead ends: 783213 [2019-09-08 13:28:56,554 INFO L226 Difference]: Without dead ends: 519704 [2019-09-08 13:28:56,809 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:28:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519704 states. [2019-09-08 13:29:40,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519704 to 519555. [2019-09-08 13:29:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519555 states. [2019-09-08 13:29:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519555 states to 519555 states and 811439 transitions. [2019-09-08 13:29:41,600 INFO L78 Accepts]: Start accepts. Automaton has 519555 states and 811439 transitions. Word has length 332 [2019-09-08 13:29:41,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:41,600 INFO L475 AbstractCegarLoop]: Abstraction has 519555 states and 811439 transitions. [2019-09-08 13:29:41,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:29:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 519555 states and 811439 transitions. [2019-09-08 13:29:41,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:29:41,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:41,754 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] [2019-09-08 13:29:41,754 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:41,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:41,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1071547665, now seen corresponding path program 1 times [2019-09-08 13:29:41,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:41,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:41,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:41,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:41,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:42,087 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:29:42,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:42,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:42,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:42,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:42,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:42,089 INFO L87 Difference]: Start difference. First operand 519555 states and 811439 transitions. Second operand 4 states. [2019-09-08 13:30:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:30:51,967 INFO L93 Difference]: Finished difference Result 1393233 states and 2172849 transitions. [2019-09-08 13:30:51,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:30:51,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-08 13:30:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:30:53,503 INFO L225 Difference]: With dead ends: 1393233 [2019-09-08 13:30:53,503 INFO L226 Difference]: Without dead ends: 876970 [2019-09-08 13:30:53,936 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:30:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876970 states. [2019-09-08 13:31:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876970 to 502737. [2019-09-08 13:31:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502737 states. [2019-09-08 13:31:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502737 states to 502737 states and 784686 transitions. [2019-09-08 13:31:44,599 INFO L78 Accepts]: Start accepts. Automaton has 502737 states and 784686 transitions. Word has length 332 [2019-09-08 13:31:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:31:44,599 INFO L475 AbstractCegarLoop]: Abstraction has 502737 states and 784686 transitions. [2019-09-08 13:31:44,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:31:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 502737 states and 784686 transitions. [2019-09-08 13:31:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-08 13:31:44,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:31:44,748 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] [2019-09-08 13:31:44,749 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:31:44,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:31:44,749 INFO L82 PathProgramCache]: Analyzing trace with hash -2006517705, now seen corresponding path program 1 times [2019-09-08 13:31:44,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:31:44,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:31:44,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:44,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:31:44,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:31:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:31:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:31:53,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:31:53,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:31:53,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:31:53,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:31:53,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:31:53,451 INFO L87 Difference]: Start difference. First operand 502737 states and 784686 transitions. Second operand 3 states. [2019-09-08 13:33:02,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:33:02,146 INFO L93 Difference]: Finished difference Result 1383230 states and 2157012 transitions. [2019-09-08 13:33:02,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:33:02,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-08 13:33:02,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:33:03,678 INFO L225 Difference]: With dead ends: 1383230 [2019-09-08 13:33:03,678 INFO L226 Difference]: Without dead ends: 903019 [2019-09-08 13:33:04,082 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:33:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903019 states. [2019-09-08 13:33:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903019 to 503218. [2019-09-08 13:33:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503218 states. [2019-09-08 13:33:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503218 states to 503218 states and 785284 transitions. [2019-09-08 13:33:57,203 INFO L78 Accepts]: Start accepts. Automaton has 503218 states and 785284 transitions. Word has length 335 [2019-09-08 13:33:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:33:57,204 INFO L475 AbstractCegarLoop]: Abstraction has 503218 states and 785284 transitions. [2019-09-08 13:33:57,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:33:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 503218 states and 785284 transitions. [2019-09-08 13:33:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 13:33:57,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:33:57,365 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] [2019-09-08 13:33:57,365 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:33:57,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:33:57,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2068349541, now seen corresponding path program 1 times [2019-09-08 13:33:57,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:33:57,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:33:57,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:57,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:33:57,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:33:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:33:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:33:57,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:33:57,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:33:57,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:33:57,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:33:57,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:33:57,942 INFO L87 Difference]: Start difference. First operand 503218 states and 785284 transitions. Second operand 8 states. [2019-09-08 13:36:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:36:07,942 INFO L93 Difference]: Finished difference Result 1823090 states and 2849584 transitions. [2019-09-08 13:36:07,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:36:07,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 336 [2019-09-08 13:36:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:36:10,413 INFO L225 Difference]: With dead ends: 1823090 [2019-09-08 13:36:10,413 INFO L226 Difference]: Without dead ends: 1333243 [2019-09-08 13:36:10,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-08 13:36:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333243 states.