java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:51:18,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:51:18,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:51:18,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:51:18,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:51:18,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:51:18,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:51:18,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:51:18,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:51:18,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:51:18,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:51:18,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:51:18,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:51:18,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:51:18,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:51:18,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:51:18,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:51:18,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:51:18,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:51:18,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:51:18,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:51:18,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:51:18,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:51:18,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:51:18,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:51:18,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:51:18,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:51:18,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:51:18,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:51:18,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:51:18,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:51:18,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:51:18,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:51:18,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:51:18,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:51:18,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:51:18,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:51:18,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:51:18,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:51:18,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:51:18,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:51:18,846 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 09:51:18,861 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:51:18,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:51:18,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:51:18,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:51:18,863 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:51:18,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:51:18,863 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:51:18,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:51:18,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:51:18,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:51:18,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:51:18,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:51:18,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:51:18,865 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:51:18,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:51:18,865 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:51:18,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:51:18,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:51:18,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:51:18,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:51:18,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:51:18,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:51:18,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:51:18,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:51:18,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:51:18,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:51:18,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:51:18,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:51:18,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:51:18,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:51:18,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:51:18,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:51:18,930 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:51:18,930 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:51:18,931 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:51:18,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8f045c8/30ad30138cc64ebcb65ab3d60a6f7894/FLAG58ca893e3 [2019-09-08 09:51:19,586 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:51:19,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:51:19,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8f045c8/30ad30138cc64ebcb65ab3d60a6f7894/FLAG58ca893e3 [2019-09-08 09:51:19,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff8f045c8/30ad30138cc64ebcb65ab3d60a6f7894 [2019-09-08 09:51:19,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:51:19,790 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:51:19,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:51:19,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:51:19,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:51:19,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:51:19" (1/1) ... [2019-09-08 09:51:19,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199df138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:19, skipping insertion in model container [2019-09-08 09:51:19,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:51:19" (1/1) ... [2019-09-08 09:51:19,809 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:51:19,893 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:51:20,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:51:20,661 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:51:21,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:51:21,171 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:51:21,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:21 WrapperNode [2019-09-08 09:51:21,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:51:21,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:51:21,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:51:21,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:51:21,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:21" (1/1) ... [2019-09-08 09:51:21,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:21" (1/1) ... [2019-09-08 09:51:21,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:21" (1/1) ... [2019-09-08 09:51:21,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:21" (1/1) ... [2019-09-08 09:51:21,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:21" (1/1) ... [2019-09-08 09:51:21,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:21" (1/1) ... [2019-09-08 09:51:21,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:21" (1/1) ... [2019-09-08 09:51:21,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:51:21,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:51:21,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:51:21,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:51:21,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:21" (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 09:51:21,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:51:21,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:51:21,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:51:21,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:51:21,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:51:21,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 09:51:21,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:51:21,427 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:51:21,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:51:21,428 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:51:21,428 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:51:21,429 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:51:21,430 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:51:21,430 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:51:21,431 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:51:21,431 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:51:21,434 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:51:21,434 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:51:21,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:51:21,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:51:23,592 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:51:23,593 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:51:23,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:51:23 BoogieIcfgContainer [2019-09-08 09:51:23,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:51:23,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:51:23,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:51:23,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:51:23,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:51:19" (1/3) ... [2019-09-08 09:51:23,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dc3979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:51:23, skipping insertion in model container [2019-09-08 09:51:23,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:51:21" (2/3) ... [2019-09-08 09:51:23,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dc3979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:51:23, skipping insertion in model container [2019-09-08 09:51:23,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:51:23" (3/3) ... [2019-09-08 09:51:23,609 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 09:51:23,619 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:51:23,649 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:51:23,670 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:51:23,708 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:51:23,709 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:51:23,710 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:51:23,710 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:51:23,710 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:51:23,710 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:51:23,710 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:51:23,710 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:51:23,711 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:51:23,743 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states. [2019-09-08 09:51:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 09:51:23,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:23,783 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] [2019-09-08 09:51:23,811 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:23,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:23,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1805579482, now seen corresponding path program 1 times [2019-09-08 09:51:23,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:23,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:23,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:23,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:23,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:25,069 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 09:51:25,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:25,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:25,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:25,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:25,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:25,127 INFO L87 Difference]: Start difference. First operand 597 states. Second operand 4 states. [2019-09-08 09:51:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:25,520 INFO L93 Difference]: Finished difference Result 1748 states and 3113 transitions. [2019-09-08 09:51:25,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:51:25,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-09-08 09:51:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:25,564 INFO L225 Difference]: With dead ends: 1748 [2019-09-08 09:51:25,565 INFO L226 Difference]: Without dead ends: 1158 [2019-09-08 09:51:25,580 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 09:51:25,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-09-08 09:51:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2019-09-08 09:51:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-09-08 09:51:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1799 transitions. [2019-09-08 09:51:25,734 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1799 transitions. Word has length 242 [2019-09-08 09:51:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:25,735 INFO L475 AbstractCegarLoop]: Abstraction has 1156 states and 1799 transitions. [2019-09-08 09:51:25,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1799 transitions. [2019-09-08 09:51:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 09:51:25,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:25,746 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:25,747 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1891237145, now seen corresponding path program 1 times [2019-09-08 09:51:25,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:25,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:25,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:25,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:25,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:26,010 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 09:51:26,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:26,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:26,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:26,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:26,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:26,016 INFO L87 Difference]: Start difference. First operand 1156 states and 1799 transitions. Second operand 3 states. [2019-09-08 09:51:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:26,201 INFO L93 Difference]: Finished difference Result 3295 states and 5101 transitions. [2019-09-08 09:51:26,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:26,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-09-08 09:51:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:26,216 INFO L225 Difference]: With dead ends: 3295 [2019-09-08 09:51:26,217 INFO L226 Difference]: Without dead ends: 2268 [2019-09-08 09:51:26,221 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 09:51:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2019-09-08 09:51:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2266. [2019-09-08 09:51:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2266 states. [2019-09-08 09:51:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 3511 transitions. [2019-09-08 09:51:26,407 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 3511 transitions. Word has length 244 [2019-09-08 09:51:26,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:26,408 INFO L475 AbstractCegarLoop]: Abstraction has 2266 states and 3511 transitions. [2019-09-08 09:51:26,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 3511 transitions. [2019-09-08 09:51:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-08 09:51:26,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:26,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:26,416 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:26,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:26,416 INFO L82 PathProgramCache]: Analyzing trace with hash 188235180, now seen corresponding path program 1 times [2019-09-08 09:51:26,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:26,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:26,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:26,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:26,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:26,528 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 09:51:26,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:26,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:26,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:26,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:26,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:26,531 INFO L87 Difference]: Start difference. First operand 2266 states and 3511 transitions. Second operand 3 states. [2019-09-08 09:51:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:26,710 INFO L93 Difference]: Finished difference Result 6723 states and 10409 transitions. [2019-09-08 09:51:26,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:26,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-09-08 09:51:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:26,734 INFO L225 Difference]: With dead ends: 6723 [2019-09-08 09:51:26,735 INFO L226 Difference]: Without dead ends: 4499 [2019-09-08 09:51:26,741 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 09:51:26,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4499 states. [2019-09-08 09:51:26,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4499 to 2285. [2019-09-08 09:51:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2019-09-08 09:51:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3539 transitions. [2019-09-08 09:51:26,893 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3539 transitions. Word has length 244 [2019-09-08 09:51:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:26,896 INFO L475 AbstractCegarLoop]: Abstraction has 2285 states and 3539 transitions. [2019-09-08 09:51:26,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3539 transitions. [2019-09-08 09:51:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 09:51:26,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:26,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:26,904 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:26,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1417900010, now seen corresponding path program 1 times [2019-09-08 09:51:26,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:26,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:26,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:26,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:26,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:27,081 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 09:51:27,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:27,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:27,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:27,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:27,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:27,083 INFO L87 Difference]: Start difference. First operand 2285 states and 3539 transitions. Second operand 3 states. [2019-09-08 09:51:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:27,321 INFO L93 Difference]: Finished difference Result 6742 states and 10430 transitions. [2019-09-08 09:51:27,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:27,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-08 09:51:27,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:27,345 INFO L225 Difference]: With dead ends: 6742 [2019-09-08 09:51:27,345 INFO L226 Difference]: Without dead ends: 4517 [2019-09-08 09:51:27,354 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 09:51:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-09-08 09:51:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 2303. [2019-09-08 09:51:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2303 states. [2019-09-08 09:51:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 3560 transitions. [2019-09-08 09:51:27,514 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 3560 transitions. Word has length 245 [2019-09-08 09:51:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:27,515 INFO L475 AbstractCegarLoop]: Abstraction has 2303 states and 3560 transitions. [2019-09-08 09:51:27,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 3560 transitions. [2019-09-08 09:51:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 09:51:27,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:27,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] [2019-09-08 09:51:27,523 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:27,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:27,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1581384449, now seen corresponding path program 1 times [2019-09-08 09:51:27,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:27,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:27,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:27,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:27,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:27,947 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 09:51:27,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:27,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:27,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:27,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:27,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:27,949 INFO L87 Difference]: Start difference. First operand 2303 states and 3560 transitions. Second operand 4 states. [2019-09-08 09:51:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:28,345 INFO L93 Difference]: Finished difference Result 6418 states and 9835 transitions. [2019-09-08 09:51:28,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:28,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-08 09:51:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:28,377 INFO L225 Difference]: With dead ends: 6418 [2019-09-08 09:51:28,377 INFO L226 Difference]: Without dead ends: 4444 [2019-09-08 09:51:28,383 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 09:51:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4444 states. [2019-09-08 09:51:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4444 to 2510. [2019-09-08 09:51:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2510 states. [2019-09-08 09:51:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 3913 transitions. [2019-09-08 09:51:28,603 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 3913 transitions. Word has length 246 [2019-09-08 09:51:28,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:28,604 INFO L475 AbstractCegarLoop]: Abstraction has 2510 states and 3913 transitions. [2019-09-08 09:51:28,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:28,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3913 transitions. [2019-09-08 09:51:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 09:51:28,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:28,615 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] [2019-09-08 09:51:28,615 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:28,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:28,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1228474142, now seen corresponding path program 1 times [2019-09-08 09:51:28,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:28,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:28,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:28,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:28,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:28,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 09:51:28,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:28,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:28,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:28,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:28,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:28,878 INFO L87 Difference]: Start difference. First operand 2510 states and 3913 transitions. Second operand 3 states. [2019-09-08 09:51:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:29,275 INFO L93 Difference]: Finished difference Result 6753 states and 10409 transitions. [2019-09-08 09:51:29,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:29,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-08 09:51:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:29,300 INFO L225 Difference]: With dead ends: 6753 [2019-09-08 09:51:29,300 INFO L226 Difference]: Without dead ends: 4663 [2019-09-08 09:51:29,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2019-09-08 09:51:29,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4661. [2019-09-08 09:51:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-09-08 09:51:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 7180 transitions. [2019-09-08 09:51:29,616 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 7180 transitions. Word has length 246 [2019-09-08 09:51:29,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:29,617 INFO L475 AbstractCegarLoop]: Abstraction has 4661 states and 7180 transitions. [2019-09-08 09:51:29,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 7180 transitions. [2019-09-08 09:51:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 09:51:29,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:29,629 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] [2019-09-08 09:51:29,630 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:29,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:29,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1567601631, now seen corresponding path program 1 times [2019-09-08 09:51:29,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:29,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:29,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:29,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:29,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:29,769 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 09:51:29,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:29,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:29,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:29,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:29,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:29,772 INFO L87 Difference]: Start difference. First operand 4661 states and 7180 transitions. Second operand 3 states. [2019-09-08 09:51:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:30,268 INFO L93 Difference]: Finished difference Result 12413 states and 18821 transitions. [2019-09-08 09:51:30,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:30,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-09-08 09:51:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:30,315 INFO L225 Difference]: With dead ends: 12413 [2019-09-08 09:51:30,315 INFO L226 Difference]: Without dead ends: 8555 [2019-09-08 09:51:30,324 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 09:51:30,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8555 states. [2019-09-08 09:51:30,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8555 to 4765. [2019-09-08 09:51:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4765 states. [2019-09-08 09:51:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4765 states to 4765 states and 7323 transitions. [2019-09-08 09:51:30,642 INFO L78 Accepts]: Start accepts. Automaton has 4765 states and 7323 transitions. Word has length 248 [2019-09-08 09:51:30,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:30,643 INFO L475 AbstractCegarLoop]: Abstraction has 4765 states and 7323 transitions. [2019-09-08 09:51:30,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4765 states and 7323 transitions. [2019-09-08 09:51:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 09:51:30,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:30,655 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] [2019-09-08 09:51:30,655 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash -711296855, now seen corresponding path program 1 times [2019-09-08 09:51:30,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:30,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:30,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:30,779 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 09:51:30,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:30,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:30,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:30,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:30,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:30,781 INFO L87 Difference]: Start difference. First operand 4765 states and 7323 transitions. Second operand 3 states. [2019-09-08 09:51:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:31,264 INFO L93 Difference]: Finished difference Result 12545 states and 18987 transitions. [2019-09-08 09:51:31,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:31,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-09-08 09:51:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:31,290 INFO L225 Difference]: With dead ends: 12545 [2019-09-08 09:51:31,291 INFO L226 Difference]: Without dead ends: 8680 [2019-09-08 09:51:31,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8680 states. [2019-09-08 09:51:31,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8680 to 4890. [2019-09-08 09:51:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4890 states. [2019-09-08 09:51:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 7469 transitions. [2019-09-08 09:51:31,665 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 7469 transitions. Word has length 249 [2019-09-08 09:51:31,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:31,665 INFO L475 AbstractCegarLoop]: Abstraction has 4890 states and 7469 transitions. [2019-09-08 09:51:31,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 7469 transitions. [2019-09-08 09:51:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 09:51:31,678 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:31,678 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:31,679 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:31,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:31,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1016842344, now seen corresponding path program 1 times [2019-09-08 09:51:31,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:31,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:31,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:31,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:31,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:32,172 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 09:51:32,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:32,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:32,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:32,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:32,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:32,175 INFO L87 Difference]: Start difference. First operand 4890 states and 7469 transitions. Second operand 4 states. [2019-09-08 09:51:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:32,834 INFO L93 Difference]: Finished difference Result 14159 states and 21573 transitions. [2019-09-08 09:51:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:32,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2019-09-08 09:51:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:32,857 INFO L225 Difference]: With dead ends: 14159 [2019-09-08 09:51:32,858 INFO L226 Difference]: Without dead ends: 9341 [2019-09-08 09:51:32,871 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 09:51:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9341 states. [2019-09-08 09:51:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9341 to 9339. [2019-09-08 09:51:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9339 states. [2019-09-08 09:51:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9339 states to 9339 states and 14120 transitions. [2019-09-08 09:51:33,461 INFO L78 Accepts]: Start accepts. Automaton has 9339 states and 14120 transitions. Word has length 250 [2019-09-08 09:51:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:33,462 INFO L475 AbstractCegarLoop]: Abstraction has 9339 states and 14120 transitions. [2019-09-08 09:51:33,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 9339 states and 14120 transitions. [2019-09-08 09:51:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 09:51:33,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:33,487 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] [2019-09-08 09:51:33,488 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:33,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1376714134, now seen corresponding path program 1 times [2019-09-08 09:51:33,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:33,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:33,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:33,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:33,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:33,676 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 09:51:33,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:33,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:33,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:33,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:33,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:33,678 INFO L87 Difference]: Start difference. First operand 9339 states and 14120 transitions. Second operand 3 states. [2019-09-08 09:51:34,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:34,826 INFO L93 Difference]: Finished difference Result 25717 states and 38492 transitions. [2019-09-08 09:51:34,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:34,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-09-08 09:51:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:35,402 INFO L225 Difference]: With dead ends: 25717 [2019-09-08 09:51:35,402 INFO L226 Difference]: Without dead ends: 17867 [2019-09-08 09:51:35,417 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 09:51:35,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17867 states. [2019-09-08 09:51:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17867 to 17865. [2019-09-08 09:51:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17865 states. [2019-09-08 09:51:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17865 states to 17865 states and 26711 transitions. [2019-09-08 09:51:36,305 INFO L78 Accepts]: Start accepts. Automaton has 17865 states and 26711 transitions. Word has length 252 [2019-09-08 09:51:36,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:36,305 INFO L475 AbstractCegarLoop]: Abstraction has 17865 states and 26711 transitions. [2019-09-08 09:51:36,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 17865 states and 26711 transitions. [2019-09-08 09:51:36,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 09:51:36,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:36,334 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] [2019-09-08 09:51:36,335 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:36,335 INFO L82 PathProgramCache]: Analyzing trace with hash 399898916, now seen corresponding path program 1 times [2019-09-08 09:51:36,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:36,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:36,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:36,668 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 09:51:36,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:36,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:36,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:36,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:36,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:36,671 INFO L87 Difference]: Start difference. First operand 17865 states and 26711 transitions. Second operand 4 states. [2019-09-08 09:51:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:37,471 INFO L93 Difference]: Finished difference Result 31171 states and 46363 transitions. [2019-09-08 09:51:37,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:37,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-09-08 09:51:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:37,511 INFO L225 Difference]: With dead ends: 31171 [2019-09-08 09:51:37,512 INFO L226 Difference]: Without dead ends: 15583 [2019-09-08 09:51:37,538 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 09:51:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15583 states. [2019-09-08 09:51:38,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15583 to 15507. [2019-09-08 09:51:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15507 states. [2019-09-08 09:51:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15507 states to 15507 states and 23244 transitions. [2019-09-08 09:51:38,546 INFO L78 Accepts]: Start accepts. Automaton has 15507 states and 23244 transitions. Word has length 252 [2019-09-08 09:51:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:38,547 INFO L475 AbstractCegarLoop]: Abstraction has 15507 states and 23244 transitions. [2019-09-08 09:51:38,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 15507 states and 23244 transitions. [2019-09-08 09:51:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 09:51:38,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:38,571 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] [2019-09-08 09:51:38,571 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:38,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:38,572 INFO L82 PathProgramCache]: Analyzing trace with hash -802252847, now seen corresponding path program 1 times [2019-09-08 09:51:38,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:38,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:38,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:38,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:38,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:38,764 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 09:51:38,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:38,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:38,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:38,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:38,766 INFO L87 Difference]: Start difference. First operand 15507 states and 23244 transitions. Second operand 3 states. [2019-09-08 09:51:39,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:39,973 INFO L93 Difference]: Finished difference Result 44352 states and 66156 transitions. [2019-09-08 09:51:39,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:39,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-08 09:51:39,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:40,038 INFO L225 Difference]: With dead ends: 44352 [2019-09-08 09:51:40,038 INFO L226 Difference]: Without dead ends: 30192 [2019-09-08 09:51:40,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30192 states. [2019-09-08 09:51:42,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30192 to 30190. [2019-09-08 09:51:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30190 states. [2019-09-08 09:51:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30190 states to 30190 states and 44899 transitions. [2019-09-08 09:51:42,187 INFO L78 Accepts]: Start accepts. Automaton has 30190 states and 44899 transitions. Word has length 254 [2019-09-08 09:51:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:42,187 INFO L475 AbstractCegarLoop]: Abstraction has 30190 states and 44899 transitions. [2019-09-08 09:51:42,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 30190 states and 44899 transitions. [2019-09-08 09:51:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 09:51:42,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:42,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] [2019-09-08 09:51:42,216 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:42,217 INFO L82 PathProgramCache]: Analyzing trace with hash -51949010, now seen corresponding path program 1 times [2019-09-08 09:51:42,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:42,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:42,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:42,490 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 09:51:42,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:42,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:42,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:42,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:42,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:42,493 INFO L87 Difference]: Start difference. First operand 30190 states and 44899 transitions. Second operand 4 states. [2019-09-08 09:51:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:44,598 INFO L93 Difference]: Finished difference Result 76148 states and 112384 transitions. [2019-09-08 09:51:44,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:44,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-09-08 09:51:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:44,662 INFO L225 Difference]: With dead ends: 76148 [2019-09-08 09:51:44,663 INFO L226 Difference]: Without dead ends: 49250 [2019-09-08 09:51:44,699 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 09:51:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49250 states. [2019-09-08 09:51:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49250 to 29746. [2019-09-08 09:51:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29746 states. [2019-09-08 09:51:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29746 states to 29746 states and 44285 transitions. [2019-09-08 09:51:47,357 INFO L78 Accepts]: Start accepts. Automaton has 29746 states and 44285 transitions. Word has length 254 [2019-09-08 09:51:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:47,357 INFO L475 AbstractCegarLoop]: Abstraction has 29746 states and 44285 transitions. [2019-09-08 09:51:47,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 29746 states and 44285 transitions. [2019-09-08 09:51:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 09:51:47,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:47,378 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] [2019-09-08 09:51:47,379 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1988595598, now seen corresponding path program 1 times [2019-09-08 09:51:47,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:47,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:47,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:47,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:47,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:47,499 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 09:51:47,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:47,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:51:47,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:51:47,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:51:47,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:51:47,502 INFO L87 Difference]: Start difference. First operand 29746 states and 44285 transitions. Second operand 3 states. [2019-09-08 09:51:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:50,165 INFO L93 Difference]: Finished difference Result 74304 states and 109704 transitions. [2019-09-08 09:51:50,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:51:50,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-09-08 09:51:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:50,227 INFO L225 Difference]: With dead ends: 74304 [2019-09-08 09:51:50,227 INFO L226 Difference]: Without dead ends: 50054 [2019-09-08 09:51:50,266 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 09:51:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50054 states. [2019-09-08 09:51:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50054 to 30227. [2019-09-08 09:51:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30227 states. [2019-09-08 09:51:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30227 states to 30227 states and 44883 transitions. [2019-09-08 09:51:52,039 INFO L78 Accepts]: Start accepts. Automaton has 30227 states and 44883 transitions. Word has length 257 [2019-09-08 09:51:52,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:52,039 INFO L475 AbstractCegarLoop]: Abstraction has 30227 states and 44883 transitions. [2019-09-08 09:51:52,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:51:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 30227 states and 44883 transitions. [2019-09-08 09:51:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 09:51:52,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:52,065 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:51:52,065 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:52,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:52,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1033879136, now seen corresponding path program 1 times [2019-09-08 09:51:52,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:52,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:52,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:52,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:52,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:52,300 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 09:51:52,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:52,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:52,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:52,302 INFO L87 Difference]: Start difference. First operand 30227 states and 44883 transitions. Second operand 4 states. [2019-09-08 09:51:53,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:53,557 INFO L93 Difference]: Finished difference Result 52122 states and 76884 transitions. [2019-09-08 09:51:53,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:53,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-09-08 09:51:53,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:53,590 INFO L225 Difference]: With dead ends: 52122 [2019-09-08 09:51:53,590 INFO L226 Difference]: Without dead ends: 27207 [2019-09-08 09:51:53,631 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 09:51:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27207 states. [2019-09-08 09:51:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27207 to 26880. [2019-09-08 09:51:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26880 states. [2019-09-08 09:51:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26880 states to 26880 states and 39940 transitions. [2019-09-08 09:51:55,951 INFO L78 Accepts]: Start accepts. Automaton has 26880 states and 39940 transitions. Word has length 258 [2019-09-08 09:51:55,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:55,951 INFO L475 AbstractCegarLoop]: Abstraction has 26880 states and 39940 transitions. [2019-09-08 09:51:55,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:51:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 26880 states and 39940 transitions. [2019-09-08 09:51:55,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 09:51:55,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:55,976 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] [2019-09-08 09:51:55,977 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:55,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:55,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1950765324, now seen corresponding path program 1 times [2019-09-08 09:51:55,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:55,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:55,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:55,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:55,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:56,395 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 09:51:56,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:56,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:51:56,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:51:56,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:51:56,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:51:56,400 INFO L87 Difference]: Start difference. First operand 26880 states and 39940 transitions. Second operand 4 states. [2019-09-08 09:51:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:59,026 INFO L93 Difference]: Finished difference Result 76376 states and 113194 transitions. [2019-09-08 09:51:59,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:51:59,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-09-08 09:51:59,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:59,077 INFO L225 Difference]: With dead ends: 76376 [2019-09-08 09:51:59,077 INFO L226 Difference]: Without dead ends: 49714 [2019-09-08 09:51:59,110 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 09:51:59,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49714 states. [2019-09-08 09:52:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49714 to 49712. [2019-09-08 09:52:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49712 states. [2019-09-08 09:52:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49712 states to 49712 states and 73116 transitions. [2019-09-08 09:52:01,740 INFO L78 Accepts]: Start accepts. Automaton has 49712 states and 73116 transitions. Word has length 258 [2019-09-08 09:52:01,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:01,740 INFO L475 AbstractCegarLoop]: Abstraction has 49712 states and 73116 transitions. [2019-09-08 09:52:01,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:52:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 49712 states and 73116 transitions. [2019-09-08 09:52:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 09:52:01,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:01,775 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] [2019-09-08 09:52:01,775 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:01,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1669371985, now seen corresponding path program 1 times [2019-09-08 09:52:01,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:01,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:01,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:01,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:01,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:01,975 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 09:52:01,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:01,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:01,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:01,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:01,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:01,977 INFO L87 Difference]: Start difference. First operand 49712 states and 73116 transitions. Second operand 3 states. [2019-09-08 09:52:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:07,204 INFO L93 Difference]: Finished difference Result 141860 states and 207505 transitions. [2019-09-08 09:52:07,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:07,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-08 09:52:07,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:07,298 INFO L225 Difference]: With dead ends: 141860 [2019-09-08 09:52:07,298 INFO L226 Difference]: Without dead ends: 96825 [2019-09-08 09:52:07,336 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 09:52:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96825 states. [2019-09-08 09:52:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96825 to 96571. [2019-09-08 09:52:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96571 states. [2019-09-08 09:52:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96571 states to 96571 states and 140800 transitions. [2019-09-08 09:52:13,974 INFO L78 Accepts]: Start accepts. Automaton has 96571 states and 140800 transitions. Word has length 260 [2019-09-08 09:52:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:13,974 INFO L475 AbstractCegarLoop]: Abstraction has 96571 states and 140800 transitions. [2019-09-08 09:52:13,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 96571 states and 140800 transitions. [2019-09-08 09:52:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 09:52:14,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:14,040 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:14,040 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:14,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:14,040 INFO L82 PathProgramCache]: Analyzing trace with hash -571126073, now seen corresponding path program 1 times [2019-09-08 09:52:14,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:14,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:14,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:14,323 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 09:52:14,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:14,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:52:14,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:52:14,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:52:14,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:52:14,325 INFO L87 Difference]: Start difference. First operand 96571 states and 140800 transitions. Second operand 4 states. [2019-09-08 09:52:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:21,848 INFO L93 Difference]: Finished difference Result 233718 states and 339008 transitions. [2019-09-08 09:52:21,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:52:21,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-09-08 09:52:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:22,005 INFO L225 Difference]: With dead ends: 233718 [2019-09-08 09:52:22,005 INFO L226 Difference]: Without dead ends: 152040 [2019-09-08 09:52:22,070 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 09:52:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152040 states. [2019-09-08 09:52:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152040 to 96350. [2019-09-08 09:52:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96350 states. [2019-09-08 09:52:30,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96350 states to 96350 states and 140686 transitions. [2019-09-08 09:52:30,055 INFO L78 Accepts]: Start accepts. Automaton has 96350 states and 140686 transitions. Word has length 262 [2019-09-08 09:52:30,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:30,055 INFO L475 AbstractCegarLoop]: Abstraction has 96350 states and 140686 transitions. [2019-09-08 09:52:30,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:52:30,055 INFO L276 IsEmpty]: Start isEmpty. Operand 96350 states and 140686 transitions. [2019-09-08 09:52:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 09:52:30,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:30,118 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:30,118 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:30,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:30,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1668510166, now seen corresponding path program 1 times [2019-09-08 09:52:30,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:30,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:30,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:30,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:30,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:30,307 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 09:52:30,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:30,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:30,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:30,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:30,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:30,310 INFO L87 Difference]: Start difference. First operand 96350 states and 140686 transitions. Second operand 3 states. [2019-09-08 09:52:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:52:39,926 INFO L93 Difference]: Finished difference Result 262247 states and 380683 transitions. [2019-09-08 09:52:39,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:52:39,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-09-08 09:52:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:52:40,128 INFO L225 Difference]: With dead ends: 262247 [2019-09-08 09:52:40,128 INFO L226 Difference]: Without dead ends: 181425 [2019-09-08 09:52:40,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:40,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181425 states. [2019-09-08 09:52:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181425 to 181423. [2019-09-08 09:52:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181423 states. [2019-09-08 09:52:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181423 states to 181423 states and 262579 transitions. [2019-09-08 09:52:53,290 INFO L78 Accepts]: Start accepts. Automaton has 181423 states and 262579 transitions. Word has length 262 [2019-09-08 09:52:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:52:53,290 INFO L475 AbstractCegarLoop]: Abstraction has 181423 states and 262579 transitions. [2019-09-08 09:52:53,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:52:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 181423 states and 262579 transitions. [2019-09-08 09:52:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 09:52:53,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:52:53,413 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:52:53,413 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:52:53,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:52:53,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2019923775, now seen corresponding path program 1 times [2019-09-08 09:52:53,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:52:53,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:52:53,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:53,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:52:53,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:52:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:52:53,524 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 09:52:53,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:52:53,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:52:53,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:52:53,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:52:53,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:52:53,526 INFO L87 Difference]: Start difference. First operand 181423 states and 262579 transitions. Second operand 3 states. [2019-09-08 09:53:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:53:12,106 INFO L93 Difference]: Finished difference Result 433844 states and 622391 transitions. [2019-09-08 09:53:12,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:53:12,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-08 09:53:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:53:12,423 INFO L225 Difference]: With dead ends: 433844 [2019-09-08 09:53:12,423 INFO L226 Difference]: Without dead ends: 291241 [2019-09-08 09:53:12,527 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 09:53:12,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291241 states. [2019-09-08 09:53:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291241 to 180883. [2019-09-08 09:53:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180883 states. [2019-09-08 09:53:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180883 states to 180883 states and 260981 transitions. [2019-09-08 09:53:25,997 INFO L78 Accepts]: Start accepts. Automaton has 180883 states and 260981 transitions. Word has length 265 [2019-09-08 09:53:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:53:25,998 INFO L475 AbstractCegarLoop]: Abstraction has 180883 states and 260981 transitions. [2019-09-08 09:53:25,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:53:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 180883 states and 260981 transitions. [2019-09-08 09:53:26,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 09:53:26,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:53:26,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:53:26,123 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:53:26,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:53:26,123 INFO L82 PathProgramCache]: Analyzing trace with hash 296119333, now seen corresponding path program 1 times [2019-09-08 09:53:26,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:53:26,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:53:26,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:26,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:53:26,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:53:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:53:26,244 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 09:53:26,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:53:26,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:53:26,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:53:26,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:53:26,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:53:26,246 INFO L87 Difference]: Start difference. First operand 180883 states and 260981 transitions. Second operand 3 states. [2019-09-08 09:53:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:53:46,141 INFO L93 Difference]: Finished difference Result 390791 states and 564087 transitions. [2019-09-08 09:53:46,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:53:46,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2019-09-08 09:53:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:53:46,457 INFO L225 Difference]: With dead ends: 390791 [2019-09-08 09:53:46,457 INFO L226 Difference]: Without dead ends: 291805 [2019-09-08 09:53:46,544 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 09:53:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291805 states. [2019-09-08 09:54:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291805 to 291803. [2019-09-08 09:54:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291803 states. [2019-09-08 09:54:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291803 states to 291803 states and 418549 transitions. [2019-09-08 09:54:10,805 INFO L78 Accepts]: Start accepts. Automaton has 291803 states and 418549 transitions. Word has length 266 [2019-09-08 09:54:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:10,805 INFO L475 AbstractCegarLoop]: Abstraction has 291803 states and 418549 transitions. [2019-09-08 09:54:10,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 291803 states and 418549 transitions. [2019-09-08 09:54:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 09:54:11,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:11,038 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:11,039 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:11,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:11,039 INFO L82 PathProgramCache]: Analyzing trace with hash -777275510, now seen corresponding path program 1 times [2019-09-08 09:54:11,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:11,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:11,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:11,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:11,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:11,442 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 09:54:11,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:11,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:11,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:11,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:11,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:11,444 INFO L87 Difference]: Start difference. First operand 291803 states and 418549 transitions. Second operand 4 states. [2019-09-08 09:54:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:58,167 INFO L93 Difference]: Finished difference Result 858304 states and 1228109 transitions. [2019-09-08 09:54:58,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:58,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-09-08 09:54:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:58,859 INFO L225 Difference]: With dead ends: 858304 [2019-09-08 09:54:58,859 INFO L226 Difference]: Without dead ends: 567084 [2019-09-08 09:54:59,113 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 09:54:59,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567084 states. [2019-09-08 09:55:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567084 to 567082. [2019-09-08 09:55:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567082 states. [2019-09-08 09:55:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567082 states to 567082 states and 804985 transitions. [2019-09-08 09:55:52,285 INFO L78 Accepts]: Start accepts. Automaton has 567082 states and 804985 transitions. Word has length 266 [2019-09-08 09:55:52,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:52,286 INFO L475 AbstractCegarLoop]: Abstraction has 567082 states and 804985 transitions. [2019-09-08 09:55:52,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:55:52,286 INFO L276 IsEmpty]: Start isEmpty. Operand 567082 states and 804985 transitions. [2019-09-08 09:55:52,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 09:55:52,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:52,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:52,699 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:52,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:52,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2062448514, now seen corresponding path program 1 times [2019-09-08 09:55:52,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:52,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:52,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:52,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:52,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:52,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:52,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:55:52,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:55:52,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:55:52,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:55:52,891 INFO L87 Difference]: Start difference. First operand 567082 states and 804985 transitions. Second operand 3 states. [2019-09-08 09:57:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:57:28,032 INFO L93 Difference]: Finished difference Result 1666354 states and 2357482 transitions. [2019-09-08 09:57:28,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:57:28,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-09-08 09:57:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:57:29,583 INFO L225 Difference]: With dead ends: 1666354 [2019-09-08 09:57:29,583 INFO L226 Difference]: Without dead ends: 1113554 [2019-09-08 09:57:30,025 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 09:57:30,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113554 states. [2019-09-08 09:59:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113554 to 1113552. [2019-09-08 09:59:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113552 states. [2019-09-08 09:59:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113552 states to 1113552 states and 1566590 transitions. [2019-09-08 09:59:36,298 INFO L78 Accepts]: Start accepts. Automaton has 1113552 states and 1566590 transitions. Word has length 268 [2019-09-08 09:59:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:36,298 INFO L475 AbstractCegarLoop]: Abstraction has 1113552 states and 1566590 transitions. [2019-09-08 09:59:36,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:59:36,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1113552 states and 1566590 transitions. [2019-09-08 09:59:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 09:59:37,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:37,285 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] [2019-09-08 09:59:37,285 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2091084551, now seen corresponding path program 1 times [2019-09-08 09:59:37,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:37,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:37,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:37,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:37,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:37,383 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 09:59:37,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:37,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:59:37,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:59:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:59:37,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:59:37,385 INFO L87 Difference]: Start difference. First operand 1113552 states and 1566590 transitions. Second operand 3 states.