java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:39:59,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:39:59,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:39:59,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:39:59,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:39:59,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:39:59,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:39:59,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:39:59,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:39:59,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:39:59,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:39:59,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:39:59,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:39:59,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:39:59,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:39:59,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:39:59,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:39:59,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:39:59,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:39:59,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:39:59,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:39:59,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:39:59,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:39:59,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:39:59,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:39:59,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:39:59,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:39:59,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:39:59,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:39:59,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:39:59,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:39:59,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:39:59,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:39:59,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:39:59,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:39:59,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:39:59,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:39:59,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:39:59,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:39:59,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:39:59,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:39:59,774 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 13:39:59,789 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:39:59,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:39:59,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:39:59,791 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:39:59,791 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:39:59,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:39:59,792 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:39:59,792 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:39:59,792 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:39:59,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:39:59,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:39:59,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:39:59,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:39:59,793 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:39:59,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:39:59,793 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:39:59,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:39:59,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:39:59,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:39:59,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:39:59,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:39:59,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:39:59,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:39:59,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:39:59,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:39:59,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:39:59,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:39:59,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:39:59,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:39:59,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:39:59,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:39:59,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:39:59,868 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:39:59,869 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:39:59,870 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 13:39:59,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44568176/eb76f773f20b46b0bab5cba8172a3760/FLAG0ed3cd928 [2019-09-08 13:40:00,977 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:40:00,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 13:40:01,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44568176/eb76f773f20b46b0bab5cba8172a3760/FLAG0ed3cd928 [2019-09-08 13:40:01,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c44568176/eb76f773f20b46b0bab5cba8172a3760 [2019-09-08 13:40:01,294 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:40:01,296 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:40:01,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:40:01,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:40:01,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:40:01,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:40:01" (1/1) ... [2019-09-08 13:40:01,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2ba9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:01, skipping insertion in model container [2019-09-08 13:40:01,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:40:01" (1/1) ... [2019-09-08 13:40:01,314 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:40:01,865 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:40:06,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:40:06,292 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:40:10,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:40:10,057 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:40:10,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:10 WrapperNode [2019-09-08 13:40:10,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:40:10,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:40:10,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:40:10,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:40:10,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:10" (1/1) ... [2019-09-08 13:40:10,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:10" (1/1) ... [2019-09-08 13:40:10,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:10" (1/1) ... [2019-09-08 13:40:10,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:10" (1/1) ... [2019-09-08 13:40:10,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:10" (1/1) ... [2019-09-08 13:40:10,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:10" (1/1) ... [2019-09-08 13:40:10,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:10" (1/1) ... [2019-09-08 13:40:10,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:40:10,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:40:10,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:40:10,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:40:10,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:40:10,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:40:10,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:40:10,785 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:40:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:40:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:40:10,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:40:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:40:10,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:40:10,787 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:40:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:40:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:40:10,788 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:40:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:40:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:40:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 13:40:10,790 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:40:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:40:10,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:40:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:40:10,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:40:25,244 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:40:25,245 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:40:25,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:40:25 BoogieIcfgContainer [2019-09-08 13:40:25,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:40:25,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:40:25,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:40:25,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:40:25,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:40:01" (1/3) ... [2019-09-08 13:40:25,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6390aef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:40:25, skipping insertion in model container [2019-09-08 13:40:25,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:40:10" (2/3) ... [2019-09-08 13:40:25,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6390aef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:40:25, skipping insertion in model container [2019-09-08 13:40:25,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:40:25" (3/3) ... [2019-09-08 13:40:25,266 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.4.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2019-09-08 13:40:25,277 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:40:25,308 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:40:25,325 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:40:25,399 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:40:25,399 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:40:25,400 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:40:25,400 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:40:25,400 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:40:25,400 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:40:25,400 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:40:25,400 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:40:25,401 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:40:25,518 INFO L276 IsEmpty]: Start isEmpty. Operand 6869 states. [2019-09-08 13:40:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 13:40:25,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:25,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:25,590 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:25,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:25,597 INFO L82 PathProgramCache]: Analyzing trace with hash 803345190, now seen corresponding path program 1 times [2019-09-08 13:40:25,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:25,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:25,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:25,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:25,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:40:26,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:26,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:26,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:26,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:26,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:26,725 INFO L87 Difference]: Start difference. First operand 6869 states. Second operand 3 states. [2019-09-08 13:40:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:27,601 INFO L93 Difference]: Finished difference Result 13661 states and 23679 transitions. [2019-09-08 13:40:27,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:27,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-09-08 13:40:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:27,672 INFO L225 Difference]: With dead ends: 13661 [2019-09-08 13:40:27,672 INFO L226 Difference]: Without dead ends: 8208 [2019-09-08 13:40:27,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8208 states. [2019-09-08 13:40:28,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8208 to 8206. [2019-09-08 13:40:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8206 states. [2019-09-08 13:40:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8206 states to 8206 states and 13731 transitions. [2019-09-08 13:40:28,137 INFO L78 Accepts]: Start accepts. Automaton has 8206 states and 13731 transitions. Word has length 387 [2019-09-08 13:40:28,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:28,144 INFO L475 AbstractCegarLoop]: Abstraction has 8206 states and 13731 transitions. [2019-09-08 13:40:28,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 8206 states and 13731 transitions. [2019-09-08 13:40:28,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 13:40:28,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:28,178 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:28,179 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:28,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:28,181 INFO L82 PathProgramCache]: Analyzing trace with hash 349013669, now seen corresponding path program 1 times [2019-09-08 13:40:28,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:28,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:28,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:28,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:28,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:28,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:40:28,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:28,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:28,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:28,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:28,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:28,669 INFO L87 Difference]: Start difference. First operand 8206 states and 13731 transitions. Second operand 3 states. [2019-09-08 13:40:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:29,633 INFO L93 Difference]: Finished difference Result 17861 states and 30009 transitions. [2019-09-08 13:40:29,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:29,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-09-08 13:40:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:29,692 INFO L225 Difference]: With dead ends: 17861 [2019-09-08 13:40:29,693 INFO L226 Difference]: Without dead ends: 10895 [2019-09-08 13:40:29,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10895 states. [2019-09-08 13:40:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10895 to 10893. [2019-09-08 13:40:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-09-08 13:40:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 18208 transitions. [2019-09-08 13:40:30,112 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 18208 transitions. Word has length 387 [2019-09-08 13:40:30,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:30,113 INFO L475 AbstractCegarLoop]: Abstraction has 10893 states and 18208 transitions. [2019-09-08 13:40:30,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:30,113 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 18208 transitions. [2019-09-08 13:40:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 13:40:30,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:30,148 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:30,149 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:30,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:30,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2128351759, now seen corresponding path program 1 times [2019-09-08 13:40:30,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:30,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:30,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:30,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:40:30,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:30,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:30,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:30,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:31,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:31,000 INFO L87 Difference]: Start difference. First operand 10893 states and 18208 transitions. Second operand 3 states. [2019-09-08 13:40:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:32,012 INFO L93 Difference]: Finished difference Result 19266 states and 32192 transitions. [2019-09-08 13:40:32,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:32,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-09-08 13:40:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:32,104 INFO L225 Difference]: With dead ends: 19266 [2019-09-08 13:40:32,106 INFO L226 Difference]: Without dead ends: 16230 [2019-09-08 13:40:32,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16230 states. [2019-09-08 13:40:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16230 to 16228. [2019-09-08 13:40:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16228 states. [2019-09-08 13:40:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16228 states to 16228 states and 27050 transitions. [2019-09-08 13:40:32,730 INFO L78 Accepts]: Start accepts. Automaton has 16228 states and 27050 transitions. Word has length 387 [2019-09-08 13:40:32,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:32,731 INFO L475 AbstractCegarLoop]: Abstraction has 16228 states and 27050 transitions. [2019-09-08 13:40:32,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 16228 states and 27050 transitions. [2019-09-08 13:40:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 13:40:32,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:32,788 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:32,789 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:32,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:32,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2011744305, now seen corresponding path program 1 times [2019-09-08 13:40:32,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:32,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:32,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:32,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:32,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:40:33,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:33,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:33,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:33,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:33,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:33,494 INFO L87 Difference]: Start difference. First operand 16228 states and 27050 transitions. Second operand 3 states. [2019-09-08 13:40:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:34,624 INFO L93 Difference]: Finished difference Result 29556 states and 49396 transitions. [2019-09-08 13:40:34,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:34,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-09-08 13:40:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:34,701 INFO L225 Difference]: With dead ends: 29556 [2019-09-08 13:40:34,701 INFO L226 Difference]: Without dead ends: 26042 [2019-09-08 13:40:34,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26042 states. [2019-09-08 13:40:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26042 to 26040. [2019-09-08 13:40:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26040 states. [2019-09-08 13:40:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26040 states to 26040 states and 43422 transitions. [2019-09-08 13:40:35,522 INFO L78 Accepts]: Start accepts. Automaton has 26040 states and 43422 transitions. Word has length 387 [2019-09-08 13:40:35,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:35,523 INFO L475 AbstractCegarLoop]: Abstraction has 26040 states and 43422 transitions. [2019-09-08 13:40:35,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:35,523 INFO L276 IsEmpty]: Start isEmpty. Operand 26040 states and 43422 transitions. [2019-09-08 13:40:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 13:40:35,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:35,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:35,589 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:35,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash 450483599, now seen corresponding path program 1 times [2019-09-08 13:40:35,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:35,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:35,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:35,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:35,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:40:37,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:37,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:37,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:37,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:37,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:37,135 INFO L87 Difference]: Start difference. First operand 26040 states and 43422 transitions. Second operand 3 states. [2019-09-08 13:40:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:39,382 INFO L93 Difference]: Finished difference Result 51178 states and 85392 transitions. [2019-09-08 13:40:39,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:39,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-09-08 13:40:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:39,532 INFO L225 Difference]: With dead ends: 51178 [2019-09-08 13:40:39,533 INFO L226 Difference]: Without dead ends: 45704 [2019-09-08 13:40:39,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:39,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45704 states. [2019-09-08 13:40:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45704 to 45702. [2019-09-08 13:40:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45702 states. [2019-09-08 13:40:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45702 states to 45702 states and 75982 transitions. [2019-09-08 13:40:41,153 INFO L78 Accepts]: Start accepts. Automaton has 45702 states and 75982 transitions. Word has length 387 [2019-09-08 13:40:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:41,154 INFO L475 AbstractCegarLoop]: Abstraction has 45702 states and 75982 transitions. [2019-09-08 13:40:41,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 45702 states and 75982 transitions. [2019-09-08 13:40:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 13:40:41,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:41,230 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:41,230 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:41,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash 719491791, now seen corresponding path program 1 times [2019-09-08 13:40:41,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:41,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:41,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:41,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:41,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:40:41,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:41,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:41,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:41,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:41,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:41,555 INFO L87 Difference]: Start difference. First operand 45702 states and 75982 transitions. Second operand 3 states. [2019-09-08 13:40:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:42,981 INFO L93 Difference]: Finished difference Result 54554 states and 90748 transitions. [2019-09-08 13:40:42,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:42,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 387 [2019-09-08 13:40:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:43,074 INFO L225 Difference]: With dead ends: 54554 [2019-09-08 13:40:43,074 INFO L226 Difference]: Without dead ends: 48688 [2019-09-08 13:40:43,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48688 states. [2019-09-08 13:40:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48688 to 48470. [2019-09-08 13:40:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48470 states. [2019-09-08 13:40:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48470 states to 48470 states and 80554 transitions. [2019-09-08 13:40:44,185 INFO L78 Accepts]: Start accepts. Automaton has 48470 states and 80554 transitions. Word has length 387 [2019-09-08 13:40:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:44,186 INFO L475 AbstractCegarLoop]: Abstraction has 48470 states and 80554 transitions. [2019-09-08 13:40:44,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 48470 states and 80554 transitions. [2019-09-08 13:40:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 13:40:44,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:44,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:44,234 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:44,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:44,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1837003022, now seen corresponding path program 1 times [2019-09-08 13:40:44,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:44,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:44,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:44,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:44,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:40:46,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:46,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:40:46,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:40:46,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:40:46,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:40:46,635 INFO L87 Difference]: Start difference. First operand 48470 states and 80554 transitions. Second operand 4 states. [2019-09-08 13:40:48,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:48,777 INFO L93 Difference]: Finished difference Result 87764 states and 146597 transitions. [2019-09-08 13:40:48,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:40:48,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 387 [2019-09-08 13:40:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:48,963 INFO L225 Difference]: With dead ends: 87764 [2019-09-08 13:40:48,963 INFO L226 Difference]: Without dead ends: 78746 [2019-09-08 13:40:49,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:40:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78746 states. [2019-09-08 13:40:50,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78746 to 75646. [2019-09-08 13:40:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75646 states. [2019-09-08 13:40:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75646 states to 75646 states and 125946 transitions. [2019-09-08 13:40:50,925 INFO L78 Accepts]: Start accepts. Automaton has 75646 states and 125946 transitions. Word has length 387 [2019-09-08 13:40:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:50,926 INFO L475 AbstractCegarLoop]: Abstraction has 75646 states and 125946 transitions. [2019-09-08 13:40:50,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:40:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 75646 states and 125946 transitions. [2019-09-08 13:40:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 13:40:50,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:40:50,999 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:40:51,000 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:40:51,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:40:51,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1129307814, now seen corresponding path program 1 times [2019-09-08 13:40:51,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:40:51,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:40:51,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:51,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:40:51,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:40:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:40:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:40:51,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:40:51,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:40:51,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:40:51,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:40:51,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:51,972 INFO L87 Difference]: Start difference. First operand 75646 states and 125946 transitions. Second operand 3 states. [2019-09-08 13:40:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:40:56,516 INFO L93 Difference]: Finished difference Result 205852 states and 341922 transitions. [2019-09-08 13:40:56,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:40:56,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-09-08 13:40:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:40:56,830 INFO L225 Difference]: With dead ends: 205852 [2019-09-08 13:40:56,830 INFO L226 Difference]: Without dead ends: 132866 [2019-09-08 13:40:56,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:40:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132866 states. [2019-09-08 13:40:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132866 to 118564. [2019-09-08 13:40:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118564 states. [2019-09-08 13:40:59,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118564 states to 118564 states and 196504 transitions. [2019-09-08 13:40:59,979 INFO L78 Accepts]: Start accepts. Automaton has 118564 states and 196504 transitions. Word has length 391 [2019-09-08 13:40:59,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:40:59,980 INFO L475 AbstractCegarLoop]: Abstraction has 118564 states and 196504 transitions. [2019-09-08 13:40:59,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:40:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand 118564 states and 196504 transitions. [2019-09-08 13:41:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 13:41:00,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:41:00,093 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:41:00,093 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:41:00,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:41:00,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1737388368, now seen corresponding path program 1 times [2019-09-08 13:41:00,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:41:00,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:41:00,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:00,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:41:00,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:41:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:41:01,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:41:01,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:41:01,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:41:01,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:41:01,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:41:01,521 INFO L87 Difference]: Start difference. First operand 118564 states and 196504 transitions. Second operand 8 states. [2019-09-08 13:41:11,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:41:11,890 INFO L93 Difference]: Finished difference Result 302590 states and 503935 transitions. [2019-09-08 13:41:11,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 13:41:11,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 391 [2019-09-08 13:41:11,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:41:12,285 INFO L225 Difference]: With dead ends: 302590 [2019-09-08 13:41:12,285 INFO L226 Difference]: Without dead ends: 266796 [2019-09-08 13:41:12,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-09-08 13:41:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266796 states. [2019-09-08 13:41:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266796 to 232248. [2019-09-08 13:41:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232248 states. [2019-09-08 13:41:23,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232248 states to 232248 states and 384784 transitions. [2019-09-08 13:41:23,123 INFO L78 Accepts]: Start accepts. Automaton has 232248 states and 384784 transitions. Word has length 391 [2019-09-08 13:41:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:41:23,124 INFO L475 AbstractCegarLoop]: Abstraction has 232248 states and 384784 transitions. [2019-09-08 13:41:23,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:41:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 232248 states and 384784 transitions. [2019-09-08 13:41:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 13:41:27,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:41:27,045 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:41:27,045 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:41:27,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:41:27,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1871394503, now seen corresponding path program 1 times [2019-09-08 13:41:27,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:41:27,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:41:27,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:27,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:41:27,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:41:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:41:27,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:41:27,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:41:27,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:41:27,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:41:27,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:41:27,615 INFO L87 Difference]: Start difference. First operand 232248 states and 384784 transitions. Second operand 3 states. [2019-09-08 13:41:31,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:41:31,020 INFO L93 Difference]: Finished difference Result 274372 states and 455864 transitions. [2019-09-08 13:41:31,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:41:31,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-09-08 13:41:31,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:41:31,134 INFO L225 Difference]: With dead ends: 274372 [2019-09-08 13:41:31,134 INFO L226 Difference]: Without dead ends: 90918 [2019-09-08 13:41:31,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:41:31,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90918 states. [2019-09-08 13:41:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90918 to 77932. [2019-09-08 13:41:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77932 states. [2019-09-08 13:41:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77932 states to 77932 states and 129702 transitions. [2019-09-08 13:41:37,057 INFO L78 Accepts]: Start accepts. Automaton has 77932 states and 129702 transitions. Word has length 391 [2019-09-08 13:41:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:41:37,058 INFO L475 AbstractCegarLoop]: Abstraction has 77932 states and 129702 transitions. [2019-09-08 13:41:37,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:41:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 77932 states and 129702 transitions. [2019-09-08 13:41:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 13:41:37,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:41:37,110 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:41:37,110 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:41:37,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:41:37,111 INFO L82 PathProgramCache]: Analyzing trace with hash -621424257, now seen corresponding path program 1 times [2019-09-08 13:41:37,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:41:37,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:41:37,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:37,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:41:37,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:41:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:41:37,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:41:37,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:41:37,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:41:37,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:41:37,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:41:37,710 INFO L87 Difference]: Start difference. First operand 77932 states and 129702 transitions. Second operand 6 states. [2019-09-08 13:41:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:41:42,771 INFO L93 Difference]: Finished difference Result 194592 states and 326250 transitions. [2019-09-08 13:41:42,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:41:42,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 391 [2019-09-08 13:41:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:41:43,019 INFO L225 Difference]: With dead ends: 194592 [2019-09-08 13:41:43,019 INFO L226 Difference]: Without dead ends: 165094 [2019-09-08 13:41:43,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:41:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165094 states. [2019-09-08 13:41:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165094 to 164740. [2019-09-08 13:41:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164740 states. [2019-09-08 13:41:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164740 states to 164740 states and 274702 transitions. [2019-09-08 13:41:49,141 INFO L78 Accepts]: Start accepts. Automaton has 164740 states and 274702 transitions. Word has length 391 [2019-09-08 13:41:49,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:41:49,141 INFO L475 AbstractCegarLoop]: Abstraction has 164740 states and 274702 transitions. [2019-09-08 13:41:49,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:41:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 164740 states and 274702 transitions. [2019-09-08 13:41:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 13:41:49,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:41:49,199 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:41:49,199 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:41:49,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:41:49,199 INFO L82 PathProgramCache]: Analyzing trace with hash 374912513, now seen corresponding path program 1 times [2019-09-08 13:41:49,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:41:49,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:41:49,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:49,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:41:49,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:41:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:41:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:41:53,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:41:53,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:41:53,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:41:53,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:41:53,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:41:53,458 INFO L87 Difference]: Start difference. First operand 164740 states and 274702 transitions. Second operand 4 states. [2019-09-08 13:42:08,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:42:08,524 INFO L93 Difference]: Finished difference Result 579388 states and 964693 transitions. [2019-09-08 13:42:08,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:42:08,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 391 [2019-09-08 13:42:08,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:42:09,205 INFO L225 Difference]: With dead ends: 579388 [2019-09-08 13:42:09,205 INFO L226 Difference]: Without dead ends: 427138 [2019-09-08 13:42:09,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:42:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427138 states. [2019-09-08 13:42:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427138 to 427134. [2019-09-08 13:42:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427134 states. [2019-09-08 13:42:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427134 states to 427134 states and 703326 transitions. [2019-09-08 13:42:38,914 INFO L78 Accepts]: Start accepts. Automaton has 427134 states and 703326 transitions. Word has length 391 [2019-09-08 13:42:38,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:42:38,914 INFO L475 AbstractCegarLoop]: Abstraction has 427134 states and 703326 transitions. [2019-09-08 13:42:38,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:42:38,914 INFO L276 IsEmpty]: Start isEmpty. Operand 427134 states and 703326 transitions. [2019-09-08 13:42:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 13:42:39,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:42:39,023 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:42:39,023 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:42:39,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:42:39,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1371290731, now seen corresponding path program 1 times [2019-09-08 13:42:39,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:42:39,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:42:39,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:39,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:42:39,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:42:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:42:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:42:39,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:42:39,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:42:39,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:42:39,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:42:39,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:42:39,744 INFO L87 Difference]: Start difference. First operand 427134 states and 703326 transitions. Second operand 7 states. [2019-09-08 13:43:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:43:40,657 INFO L93 Difference]: Finished difference Result 1398472 states and 2310934 transitions. [2019-09-08 13:43:40,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 13:43:40,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 391 [2019-09-08 13:43:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:43:42,737 INFO L225 Difference]: With dead ends: 1398472 [2019-09-08 13:43:42,737 INFO L226 Difference]: Without dead ends: 1066178 [2019-09-08 13:43:43,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 13:43:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066178 states. [2019-09-08 13:44:36,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066178 to 578538. [2019-09-08 13:44:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578538 states. [2019-09-08 13:44:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578538 states to 578538 states and 953282 transitions. [2019-09-08 13:44:37,583 INFO L78 Accepts]: Start accepts. Automaton has 578538 states and 953282 transitions. Word has length 391 [2019-09-08 13:44:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:44:37,583 INFO L475 AbstractCegarLoop]: Abstraction has 578538 states and 953282 transitions. [2019-09-08 13:44:37,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:44:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 578538 states and 953282 transitions. [2019-09-08 13:44:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:44:37,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:44:37,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:44:37,737 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:44:37,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:44:37,737 INFO L82 PathProgramCache]: Analyzing trace with hash -985054710, now seen corresponding path program 1 times [2019-09-08 13:44:37,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:44:37,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:44:37,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:44:37,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:44:37,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:44:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:44:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:44:38,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:44:38,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:44:38,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:44:38,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:44:38,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:44:38,192 INFO L87 Difference]: Start difference. First operand 578538 states and 953282 transitions. Second operand 5 states. [2019-09-08 13:45:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:45:45,502 INFO L93 Difference]: Finished difference Result 1453266 states and 2406286 transitions. [2019-09-08 13:45:45,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:45:45,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 392 [2019-09-08 13:45:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:45:47,186 INFO L225 Difference]: With dead ends: 1453266 [2019-09-08 13:45:47,187 INFO L226 Difference]: Without dead ends: 969532 [2019-09-08 13:45:47,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:45:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969532 states. [2019-09-08 13:46:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969532 to 800490. [2019-09-08 13:46:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800490 states. [2019-09-08 13:46:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800490 states to 800490 states and 1319418 transitions. [2019-09-08 13:46:57,389 INFO L78 Accepts]: Start accepts. Automaton has 800490 states and 1319418 transitions. Word has length 392 [2019-09-08 13:46:57,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:46:57,389 INFO L475 AbstractCegarLoop]: Abstraction has 800490 states and 1319418 transitions. [2019-09-08 13:46:57,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:46:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 800490 states and 1319418 transitions. [2019-09-08 13:46:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-08 13:46:57,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:46:57,504 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:46:57,504 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:46:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:46:57,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1725796766, now seen corresponding path program 1 times [2019-09-08 13:46:57,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:46:57,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:46:57,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:46:57,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:46:57,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:46:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:46:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:46:57,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:46:57,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:46:57,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:46:57,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:46:57,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:46:57,968 INFO L87 Difference]: Start difference. First operand 800490 states and 1319418 transitions. Second operand 7 states. [2019-09-08 13:48:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:48:45,053 INFO L93 Difference]: Finished difference Result 2047750 states and 3376332 transitions. [2019-09-08 13:48:45,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 13:48:45,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 392 [2019-09-08 13:48:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:48:47,633 INFO L225 Difference]: With dead ends: 2047750 [2019-09-08 13:48:47,633 INFO L226 Difference]: Without dead ends: 1493504 [2019-09-08 13:48:48,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 13:48:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493504 states.