java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:26:09,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:26:09,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:26:09,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:26:09,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:26:09,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:26:09,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:26:09,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:26:09,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:26:09,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:26:09,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:26:09,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:26:09,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:26:09,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:26:09,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:26:09,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:26:09,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:26:09,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:26:09,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:26:09,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:26:09,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:26:09,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:26:09,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:26:09,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:26:09,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:26:09,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:26:09,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:26:09,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:26:09,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:26:09,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:26:09,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:26:09,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:26:09,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:26:09,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:26:10,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:26:10,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:26:10,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:26:10,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:26:10,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:26:10,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:26:10,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:26:10,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:26:10,017 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:26:10,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:26:10,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:26:10,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:26:10,019 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:26:10,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:26:10,020 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:26:10,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:26:10,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:26:10,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:26:10,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:26:10,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:26:10,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:26:10,021 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:26:10,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:26:10,021 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:26:10,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:26:10,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:26:10,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:26:10,022 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:26:10,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:26:10,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:26:10,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:26:10,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:26:10,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:26:10,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:26:10,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:26:10,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:26:10,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:26:10,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:26:10,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:26:10,083 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:26:10,084 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:26:10,085 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:26:10,085 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:26:10,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93950c2fc/9721c5e422974fbaafb2aae0decf9201/FLAG130d8cfaa [2019-09-08 13:26:10,806 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:26:10,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:26:10,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93950c2fc/9721c5e422974fbaafb2aae0decf9201/FLAG130d8cfaa [2019-09-08 13:26:10,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93950c2fc/9721c5e422974fbaafb2aae0decf9201 [2019-09-08 13:26:10,949 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:26:10,950 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:26:10,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:26:10,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:26:10,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:26:10,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:26:10" (1/1) ... [2019-09-08 13:26:10,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45625c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:10, skipping insertion in model container [2019-09-08 13:26:10,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:26:10" (1/1) ... [2019-09-08 13:26:10,967 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:26:11,076 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:26:12,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:26:12,097 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:26:12,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:26:12,536 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:26:12,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:12 WrapperNode [2019-09-08 13:26:12,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:26:12,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:26:12,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:26:12,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:26:12,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:12" (1/1) ... [2019-09-08 13:26:12,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:12" (1/1) ... [2019-09-08 13:26:12,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:12" (1/1) ... [2019-09-08 13:26:12,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:12" (1/1) ... [2019-09-08 13:26:12,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:12" (1/1) ... [2019-09-08 13:26:12,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:12" (1/1) ... [2019-09-08 13:26:12,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:12" (1/1) ... [2019-09-08 13:26:12,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:26:12,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:26:12,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:26:12,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:26:12,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:26:12,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:26:12,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:26:12,816 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:26:12,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:26:12,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:26:12,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:26:12,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:26:12,819 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:26:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:26:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:26:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:26:12,821 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:26:12,821 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:26:12,822 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:26:12,823 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:26:12,823 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:26:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:26:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:26:12,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:26:12,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:26:15,703 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:26:15,704 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:26:15,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:26:15 BoogieIcfgContainer [2019-09-08 13:26:15,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:26:15,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:26:15,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:26:15,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:26:15,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:26:10" (1/3) ... [2019-09-08 13:26:15,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aea7c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:26:15, skipping insertion in model container [2019-09-08 13:26:15,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:26:12" (2/3) ... [2019-09-08 13:26:15,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aea7c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:26:15, skipping insertion in model container [2019-09-08 13:26:15,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:26:15" (3/3) ... [2019-09-08 13:26:15,714 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:26:15,726 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:26:15,737 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:26:15,754 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:26:15,794 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:26:15,795 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:26:15,795 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:26:15,795 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:26:15,795 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:26:15,795 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:26:15,796 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:26:15,796 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:26:15,796 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:26:15,832 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states. [2019-09-08 13:26:15,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:26:15,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:15,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:26:15,871 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:15,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2142230737, now seen corresponding path program 1 times [2019-09-08 13:26:15,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:15,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:15,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:15,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:15,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:16,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:16,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:16,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:16,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:16,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:16,952 INFO L87 Difference]: Start difference. First operand 789 states. Second operand 3 states. [2019-09-08 13:26:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:17,265 INFO L93 Difference]: Finished difference Result 1489 states and 2621 transitions. [2019-09-08 13:26:17,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:17,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:26:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:17,334 INFO L225 Difference]: With dead ends: 1489 [2019-09-08 13:26:17,335 INFO L226 Difference]: Without dead ends: 1273 [2019-09-08 13:26:17,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:17,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2019-09-08 13:26:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1271. [2019-09-08 13:26:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-09-08 13:26:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1978 transitions. [2019-09-08 13:26:17,511 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1978 transitions. Word has length 326 [2019-09-08 13:26:17,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:17,516 INFO L475 AbstractCegarLoop]: Abstraction has 1271 states and 1978 transitions. [2019-09-08 13:26:17,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:17,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1978 transitions. [2019-09-08 13:26:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:26:17,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:17,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:26:17,533 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:17,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:17,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1353070899, now seen corresponding path program 1 times [2019-09-08 13:26:17,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:17,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:17,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:17,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:17,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:18,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:18,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:18,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:18,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:18,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:18,038 INFO L87 Difference]: Start difference. First operand 1271 states and 1978 transitions. Second operand 3 states. [2019-09-08 13:26:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:18,345 INFO L93 Difference]: Finished difference Result 2607 states and 4089 transitions. [2019-09-08 13:26:18,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:18,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:26:18,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:18,363 INFO L225 Difference]: With dead ends: 2607 [2019-09-08 13:26:18,364 INFO L226 Difference]: Without dead ends: 2225 [2019-09-08 13:26:18,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2019-09-08 13:26:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2223. [2019-09-08 13:26:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-09-08 13:26:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3452 transitions. [2019-09-08 13:26:18,466 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3452 transitions. Word has length 326 [2019-09-08 13:26:18,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:18,467 INFO L475 AbstractCegarLoop]: Abstraction has 2223 states and 3452 transitions. [2019-09-08 13:26:18,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:18,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3452 transitions. [2019-09-08 13:26:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:26:18,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:18,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:26:18,479 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:18,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:18,479 INFO L82 PathProgramCache]: Analyzing trace with hash -222925148, now seen corresponding path program 1 times [2019-09-08 13:26:18,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:18,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:18,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:18,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:18,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:18,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:18,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:18,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:18,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:18,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:18,879 INFO L87 Difference]: Start difference. First operand 2223 states and 3452 transitions. Second operand 3 states. [2019-09-08 13:26:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:19,190 INFO L93 Difference]: Finished difference Result 4803 states and 7526 transitions. [2019-09-08 13:26:19,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:19,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:26:19,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:19,218 INFO L225 Difference]: With dead ends: 4803 [2019-09-08 13:26:19,220 INFO L226 Difference]: Without dead ends: 4089 [2019-09-08 13:26:19,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2019-09-08 13:26:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 4087. [2019-09-08 13:26:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4087 states. [2019-09-08 13:26:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4087 states to 4087 states and 6332 transitions. [2019-09-08 13:26:19,462 INFO L78 Accepts]: Start accepts. Automaton has 4087 states and 6332 transitions. Word has length 326 [2019-09-08 13:26:19,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:19,463 INFO L475 AbstractCegarLoop]: Abstraction has 4087 states and 6332 transitions. [2019-09-08 13:26:19,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4087 states and 6332 transitions. [2019-09-08 13:26:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:26:19,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:19,474 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:26:19,475 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:19,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:19,475 INFO L82 PathProgramCache]: Analyzing trace with hash -806143976, now seen corresponding path program 1 times [2019-09-08 13:26:19,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:19,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:19,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:19,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:19,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:19,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:19,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:19,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:19,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:19,764 INFO L87 Difference]: Start difference. First operand 4087 states and 6332 transitions. Second operand 3 states. [2019-09-08 13:26:20,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:20,248 INFO L93 Difference]: Finished difference Result 9067 states and 14186 transitions. [2019-09-08 13:26:20,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:20,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:26:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:20,299 INFO L225 Difference]: With dead ends: 9067 [2019-09-08 13:26:20,300 INFO L226 Difference]: Without dead ends: 7737 [2019-09-08 13:26:20,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:20,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7737 states. [2019-09-08 13:26:20,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7737 to 7735. [2019-09-08 13:26:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7735 states. [2019-09-08 13:26:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7735 states to 7735 states and 11956 transitions. [2019-09-08 13:26:20,658 INFO L78 Accepts]: Start accepts. Automaton has 7735 states and 11956 transitions. Word has length 326 [2019-09-08 13:26:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:20,659 INFO L475 AbstractCegarLoop]: Abstraction has 7735 states and 11956 transitions. [2019-09-08 13:26:20,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:20,660 INFO L276 IsEmpty]: Start isEmpty. Operand 7735 states and 11956 transitions. [2019-09-08 13:26:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:26:20,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:20,683 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:26:20,683 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1950973799, now seen corresponding path program 1 times [2019-09-08 13:26:20,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:20,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:20,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:21,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:21,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:26:21,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:26:21,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:26:21,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:26:21,717 INFO L87 Difference]: Start difference. First operand 7735 states and 11956 transitions. Second operand 4 states. [2019-09-08 13:26:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:22,456 INFO L93 Difference]: Finished difference Result 22958 states and 35453 transitions. [2019-09-08 13:26:22,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:26:22,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-08 13:26:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:22,543 INFO L225 Difference]: With dead ends: 22958 [2019-09-08 13:26:22,544 INFO L226 Difference]: Without dead ends: 15238 [2019-09-08 13:26:22,566 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:26:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15238 states. [2019-09-08 13:26:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15238 to 15236. [2019-09-08 13:26:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15236 states. [2019-09-08 13:26:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15236 states to 15236 states and 23430 transitions. [2019-09-08 13:26:23,331 INFO L78 Accepts]: Start accepts. Automaton has 15236 states and 23430 transitions. Word has length 326 [2019-09-08 13:26:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:23,332 INFO L475 AbstractCegarLoop]: Abstraction has 15236 states and 23430 transitions. [2019-09-08 13:26:23,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:26:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 15236 states and 23430 transitions. [2019-09-08 13:26:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:26:23,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:23,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:26:23,365 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:23,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:23,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1588647752, now seen corresponding path program 1 times [2019-09-08 13:26:23,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:23,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:23,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:23,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:23,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:23,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:23,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:23,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:23,610 INFO L87 Difference]: Start difference. First operand 15236 states and 23430 transitions. Second operand 3 states. [2019-09-08 13:26:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:25,455 INFO L93 Difference]: Finished difference Result 44969 states and 69046 transitions. [2019-09-08 13:26:25,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:25,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-08 13:26:25,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:25,560 INFO L225 Difference]: With dead ends: 44969 [2019-09-08 13:26:25,560 INFO L226 Difference]: Without dead ends: 29862 [2019-09-08 13:26:25,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:25,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29862 states. [2019-09-08 13:26:26,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29862 to 29860. [2019-09-08 13:26:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29860 states. [2019-09-08 13:26:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29860 states to 29860 states and 45637 transitions. [2019-09-08 13:26:26,987 INFO L78 Accepts]: Start accepts. Automaton has 29860 states and 45637 transitions. Word has length 328 [2019-09-08 13:26:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:26,988 INFO L475 AbstractCegarLoop]: Abstraction has 29860 states and 45637 transitions. [2019-09-08 13:26:26,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 29860 states and 45637 transitions. [2019-09-08 13:26:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:26:27,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:27,044 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:26:27,045 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:27,050 INFO L82 PathProgramCache]: Analyzing trace with hash -144550515, now seen corresponding path program 1 times [2019-09-08 13:26:27,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:27,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:27,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:27,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:27,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:27,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:27,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:27,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:27,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:27,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:27,206 INFO L87 Difference]: Start difference. First operand 29860 states and 45637 transitions. Second operand 3 states. [2019-09-08 13:26:28,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:28,614 INFO L93 Difference]: Finished difference Result 89505 states and 136787 transitions. [2019-09-08 13:26:28,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:28,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-08 13:26:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:28,792 INFO L225 Difference]: With dead ends: 89505 [2019-09-08 13:26:28,792 INFO L226 Difference]: Without dead ends: 59687 [2019-09-08 13:26:28,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59687 states. [2019-09-08 13:26:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59687 to 29879. [2019-09-08 13:26:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29879 states. [2019-09-08 13:26:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29879 states to 29879 states and 45665 transitions. [2019-09-08 13:26:31,288 INFO L78 Accepts]: Start accepts. Automaton has 29879 states and 45665 transitions. Word has length 328 [2019-09-08 13:26:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:31,288 INFO L475 AbstractCegarLoop]: Abstraction has 29879 states and 45665 transitions. [2019-09-08 13:26:31,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 29879 states and 45665 transitions. [2019-09-08 13:26:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 13:26:31,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:31,342 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:26:31,343 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:31,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:31,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1226611437, now seen corresponding path program 1 times [2019-09-08 13:26:31,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:31,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:31,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:31,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:31,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:31,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:31,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:31,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:31,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:31,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:31,482 INFO L87 Difference]: Start difference. First operand 29879 states and 45665 transitions. Second operand 3 states. [2019-09-08 13:26:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:32,800 INFO L93 Difference]: Finished difference Result 89524 states and 136808 transitions. [2019-09-08 13:26:32,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:32,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-08 13:26:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:32,935 INFO L225 Difference]: With dead ends: 89524 [2019-09-08 13:26:32,935 INFO L226 Difference]: Without dead ends: 59705 [2019-09-08 13:26:32,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:33,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59705 states. [2019-09-08 13:26:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59705 to 29897. [2019-09-08 13:26:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29897 states. [2019-09-08 13:26:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29897 states to 29897 states and 45686 transitions. [2019-09-08 13:26:34,260 INFO L78 Accepts]: Start accepts. Automaton has 29897 states and 45686 transitions. Word has length 329 [2019-09-08 13:26:34,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:34,260 INFO L475 AbstractCegarLoop]: Abstraction has 29897 states and 45686 transitions. [2019-09-08 13:26:34,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 29897 states and 45686 transitions. [2019-09-08 13:26:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:26:34,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:34,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:26:34,295 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:34,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:34,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1870669955, now seen corresponding path program 1 times [2019-09-08 13:26:34,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:34,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:34,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:34,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:34,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:34,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:34,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:34,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:34,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:34,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:34,617 INFO L87 Difference]: Start difference. First operand 29897 states and 45686 transitions. Second operand 3 states. [2019-09-08 13:26:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:36,825 INFO L93 Difference]: Finished difference Result 84834 states and 129399 transitions. [2019-09-08 13:26:36,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:36,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 13:26:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:36,899 INFO L225 Difference]: With dead ends: 84834 [2019-09-08 13:26:36,899 INFO L226 Difference]: Without dead ends: 55182 [2019-09-08 13:26:36,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:36,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55182 states. [2019-09-08 13:26:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55182 to 55180. [2019-09-08 13:26:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55180 states. [2019-09-08 13:26:38,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55180 states to 55180 states and 83718 transitions. [2019-09-08 13:26:38,473 INFO L78 Accepts]: Start accepts. Automaton has 55180 states and 83718 transitions. Word has length 330 [2019-09-08 13:26:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:38,474 INFO L475 AbstractCegarLoop]: Abstraction has 55180 states and 83718 transitions. [2019-09-08 13:26:38,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 55180 states and 83718 transitions. [2019-09-08 13:26:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:26:38,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:38,523 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:26:38,523 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:38,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:38,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2005560288, now seen corresponding path program 1 times [2019-09-08 13:26:38,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:38,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:38,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:38,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:38,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:38,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:38,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:26:38,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:26:38,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:26:38,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:26:38,919 INFO L87 Difference]: Start difference. First operand 55180 states and 83718 transitions. Second operand 4 states. [2019-09-08 13:26:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:43,298 INFO L93 Difference]: Finished difference Result 161096 states and 244191 transitions. [2019-09-08 13:26:43,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:26:43,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-09-08 13:26:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:43,434 INFO L225 Difference]: With dead ends: 161096 [2019-09-08 13:26:43,435 INFO L226 Difference]: Without dead ends: 106456 [2019-09-08 13:26:43,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:26:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106456 states. [2019-09-08 13:26:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106456 to 55415. [2019-09-08 13:26:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55415 states. [2019-09-08 13:26:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55415 states to 55415 states and 84106 transitions. [2019-09-08 13:26:45,517 INFO L78 Accepts]: Start accepts. Automaton has 55415 states and 84106 transitions. Word has length 330 [2019-09-08 13:26:45,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:45,518 INFO L475 AbstractCegarLoop]: Abstraction has 55415 states and 84106 transitions. [2019-09-08 13:26:45,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:26:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 55415 states and 84106 transitions. [2019-09-08 13:26:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 13:26:45,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:45,821 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:26:45,821 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:45,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:45,822 INFO L82 PathProgramCache]: Analyzing trace with hash -111677560, now seen corresponding path program 1 times [2019-09-08 13:26:45,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:45,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:45,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:45,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:45,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:46,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:46,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:46,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:46,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:46,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:46,019 INFO L87 Difference]: Start difference. First operand 55415 states and 84106 transitions. Second operand 3 states. [2019-09-08 13:26:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:48,682 INFO L93 Difference]: Finished difference Result 134741 states and 206694 transitions. [2019-09-08 13:26:48,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:48,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-08 13:26:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:48,767 INFO L225 Difference]: With dead ends: 134741 [2019-09-08 13:26:48,767 INFO L226 Difference]: Without dead ends: 81081 [2019-09-08 13:26:48,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:48,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81081 states. [2019-09-08 13:26:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81081 to 70359. [2019-09-08 13:26:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70359 states. [2019-09-08 13:26:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70359 states to 70359 states and 108702 transitions. [2019-09-08 13:26:53,274 INFO L78 Accepts]: Start accepts. Automaton has 70359 states and 108702 transitions. Word has length 331 [2019-09-08 13:26:53,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:26:53,274 INFO L475 AbstractCegarLoop]: Abstraction has 70359 states and 108702 transitions. [2019-09-08 13:26:53,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:26:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 70359 states and 108702 transitions. [2019-09-08 13:26:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 13:26:53,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:26:53,307 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:26:53,308 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:26:53,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:26:53,308 INFO L82 PathProgramCache]: Analyzing trace with hash 813192752, now seen corresponding path program 1 times [2019-09-08 13:26:53,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:26:53,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:26:53,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:53,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:26:53,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:26:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:26:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:26:53,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:26:53,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:26:53,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:26:53,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:26:53,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:53,470 INFO L87 Difference]: Start difference. First operand 70359 states and 108702 transitions. Second operand 3 states. [2019-09-08 13:26:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:26:58,330 INFO L93 Difference]: Finished difference Result 209507 states and 323387 transitions. [2019-09-08 13:26:58,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:26:58,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 13:26:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:26:58,480 INFO L225 Difference]: With dead ends: 209507 [2019-09-08 13:26:58,481 INFO L226 Difference]: Without dead ends: 139951 [2019-09-08 13:26:58,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:26:58,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139951 states. [2019-09-08 13:27:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139951 to 70463. [2019-09-08 13:27:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70463 states. [2019-09-08 13:27:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70463 states to 70463 states and 108845 transitions. [2019-09-08 13:27:04,287 INFO L78 Accepts]: Start accepts. Automaton has 70463 states and 108845 transitions. Word has length 332 [2019-09-08 13:27:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:04,287 INFO L475 AbstractCegarLoop]: Abstraction has 70463 states and 108845 transitions. [2019-09-08 13:27:04,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 70463 states and 108845 transitions. [2019-09-08 13:27:04,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 13:27:04,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:04,325 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] [2019-09-08 13:27:04,326 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:04,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:04,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2066939154, now seen corresponding path program 1 times [2019-09-08 13:27:04,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:04,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:04,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:04,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:04,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:04,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:04,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:27:04,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:27:04,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:27:04,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:04,520 INFO L87 Difference]: Start difference. First operand 70463 states and 108845 transitions. Second operand 3 states. [2019-09-08 13:27:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:09,937 INFO L93 Difference]: Finished difference Result 209639 states and 323553 transitions. [2019-09-08 13:27:09,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:09,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-09-08 13:27:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:10,107 INFO L225 Difference]: With dead ends: 209639 [2019-09-08 13:27:10,107 INFO L226 Difference]: Without dead ends: 140076 [2019-09-08 13:27:10,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140076 states. [2019-09-08 13:27:16,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140076 to 70588. [2019-09-08 13:27:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70588 states. [2019-09-08 13:27:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70588 states to 70588 states and 108991 transitions. [2019-09-08 13:27:16,181 INFO L78 Accepts]: Start accepts. Automaton has 70588 states and 108991 transitions. Word has length 333 [2019-09-08 13:27:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:16,181 INFO L475 AbstractCegarLoop]: Abstraction has 70588 states and 108991 transitions. [2019-09-08 13:27:16,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 70588 states and 108991 transitions. [2019-09-08 13:27:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 13:27:16,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:16,216 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:27:16,216 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:16,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:16,216 INFO L82 PathProgramCache]: Analyzing trace with hash 243839709, now seen corresponding path program 1 times [2019-09-08 13:27:16,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:16,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:16,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:16,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:16,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:16,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:16,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:27:16,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:27:16,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:27:16,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:16,390 INFO L87 Difference]: Start difference. First operand 70588 states and 108991 transitions. Second operand 3 states. [2019-09-08 13:27:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:21,559 INFO L93 Difference]: Finished difference Result 183090 states and 284859 transitions. [2019-09-08 13:27:21,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:27:21,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-09-08 13:27:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:21,716 INFO L225 Difference]: With dead ends: 183090 [2019-09-08 13:27:21,716 INFO L226 Difference]: Without dead ends: 114798 [2019-09-08 13:27:21,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:27:21,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114798 states. [2019-09-08 13:27:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114798 to 97932. [2019-09-08 13:27:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97932 states. [2019-09-08 13:27:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97932 states to 97932 states and 153711 transitions. [2019-09-08 13:27:27,139 INFO L78 Accepts]: Start accepts. Automaton has 97932 states and 153711 transitions. Word has length 334 [2019-09-08 13:27:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:27,139 INFO L475 AbstractCegarLoop]: Abstraction has 97932 states and 153711 transitions. [2019-09-08 13:27:27,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:27:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 97932 states and 153711 transitions. [2019-09-08 13:27:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 13:27:27,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:27,176 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:27:27,177 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:27,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:27,177 INFO L82 PathProgramCache]: Analyzing trace with hash 729583107, now seen corresponding path program 1 times [2019-09-08 13:27:27,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:27,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:27,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:27,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:27,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:27,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:27,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:27,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:27:27,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:27:27,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:27:27,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:27:27,596 INFO L87 Difference]: Start difference. First operand 97932 states and 153711 transitions. Second operand 4 states. [2019-09-08 13:27:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:32,303 INFO L93 Difference]: Finished difference Result 188706 states and 296017 transitions. [2019-09-08 13:27:32,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:27:32,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2019-09-08 13:27:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:32,444 INFO L225 Difference]: With dead ends: 188706 [2019-09-08 13:27:32,444 INFO L226 Difference]: Without dead ends: 91637 [2019-09-08 13:27:32,529 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:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91637 states. [2019-09-08 13:27:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91637 to 91617. [2019-09-08 13:27:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91617 states. [2019-09-08 13:27:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91617 states to 91617 states and 143723 transitions. [2019-09-08 13:27:40,763 INFO L78 Accepts]: Start accepts. Automaton has 91617 states and 143723 transitions. Word has length 334 [2019-09-08 13:27:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:40,764 INFO L475 AbstractCegarLoop]: Abstraction has 91617 states and 143723 transitions. [2019-09-08 13:27:40,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:27:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 91617 states and 143723 transitions. [2019-09-08 13:27:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 13:27:40,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:40,798 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:27:40,798 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:40,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:40,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1706357877, now seen corresponding path program 1 times [2019-09-08 13:27:40,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:40,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:40,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:40,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:40,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:41,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:41,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:27:41,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:27:41,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:27:41,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:27:41,124 INFO L87 Difference]: Start difference. First operand 91617 states and 143723 transitions. Second operand 5 states. [2019-09-08 13:27:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:27:46,627 INFO L93 Difference]: Finished difference Result 181533 states and 284803 transitions. [2019-09-08 13:27:46,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:27:46,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 334 [2019-09-08 13:27:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:27:46,793 INFO L225 Difference]: With dead ends: 181533 [2019-09-08 13:27:46,793 INFO L226 Difference]: Without dead ends: 91617 [2019-09-08 13:27:46,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:27:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91617 states. [2019-09-08 13:27:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91617 to 91617. [2019-09-08 13:27:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91617 states. [2019-09-08 13:27:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91617 states to 91617 states and 142841 transitions. [2019-09-08 13:27:52,670 INFO L78 Accepts]: Start accepts. Automaton has 91617 states and 142841 transitions. Word has length 334 [2019-09-08 13:27:52,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:27:52,670 INFO L475 AbstractCegarLoop]: Abstraction has 91617 states and 142841 transitions. [2019-09-08 13:27:52,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:27:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 91617 states and 142841 transitions. [2019-09-08 13:27:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 13:27:52,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:27:52,711 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:27:52,712 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:27:52,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:27:52,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1438691824, now seen corresponding path program 1 times [2019-09-08 13:27:52,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:27:52,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:27:52,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:52,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:27:52,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:27:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:27:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:27:53,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:27:53,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:27:53,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:27:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:27:53,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:27:53,131 INFO L87 Difference]: Start difference. First operand 91617 states and 142841 transitions. Second operand 9 states. [2019-09-08 13:28:39,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:28:39,411 INFO L93 Difference]: Finished difference Result 637706 states and 1005084 transitions. [2019-09-08 13:28:39,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 13:28:39,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 334 [2019-09-08 13:28:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:28:40,234 INFO L225 Difference]: With dead ends: 637706 [2019-09-08 13:28:40,235 INFO L226 Difference]: Without dead ends: 599480 [2019-09-08 13:28:40,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=352, Invalid=1054, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 13:28:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599480 states. [2019-09-08 13:29:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599480 to 261706. [2019-09-08 13:29:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261706 states. [2019-09-08 13:29:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261706 states to 261706 states and 407370 transitions. [2019-09-08 13:29:06,313 INFO L78 Accepts]: Start accepts. Automaton has 261706 states and 407370 transitions. Word has length 334 [2019-09-08 13:29:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:29:06,315 INFO L475 AbstractCegarLoop]: Abstraction has 261706 states and 407370 transitions. [2019-09-08 13:29:06,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:29:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 261706 states and 407370 transitions. [2019-09-08 13:29:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 13:29:06,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:29:06,397 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:29:06,397 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:29:06,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:29:06,398 INFO L82 PathProgramCache]: Analyzing trace with hash 629698269, now seen corresponding path program 1 times [2019-09-08 13:29:06,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:29:06,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:29:06,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:06,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:29:06,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:29:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:29:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:29:06,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:29:06,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:29:06,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:29:06,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:29:06,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:29:06,957 INFO L87 Difference]: Start difference. First operand 261706 states and 407370 transitions. Second operand 4 states. [2019-09-08 13:29:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:29:45,912 INFO L93 Difference]: Finished difference Result 775269 states and 1208015 transitions. [2019-09-08 13:29:45,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:29:45,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2019-09-08 13:29:45,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:29:46,716 INFO L225 Difference]: With dead ends: 775269 [2019-09-08 13:29:46,716 INFO L226 Difference]: Without dead ends: 513635 [2019-09-08 13:29:46,921 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:29:47,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513635 states. [2019-09-08 13:30:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513635 to 513633. [2019-09-08 13:30:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513633 states. [2019-09-08 13:30:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513633 states to 513633 states and 797816 transitions. [2019-09-08 13:30:38,270 INFO L78 Accepts]: Start accepts. Automaton has 513633 states and 797816 transitions. Word has length 334 [2019-09-08 13:30:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:30:38,270 INFO L475 AbstractCegarLoop]: Abstraction has 513633 states and 797816 transitions. [2019-09-08 13:30:38,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:30:38,271 INFO L276 IsEmpty]: Start isEmpty. Operand 513633 states and 797816 transitions. [2019-09-08 13:30:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 13:30:38,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:30:38,467 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:30:38,467 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:30:38,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:30:38,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1208008503, now seen corresponding path program 1 times [2019-09-08 13:30:38,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:30:38,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:30:38,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:38,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:30:38,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:30:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:30:38,704 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:30:38,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:30:38,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:30:38,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:30:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:30:38,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:30:38,710 INFO L87 Difference]: Start difference. First operand 513633 states and 797816 transitions. Second operand 3 states. [2019-09-08 13:32:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:32:04,585 INFO L93 Difference]: Finished difference Result 1516259 states and 2352828 transitions. [2019-09-08 13:32:04,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:32:04,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-08 13:32:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:32:06,411 INFO L225 Difference]: With dead ends: 1516259 [2019-09-08 13:32:06,411 INFO L226 Difference]: Without dead ends: 1003875 [2019-09-08 13:32:06,845 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:32:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003875 states. [2019-09-08 13:33:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003875 to 1003873. [2019-09-08 13:33:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003873 states. [2019-09-08 13:34:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003873 states to 1003873 states and 1550610 transitions. [2019-09-08 13:34:01,968 INFO L78 Accepts]: Start accepts. Automaton has 1003873 states and 1550610 transitions. Word has length 336 [2019-09-08 13:34:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:34:01,968 INFO L475 AbstractCegarLoop]: Abstraction has 1003873 states and 1550610 transitions. [2019-09-08 13:34:01,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:34:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1003873 states and 1550610 transitions. [2019-09-08 13:34:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-08 13:34:02,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:34:02,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:34:02,365 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:34:02,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:34:02,365 INFO L82 PathProgramCache]: Analyzing trace with hash -832025506, now seen corresponding path program 1 times [2019-09-08 13:34:02,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:34:02,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:34:02,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:02,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:34:02,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:34:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:34:02,562 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:34:02,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:34:02,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:34:02,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:34:02,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:34:02,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:34:02,564 INFO L87 Difference]: Start difference. First operand 1003873 states and 1550610 transitions. Second operand 3 states. [2019-09-08 13:36:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:36:52,704 INFO L93 Difference]: Finished difference Result 2705789 states and 4206756 transitions. [2019-09-08 13:36:52,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:36:52,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 338 [2019-09-08 13:36:52,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:36:55,608 INFO L225 Difference]: With dead ends: 2705789 [2019-09-08 13:36:55,608 INFO L226 Difference]: Without dead ends: 1710179 [2019-09-08 13:36:56,249 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:36:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710179 states.