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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:18:13,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:18:13,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:18:13,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:18:13,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:18:13,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:18:13,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:18:13,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:18:13,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:18:13,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:18:13,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:18:13,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:18:13,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:18:13,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:18:13,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:18:13,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:18:13,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:18:13,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:18:13,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:18:13,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:18:13,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:18:13,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:18:13,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:18:13,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:18:13,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:18:13,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:18:13,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:18:13,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:18:13,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:18:13,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:18:13,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:18:13,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:18:13,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:18:13,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:18:13,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:18:13,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:18:13,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:18:13,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:18:13,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:18:13,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:18:13,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:18:13,926 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:18:13,940 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:18:13,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:18:13,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:18:13,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:18:13,942 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:18:13,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:18:13,943 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:18:13,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:18:13,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:18:13,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:18:13,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:18:13,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:18:13,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:18:13,944 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:18:13,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:18:13,944 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:18:13,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:18:13,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:18:13,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:18:13,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:18:13,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:18:13,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:18:13,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:18:13,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:18:13,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:18:13,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:18:13,947 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:18:13,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:18:13,947 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:18:13,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:18:13,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:18:13,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:18:13,998 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:18:13,998 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:18:13,999 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.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 13:18:14,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3817b7d3/56ff86e1dc8e4bc68e2ef7b98a98e572/FLAG3b983ce42 [2019-09-08 13:18:14,725 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:18:14,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 13:18:14,758 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3817b7d3/56ff86e1dc8e4bc68e2ef7b98a98e572/FLAG3b983ce42 [2019-09-08 13:18:14,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3817b7d3/56ff86e1dc8e4bc68e2ef7b98a98e572 [2019-09-08 13:18:14,899 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:18:14,900 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:18:14,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:18:14,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:18:14,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:18:14,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:18:14" (1/1) ... [2019-09-08 13:18:14,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3393aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:14, skipping insertion in model container [2019-09-08 13:18:14,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:18:14" (1/1) ... [2019-09-08 13:18:14,920 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:18:15,102 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:18:16,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:18:16,526 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:18:17,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:18:17,363 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:18:17,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:17 WrapperNode [2019-09-08 13:18:17,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:18:17,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:18:17,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:18:17,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:18:17,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:17" (1/1) ... [2019-09-08 13:18:17,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:17" (1/1) ... [2019-09-08 13:18:17,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:17" (1/1) ... [2019-09-08 13:18:17,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:17" (1/1) ... [2019-09-08 13:18:17,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:17" (1/1) ... [2019-09-08 13:18:17,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:17" (1/1) ... [2019-09-08 13:18:17,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:17" (1/1) ... [2019-09-08 13:18:17,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:18:17,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:18:17,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:18:17,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:18:17,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:17" (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:18:17,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:18:17,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:18:17,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:18:17,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:18:17,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:18:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:18:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:18:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:18:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:18:17,633 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:18:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:18:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:18:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:18:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:18:17,634 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:18:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:18:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:18:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:18:17,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:18:20,878 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:18:20,879 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:18:20,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:18:20 BoogieIcfgContainer [2019-09-08 13:18:20,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:18:20,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:18:20,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:18:20,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:18:20,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:18:14" (1/3) ... [2019-09-08 13:18:20,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e892bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:18:20, skipping insertion in model container [2019-09-08 13:18:20,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:18:17" (2/3) ... [2019-09-08 13:18:20,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e892bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:18:20, skipping insertion in model container [2019-09-08 13:18:20,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:18:20" (3/3) ... [2019-09-08 13:18:20,893 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 13:18:20,904 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:18:20,931 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-08 13:18:20,950 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-08 13:18:20,986 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:18:20,987 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:18:20,987 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:18:20,987 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:18:20,987 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:18:20,988 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:18:20,988 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:18:20,988 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:18:20,988 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:18:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states. [2019-09-08 13:18:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:18:21,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:21,065 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] [2019-09-08 13:18:21,067 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:21,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash 913474507, now seen corresponding path program 1 times [2019-09-08 13:18:21,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:21,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:21,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:21,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:21,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:22,078 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:18:22,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:22,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:22,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:22,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:22,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:22,100 INFO L87 Difference]: Start difference. First operand 992 states. Second operand 3 states. [2019-09-08 13:18:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:22,431 INFO L93 Difference]: Finished difference Result 1704 states and 3011 transitions. [2019-09-08 13:18:22,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:22,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 13:18:22,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:22,466 INFO L225 Difference]: With dead ends: 1704 [2019-09-08 13:18:22,466 INFO L226 Difference]: Without dead ends: 1434 [2019-09-08 13:18:22,477 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:18:22,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-09-08 13:18:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1432. [2019-09-08 13:18:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-09-08 13:18:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2204 transitions. [2019-09-08 13:18:22,687 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2204 transitions. Word has length 318 [2019-09-08 13:18:22,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:22,689 INFO L475 AbstractCegarLoop]: Abstraction has 1432 states and 2204 transitions. [2019-09-08 13:18:22,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2204 transitions. [2019-09-08 13:18:22,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:18:22,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:22,704 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] [2019-09-08 13:18:22,705 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:22,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:22,705 INFO L82 PathProgramCache]: Analyzing trace with hash 679727429, now seen corresponding path program 1 times [2019-09-08 13:18:22,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:22,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:22,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:22,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:22,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:23,043 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:18:23,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:23,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:23,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:23,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:23,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:23,049 INFO L87 Difference]: Start difference. First operand 1432 states and 2204 transitions. Second operand 3 states. [2019-09-08 13:18:23,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:23,284 INFO L93 Difference]: Finished difference Result 2739 states and 4264 transitions. [2019-09-08 13:18:23,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:23,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 13:18:23,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:23,298 INFO L225 Difference]: With dead ends: 2739 [2019-09-08 13:18:23,298 INFO L226 Difference]: Without dead ends: 2324 [2019-09-08 13:18:23,302 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:18:23,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2019-09-08 13:18:23,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2322. [2019-09-08 13:18:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2019-09-08 13:18:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3592 transitions. [2019-09-08 13:18:23,392 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3592 transitions. Word has length 318 [2019-09-08 13:18:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:23,394 INFO L475 AbstractCegarLoop]: Abstraction has 2322 states and 3592 transitions. [2019-09-08 13:18:23,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3592 transitions. [2019-09-08 13:18:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:18:23,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:23,402 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:23,403 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash -40366510, now seen corresponding path program 1 times [2019-09-08 13:18:23,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:23,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:23,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:23,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:23,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:23,843 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:18:23,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:23,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:23,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:23,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:23,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:23,846 INFO L87 Difference]: Start difference. First operand 2322 states and 3592 transitions. Second operand 3 states. [2019-09-08 13:18:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:24,242 INFO L93 Difference]: Finished difference Result 4797 states and 7513 transitions. [2019-09-08 13:18:24,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:24,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 13:18:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:24,267 INFO L225 Difference]: With dead ends: 4797 [2019-09-08 13:18:24,268 INFO L226 Difference]: Without dead ends: 4152 [2019-09-08 13:18:24,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2019-09-08 13:18:24,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 4150. [2019-09-08 13:18:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4150 states. [2019-09-08 13:18:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4150 states to 4150 states and 6444 transitions. [2019-09-08 13:18:24,413 INFO L78 Accepts]: Start accepts. Automaton has 4150 states and 6444 transitions. Word has length 318 [2019-09-08 13:18:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:24,414 INFO L475 AbstractCegarLoop]: Abstraction has 4150 states and 6444 transitions. [2019-09-08 13:18:24,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4150 states and 6444 transitions. [2019-09-08 13:18:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:18:24,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:24,425 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] [2019-09-08 13:18:24,425 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:24,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:24,426 INFO L82 PathProgramCache]: Analyzing trace with hash -40705134, now seen corresponding path program 1 times [2019-09-08 13:18:24,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:24,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:24,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:24,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:24,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:25,317 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:18:25,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:25,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:18:25,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:18:25,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:18:25,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:18:25,319 INFO L87 Difference]: Start difference. First operand 4150 states and 6444 transitions. Second operand 4 states. [2019-09-08 13:18:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:25,784 INFO L93 Difference]: Finished difference Result 12267 states and 19029 transitions. [2019-09-08 13:18:25,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:18:25,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-08 13:18:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:25,829 INFO L225 Difference]: With dead ends: 12267 [2019-09-08 13:18:25,829 INFO L226 Difference]: Without dead ends: 8132 [2019-09-08 13:18:25,840 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:18:25,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8132 states. [2019-09-08 13:18:26,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8132 to 7971. [2019-09-08 13:18:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7971 states. [2019-09-08 13:18:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7971 states to 7971 states and 12336 transitions. [2019-09-08 13:18:26,308 INFO L78 Accepts]: Start accepts. Automaton has 7971 states and 12336 transitions. Word has length 318 [2019-09-08 13:18:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:26,308 INFO L475 AbstractCegarLoop]: Abstraction has 7971 states and 12336 transitions. [2019-09-08 13:18:26,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:18:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 7971 states and 12336 transitions. [2019-09-08 13:18:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:18:26,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:26,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] [2019-09-08 13:18:26,326 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:26,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:26,327 INFO L82 PathProgramCache]: Analyzing trace with hash 224308930, now seen corresponding path program 1 times [2019-09-08 13:18:26,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:26,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:26,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:26,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:26,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:26,589 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:18:26,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:26,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:26,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:26,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:26,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:26,591 INFO L87 Difference]: Start difference. First operand 7971 states and 12336 transitions. Second operand 3 states. [2019-09-08 13:18:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:27,198 INFO L93 Difference]: Finished difference Result 23462 states and 36244 transitions. [2019-09-08 13:18:27,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:27,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 13:18:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:27,265 INFO L225 Difference]: With dead ends: 23462 [2019-09-08 13:18:27,265 INFO L226 Difference]: Without dead ends: 15620 [2019-09-08 13:18:27,282 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:18:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15620 states. [2019-09-08 13:18:28,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15620 to 15459. [2019-09-08 13:18:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15459 states. [2019-09-08 13:18:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15459 states to 15459 states and 23811 transitions. [2019-09-08 13:18:28,047 INFO L78 Accepts]: Start accepts. Automaton has 15459 states and 23811 transitions. Word has length 320 [2019-09-08 13:18:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:28,048 INFO L475 AbstractCegarLoop]: Abstraction has 15459 states and 23811 transitions. [2019-09-08 13:18:28,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 15459 states and 23811 transitions. [2019-09-08 13:18:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:18:28,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:28,083 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:18:28,083 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:28,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:28,084 INFO L82 PathProgramCache]: Analyzing trace with hash 98648583, now seen corresponding path program 1 times [2019-09-08 13:18:28,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:28,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:28,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:28,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:28,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:28,254 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:18:28,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:28,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:28,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:28,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:28,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:28,256 INFO L87 Difference]: Start difference. First operand 15459 states and 23811 transitions. Second operand 3 states. [2019-09-08 13:18:29,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:29,228 INFO L93 Difference]: Finished difference Result 46302 states and 71309 transitions. [2019-09-08 13:18:29,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:29,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 13:18:29,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:29,303 INFO L225 Difference]: With dead ends: 46302 [2019-09-08 13:18:29,304 INFO L226 Difference]: Without dead ends: 30885 [2019-09-08 13:18:29,343 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:18:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30885 states. [2019-09-08 13:18:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30885 to 15478. [2019-09-08 13:18:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15478 states. [2019-09-08 13:18:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15478 states to 15478 states and 23839 transitions. [2019-09-08 13:18:30,984 INFO L78 Accepts]: Start accepts. Automaton has 15478 states and 23839 transitions. Word has length 320 [2019-09-08 13:18:30,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:30,985 INFO L475 AbstractCegarLoop]: Abstraction has 15478 states and 23839 transitions. [2019-09-08 13:18:30,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:30,985 INFO L276 IsEmpty]: Start isEmpty. Operand 15478 states and 23839 transitions. [2019-09-08 13:18:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 13:18:31,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:31,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:18:31,017 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:31,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:31,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1417301956, now seen corresponding path program 1 times [2019-09-08 13:18:31,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:31,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:31,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:31,167 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:18:31,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:31,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:31,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:31,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:31,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:31,169 INFO L87 Difference]: Start difference. First operand 15478 states and 23839 transitions. Second operand 3 states. [2019-09-08 13:18:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:31,985 INFO L93 Difference]: Finished difference Result 46321 states and 71330 transitions. [2019-09-08 13:18:31,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:31,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-08 13:18:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:32,073 INFO L225 Difference]: With dead ends: 46321 [2019-09-08 13:18:32,073 INFO L226 Difference]: Without dead ends: 30903 [2019-09-08 13:18:32,118 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:18:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30903 states. [2019-09-08 13:18:32,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30903 to 15496. [2019-09-08 13:18:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15496 states. [2019-09-08 13:18:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15496 states to 15496 states and 23860 transitions. [2019-09-08 13:18:32,972 INFO L78 Accepts]: Start accepts. Automaton has 15496 states and 23860 transitions. Word has length 321 [2019-09-08 13:18:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:32,972 INFO L475 AbstractCegarLoop]: Abstraction has 15496 states and 23860 transitions. [2019-09-08 13:18:32,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 15496 states and 23860 transitions. [2019-09-08 13:18:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:18:33,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:33,004 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:18:33,005 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash -232337606, now seen corresponding path program 1 times [2019-09-08 13:18:33,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:33,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:33,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:33,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:33,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:33,410 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:18:33,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:33,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:18:33,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:18:33,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:18:33,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:18:33,412 INFO L87 Difference]: Start difference. First operand 15496 states and 23860 transitions. Second operand 4 states. [2019-09-08 13:18:34,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:34,517 INFO L93 Difference]: Finished difference Result 45997 states and 70735 transitions. [2019-09-08 13:18:34,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:18:34,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-08 13:18:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:34,589 INFO L225 Difference]: With dead ends: 45997 [2019-09-08 13:18:34,590 INFO L226 Difference]: Without dead ends: 30830 [2019-09-08 13:18:34,625 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:18:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30830 states. [2019-09-08 13:18:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30830 to 15703. [2019-09-08 13:18:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15703 states. [2019-09-08 13:18:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15703 states to 15703 states and 24213 transitions. [2019-09-08 13:18:35,274 INFO L78 Accepts]: Start accepts. Automaton has 15703 states and 24213 transitions. Word has length 322 [2019-09-08 13:18:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:35,275 INFO L475 AbstractCegarLoop]: Abstraction has 15703 states and 24213 transitions. [2019-09-08 13:18:35,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:18:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 15703 states and 24213 transitions. [2019-09-08 13:18:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:18:35,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:35,310 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:18:35,311 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:35,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1471056227, now seen corresponding path program 1 times [2019-09-08 13:18:35,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:35,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:35,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:35,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:35,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:18:35,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:35,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:35,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:35,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:35,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:35,714 INFO L87 Difference]: Start difference. First operand 15703 states and 24213 transitions. Second operand 3 states. [2019-09-08 13:18:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:36,733 INFO L93 Difference]: Finished difference Result 44121 states and 67819 transitions. [2019-09-08 13:18:36,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:36,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 13:18:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:36,778 INFO L225 Difference]: With dead ends: 44121 [2019-09-08 13:18:36,778 INFO L226 Difference]: Without dead ends: 28838 [2019-09-08 13:18:36,810 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:18:36,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28838 states. [2019-09-08 13:18:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28838 to 28677. [2019-09-08 13:18:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28677 states. [2019-09-08 13:18:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28677 states to 28677 states and 43890 transitions. [2019-09-08 13:18:38,518 INFO L78 Accepts]: Start accepts. Automaton has 28677 states and 43890 transitions. Word has length 322 [2019-09-08 13:18:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:38,518 INFO L475 AbstractCegarLoop]: Abstraction has 28677 states and 43890 transitions. [2019-09-08 13:18:38,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 28677 states and 43890 transitions. [2019-09-08 13:18:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:18:38,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:38,547 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:18:38,548 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:38,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:38,548 INFO L82 PathProgramCache]: Analyzing trace with hash 897525131, now seen corresponding path program 1 times [2019-09-08 13:18:38,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:38,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:38,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:38,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:38,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:38,705 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:18:38,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:38,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:38,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:38,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:38,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:38,707 INFO L87 Difference]: Start difference. First operand 28677 states and 43890 transitions. Second operand 3 states. [2019-09-08 13:18:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:40,395 INFO L93 Difference]: Finished difference Result 84461 states and 128951 transitions. [2019-09-08 13:18:40,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:40,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:18:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:40,487 INFO L225 Difference]: With dead ends: 84461 [2019-09-08 13:18:40,487 INFO L226 Difference]: Without dead ends: 56587 [2019-09-08 13:18:40,541 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:18:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56587 states. [2019-09-08 13:18:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56587 to 28781. [2019-09-08 13:18:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28781 states. [2019-09-08 13:18:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28781 states to 28781 states and 44033 transitions. [2019-09-08 13:18:41,940 INFO L78 Accepts]: Start accepts. Automaton has 28781 states and 44033 transitions. Word has length 324 [2019-09-08 13:18:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:41,940 INFO L475 AbstractCegarLoop]: Abstraction has 28781 states and 44033 transitions. [2019-09-08 13:18:41,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 28781 states and 44033 transitions. [2019-09-08 13:18:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:18:41,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:41,961 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:18:41,961 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:41,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:41,962 INFO L82 PathProgramCache]: Analyzing trace with hash -660231972, now seen corresponding path program 1 times [2019-09-08 13:18:41,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:41,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:41,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:41,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:41,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:42,137 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:18:42,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:42,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:42,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:42,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:42,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:42,139 INFO L87 Difference]: Start difference. First operand 28781 states and 44033 transitions. Second operand 3 states. [2019-09-08 13:18:44,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:44,462 INFO L93 Difference]: Finished difference Result 73113 states and 112623 transitions. [2019-09-08 13:18:44,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:44,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:18:44,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:44,511 INFO L225 Difference]: With dead ends: 73113 [2019-09-08 13:18:44,511 INFO L226 Difference]: Without dead ends: 46199 [2019-09-08 13:18:44,543 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:18:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46199 states. [2019-09-08 13:18:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46199 to 36137. [2019-09-08 13:18:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36137 states. [2019-09-08 13:18:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36137 states to 36137 states and 56147 transitions. [2019-09-08 13:18:46,065 INFO L78 Accepts]: Start accepts. Automaton has 36137 states and 56147 transitions. Word has length 324 [2019-09-08 13:18:46,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:46,065 INFO L475 AbstractCegarLoop]: Abstraction has 36137 states and 56147 transitions. [2019-09-08 13:18:46,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 36137 states and 56147 transitions. [2019-09-08 13:18:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 13:18:46,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:46,093 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:18:46,094 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:46,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:46,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1347000792, now seen corresponding path program 1 times [2019-09-08 13:18:46,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:46,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:46,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:46,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:46,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:46,284 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:18:46,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:46,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:46,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:46,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:46,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:46,286 INFO L87 Difference]: Start difference. First operand 36137 states and 56147 transitions. Second operand 3 states. [2019-09-08 13:18:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:48,933 INFO L93 Difference]: Finished difference Result 106661 states and 165459 transitions. [2019-09-08 13:18:48,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:48,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-08 13:18:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:49,016 INFO L225 Difference]: With dead ends: 106661 [2019-09-08 13:18:49,017 INFO L226 Difference]: Without dead ends: 71424 [2019-09-08 13:18:49,052 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:18:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71424 states. [2019-09-08 13:18:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71424 to 36262. [2019-09-08 13:18:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36262 states. [2019-09-08 13:18:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36262 states to 36262 states and 56293 transitions. [2019-09-08 13:18:52,092 INFO L78 Accepts]: Start accepts. Automaton has 36262 states and 56293 transitions. Word has length 325 [2019-09-08 13:18:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:52,092 INFO L475 AbstractCegarLoop]: Abstraction has 36262 states and 56293 transitions. [2019-09-08 13:18:52,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 36262 states and 56293 transitions. [2019-09-08 13:18:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:18:52,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:52,121 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:18:52,121 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:52,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash -840298597, now seen corresponding path program 1 times [2019-09-08 13:18:52,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:52,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:52,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:52,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:52,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:52,317 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:18:52,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:52,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:18:52,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:18:52,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:18:52,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:18:52,319 INFO L87 Difference]: Start difference. First operand 36262 states and 56293 transitions. Second operand 3 states. [2019-09-08 13:18:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:54,733 INFO L93 Difference]: Finished difference Result 91092 states and 142521 transitions. [2019-09-08 13:18:54,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:18:54,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:18:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:54,804 INFO L225 Difference]: With dead ends: 91092 [2019-09-08 13:18:54,804 INFO L226 Difference]: Without dead ends: 57134 [2019-09-08 13:18:54,837 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:18:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57134 states. [2019-09-08 13:18:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57134 to 49454. [2019-09-08 13:18:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49454 states. [2019-09-08 13:18:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49454 states to 49454 states and 77863 transitions. [2019-09-08 13:18:57,296 INFO L78 Accepts]: Start accepts. Automaton has 49454 states and 77863 transitions. Word has length 326 [2019-09-08 13:18:57,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:18:57,296 INFO L475 AbstractCegarLoop]: Abstraction has 49454 states and 77863 transitions. [2019-09-08 13:18:57,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:18:57,297 INFO L276 IsEmpty]: Start isEmpty. Operand 49454 states and 77863 transitions. [2019-09-08 13:18:57,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:18:57,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:18:57,316 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:57,316 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:18:57,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:18:57,317 INFO L82 PathProgramCache]: Analyzing trace with hash 826857406, now seen corresponding path program 1 times [2019-09-08 13:18:57,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:18:57,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:18:57,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:57,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:18:57,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:18:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:18:57,708 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:18:57,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:18:57,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:18:57,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:18:57,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:18:57,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:18:57,710 INFO L87 Difference]: Start difference. First operand 49454 states and 77863 transitions. Second operand 4 states. [2019-09-08 13:18:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:59,838 INFO L93 Difference]: Finished difference Result 94859 states and 149233 transitions. [2019-09-08 13:18:59,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:18:59,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-08 13:18:59,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:59,909 INFO L225 Difference]: With dead ends: 94859 [2019-09-08 13:18:59,909 INFO L226 Difference]: Without dead ends: 46268 [2019-09-08 13:18:59,967 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:19:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46268 states. [2019-09-08 13:19:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46268 to 46248. [2019-09-08 13:19:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46248 states. [2019-09-08 13:19:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46248 states to 46248 states and 72787 transitions. [2019-09-08 13:19:03,482 INFO L78 Accepts]: Start accepts. Automaton has 46248 states and 72787 transitions. Word has length 326 [2019-09-08 13:19:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:03,482 INFO L475 AbstractCegarLoop]: Abstraction has 46248 states and 72787 transitions. [2019-09-08 13:19:03,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:19:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 46248 states and 72787 transitions. [2019-09-08 13:19:03,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:19:03,502 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:03,502 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:19:03,502 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:03,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:03,503 INFO L82 PathProgramCache]: Analyzing trace with hash 289078623, now seen corresponding path program 1 times [2019-09-08 13:19:03,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:03,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:03,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:03,879 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:19:03,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:03,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:19:03,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:19:03,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:19:03,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:19:03,881 INFO L87 Difference]: Start difference. First operand 46248 states and 72787 transitions. Second operand 5 states. [2019-09-08 13:19:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:07,101 INFO L93 Difference]: Finished difference Result 90790 states and 142925 transitions. [2019-09-08 13:19:07,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:19:07,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 327 [2019-09-08 13:19:07,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:07,174 INFO L225 Difference]: With dead ends: 90790 [2019-09-08 13:19:07,175 INFO L226 Difference]: Without dead ends: 46250 [2019-09-08 13:19:07,223 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:19:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46250 states. [2019-09-08 13:19:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46250 to 46248. [2019-09-08 13:19:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46248 states. [2019-09-08 13:19:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46248 states to 46248 states and 72481 transitions. [2019-09-08 13:19:09,637 INFO L78 Accepts]: Start accepts. Automaton has 46248 states and 72481 transitions. Word has length 327 [2019-09-08 13:19:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:09,637 INFO L475 AbstractCegarLoop]: Abstraction has 46248 states and 72481 transitions. [2019-09-08 13:19:09,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:19:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 46248 states and 72481 transitions. [2019-09-08 13:19:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:19:09,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:09,654 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:19:09,654 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:09,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:09,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1577114278, now seen corresponding path program 1 times [2019-09-08 13:19:09,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:09,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:09,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:09,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:09,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:10,064 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:19:10,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:10,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:19:10,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:19:10,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:19:10,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:19:10,068 INFO L87 Difference]: Start difference. First operand 46248 states and 72481 transitions. Second operand 9 states. [2019-09-08 13:19:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:19:36,070 INFO L93 Difference]: Finished difference Result 345427 states and 547737 transitions. [2019-09-08 13:19:36,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 13:19:36,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 327 [2019-09-08 13:19:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:19:36,525 INFO L225 Difference]: With dead ends: 345427 [2019-09-08 13:19:36,525 INFO L226 Difference]: Without dead ends: 326932 [2019-09-08 13:19:36,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 13:19:36,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326932 states. [2019-09-08 13:19:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326932 to 140942. [2019-09-08 13:19:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140942 states. [2019-09-08 13:19:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140942 states to 140942 states and 220989 transitions. [2019-09-08 13:19:48,281 INFO L78 Accepts]: Start accepts. Automaton has 140942 states and 220989 transitions. Word has length 327 [2019-09-08 13:19:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:48,282 INFO L475 AbstractCegarLoop]: Abstraction has 140942 states and 220989 transitions. [2019-09-08 13:19:48,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:19:48,282 INFO L276 IsEmpty]: Start isEmpty. Operand 140942 states and 220989 transitions. [2019-09-08 13:19:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:19:48,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:48,341 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:19:48,342 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:48,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:48,342 INFO L82 PathProgramCache]: Analyzing trace with hash 608853482, now seen corresponding path program 1 times [2019-09-08 13:19:48,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:48,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:48,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:48,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:48,857 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:19:48,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:48,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:19:48,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:19:48,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:19:48,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:19:48,860 INFO L87 Difference]: Start difference. First operand 140942 states and 220989 transitions. Second operand 9 states. [2019-09-08 13:20:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:05,988 INFO L93 Difference]: Finished difference Result 271029 states and 428658 transitions. [2019-09-08 13:20:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 13:20:05,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 327 [2019-09-08 13:20:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:06,284 INFO L225 Difference]: With dead ends: 271029 [2019-09-08 13:20:06,285 INFO L226 Difference]: Without dead ends: 189126 [2019-09-08 13:20:06,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:20:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189126 states. [2019-09-08 13:20:11,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189126 to 62318. [2019-09-08 13:20:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62318 states. [2019-09-08 13:20:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62318 states to 62318 states and 95522 transitions. [2019-09-08 13:20:11,611 INFO L78 Accepts]: Start accepts. Automaton has 62318 states and 95522 transitions. Word has length 327 [2019-09-08 13:20:11,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:11,612 INFO L475 AbstractCegarLoop]: Abstraction has 62318 states and 95522 transitions. [2019-09-08 13:20:11,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:20:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand 62318 states and 95522 transitions. [2019-09-08 13:20:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:20:11,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:11,639 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:20:11,639 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:11,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:11,640 INFO L82 PathProgramCache]: Analyzing trace with hash 575908611, now seen corresponding path program 1 times [2019-09-08 13:20:11,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:11,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:11,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:11,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:11,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:12,211 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:20:12,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:12,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:20:12,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:20:12,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:20:12,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:20:12,213 INFO L87 Difference]: Start difference. First operand 62318 states and 95522 transitions. Second operand 4 states. [2019-09-08 13:20:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:21,690 INFO L93 Difference]: Finished difference Result 183785 states and 281847 transitions. [2019-09-08 13:20:21,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:20:21,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-09-08 13:20:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:21,850 INFO L225 Difference]: With dead ends: 183785 [2019-09-08 13:20:21,850 INFO L226 Difference]: Without dead ends: 121539 [2019-09-08 13:20:21,911 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:20:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121539 states. [2019-09-08 13:20:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121539 to 121390. [2019-09-08 13:20:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121390 states. [2019-09-08 13:20:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121390 states to 121390 states and 185450 transitions. [2019-09-08 13:20:34,513 INFO L78 Accepts]: Start accepts. Automaton has 121390 states and 185450 transitions. Word has length 327 [2019-09-08 13:20:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:20:34,513 INFO L475 AbstractCegarLoop]: Abstraction has 121390 states and 185450 transitions. [2019-09-08 13:20:34,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:20:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 121390 states and 185450 transitions. [2019-09-08 13:20:34,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 13:20:34,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:20:34,573 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] [2019-09-08 13:20:34,573 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:20:34,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:20:34,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1175028214, now seen corresponding path program 1 times [2019-09-08 13:20:34,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:20:34,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:20:34,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:34,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:20:34,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:20:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:20:34,817 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:20:34,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:20:34,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:20:34,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:20:34,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:20:34,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:20:34,820 INFO L87 Difference]: Start difference. First operand 121390 states and 185450 transitions. Second operand 3 states. [2019-09-08 13:20:52,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:52,768 INFO L93 Difference]: Finished difference Result 357098 states and 545572 transitions. [2019-09-08 13:20:52,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:20:52,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-08 13:20:52,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:53,109 INFO L225 Difference]: With dead ends: 357098 [2019-09-08 13:20:53,109 INFO L226 Difference]: Without dead ends: 236957 [2019-09-08 13:20:53,223 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:20:53,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236957 states. [2019-09-08 13:21:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236957 to 236812. [2019-09-08 13:21:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236812 states. [2019-09-08 13:21:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236812 states to 236812 states and 360514 transitions. [2019-09-08 13:21:16,794 INFO L78 Accepts]: Start accepts. Automaton has 236812 states and 360514 transitions. Word has length 329 [2019-09-08 13:21:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:21:16,795 INFO L475 AbstractCegarLoop]: Abstraction has 236812 states and 360514 transitions. [2019-09-08 13:21:16,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:21:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 236812 states and 360514 transitions. [2019-09-08 13:21:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:21:16,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:21:16,894 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:21:16,894 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:21:16,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:21:16,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1006142569, now seen corresponding path program 1 times [2019-09-08 13:21:16,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:21:16,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:21:16,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:16,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:21:16,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:21:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:21:17,108 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:21:17,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:21:17,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:21:17,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:21:17,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:21:17,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:21:17,110 INFO L87 Difference]: Start difference. First operand 236812 states and 360514 transitions. Second operand 3 states. [2019-09-08 13:21:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:21:52,128 INFO L93 Difference]: Finished difference Result 619248 states and 950413 transitions. [2019-09-08 13:21:52,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:21:52,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:21:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:21:52,790 INFO L225 Difference]: With dead ends: 619248 [2019-09-08 13:21:52,790 INFO L226 Difference]: Without dead ends: 389625 [2019-09-08 13:21:52,970 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:21:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389625 states. [2019-09-08 13:22:28,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389625 to 353804. [2019-09-08 13:22:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353804 states. [2019-09-08 13:22:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353804 states to 353804 states and 543274 transitions. [2019-09-08 13:22:29,444 INFO L78 Accepts]: Start accepts. Automaton has 353804 states and 543274 transitions. Word has length 330 [2019-09-08 13:22:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:22:29,444 INFO L475 AbstractCegarLoop]: Abstraction has 353804 states and 543274 transitions. [2019-09-08 13:22:29,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:22:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 353804 states and 543274 transitions. [2019-09-08 13:22:29,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 13:22:29,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:22:29,550 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] [2019-09-08 13:22:29,550 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:22:29,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:22:29,551 INFO L82 PathProgramCache]: Analyzing trace with hash 517689659, now seen corresponding path program 1 times [2019-09-08 13:22:29,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:22:29,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:22:29,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:29,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:22:29,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:22:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:22:29,811 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:22:29,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:22:29,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:22:29,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:22:29,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:22:29,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:22:29,813 INFO L87 Difference]: Start difference. First operand 353804 states and 543274 transitions. Second operand 3 states. [2019-09-08 13:23:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:23:38,762 INFO L93 Difference]: Finished difference Result 1046729 states and 1606702 transitions. [2019-09-08 13:23:38,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:23:38,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-08 13:23:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:23:39,841 INFO L225 Difference]: With dead ends: 1046729 [2019-09-08 13:23:39,842 INFO L226 Difference]: Without dead ends: 694272 [2019-09-08 13:23:40,113 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:23:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694272 states. [2019-09-08 13:24:58,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694272 to 694131. [2019-09-08 13:24:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694131 states. [2019-09-08 13:25:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694131 states to 694131 states and 1060003 transitions. [2019-09-08 13:25:00,664 INFO L78 Accepts]: Start accepts. Automaton has 694131 states and 1060003 transitions. Word has length 331 [2019-09-08 13:25:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:25:00,664 INFO L475 AbstractCegarLoop]: Abstraction has 694131 states and 1060003 transitions. [2019-09-08 13:25:00,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:25:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 694131 states and 1060003 transitions. [2019-09-08 13:25:00,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 13:25:00,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:25:00,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:00,904 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:25:00,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:25:00,905 INFO L82 PathProgramCache]: Analyzing trace with hash 669744638, now seen corresponding path program 1 times [2019-09-08 13:25:00,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:25:00,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:25:00,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:00,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:25:00,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:25:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:25:01,195 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:25:01,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:25:01,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:25:01,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:25:01,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:25:01,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:25:01,197 INFO L87 Difference]: Start difference. First operand 694131 states and 1060003 transitions. Second operand 4 states. [2019-09-08 13:27:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:10,188 INFO L93 Difference]: Finished difference Result 1899381 states and 2895444 transitions. [2019-09-08 13:27:10,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:27:10,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2019-09-08 13:27:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:12,380 INFO L225 Difference]: With dead ends: 1899381 [2019-09-08 13:27:12,380 INFO L226 Difference]: Without dead ends: 1208542 [2019-09-08 13:27:12,938 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:27:13,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208542 states. [2019-09-08 13:28:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208542 to 677755. [2019-09-08 13:28:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677755 states. [2019-09-08 13:28:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677755 states to 677755 states and 1034329 transitions. [2019-09-08 13:28:52,830 INFO L78 Accepts]: Start accepts. Automaton has 677755 states and 1034329 transitions. Word has length 331 [2019-09-08 13:28:52,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:28:52,831 INFO L475 AbstractCegarLoop]: Abstraction has 677755 states and 1034329 transitions. [2019-09-08 13:28:52,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:28:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 677755 states and 1034329 transitions. [2019-09-08 13:28:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 13:28:53,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:28:53,027 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] [2019-09-08 13:28:53,028 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:28:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:28:53,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1144584202, now seen corresponding path program 1 times [2019-09-08 13:28:53,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:28:53,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:28:53,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:53,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:28:53,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:28:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:28:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:28:53,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:28:53,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:28:53,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:28:53,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:28:53,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:28:53,182 INFO L87 Difference]: Start difference. First operand 677755 states and 1034329 transitions. Second operand 3 states.