java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:12:57,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:12:57,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:12:57,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:12:57,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:12:57,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:12:57,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:12:57,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:12:57,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:12:57,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:12:57,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:12:57,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:12:57,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:12:57,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:12:57,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:12:57,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:12:57,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:12:57,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:12:57,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:12:57,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:12:57,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:12:57,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:12:57,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:12:57,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:12:57,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:12:57,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:12:57,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:12:57,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:12:57,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:12:57,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:12:57,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:12:57,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:12:57,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:12:57,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:12:57,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:12:57,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:12:57,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:12:57,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:12:57,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:12:57,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:12:57,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:12:57,986 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 10:12:58,005 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:12:58,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:12:58,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:12:58,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:12:58,007 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:12:58,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:12:58,007 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:12:58,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:12:58,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:12:58,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:12:58,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:12:58,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:12:58,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:12:58,008 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:12:58,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:12:58,009 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:12:58,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:12:58,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:12:58,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:12:58,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:12:58,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:12:58,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:12:58,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:12:58,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:12:58,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:12:58,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:12:58,011 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:12:58,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:12:58,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:12:58,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:12:58,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:12:58,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:12:58,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:12:58,069 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:12:58,070 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 10:12:58,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e27e573/8e77f318c3014597ab27d2d8bc3e3659/FLAGb8e436664 [2019-09-08 10:12:58,851 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:12:58,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 10:12:58,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e27e573/8e77f318c3014597ab27d2d8bc3e3659/FLAGb8e436664 [2019-09-08 10:12:58,962 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e27e573/8e77f318c3014597ab27d2d8bc3e3659 [2019-09-08 10:12:58,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:12:58,975 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:12:58,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:12:58,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:12:58,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:12:58,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:12:58" (1/1) ... [2019-09-08 10:12:58,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7594377c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:12:58, skipping insertion in model container [2019-09-08 10:12:58,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:12:58" (1/1) ... [2019-09-08 10:12:58,992 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:12:59,156 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:13:00,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:13:00,662 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:13:01,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:13:01,484 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:13:01,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:01 WrapperNode [2019-09-08 10:13:01,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:13:01,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:13:01,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:13:01,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:13:01,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:01" (1/1) ... [2019-09-08 10:13:01,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:01" (1/1) ... [2019-09-08 10:13:01,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:01" (1/1) ... [2019-09-08 10:13:01,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:01" (1/1) ... [2019-09-08 10:13:01,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:01" (1/1) ... [2019-09-08 10:13:01,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:01" (1/1) ... [2019-09-08 10:13:01,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:01" (1/1) ... [2019-09-08 10:13:01,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:13:01,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:13:01,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:13:01,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:13:01,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:01" (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 10:13:01,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:13:01,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:13:01,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:13:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:13:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:13:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:13:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:13:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:13:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:13:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:13:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:13:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:13:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:13:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:13:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 10:13:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:13:01,818 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:13:01,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:13:01,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:13:01,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:13:05,627 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:13:05,628 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:13:05,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:13:05 BoogieIcfgContainer [2019-09-08 10:13:05,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:13:05,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:13:05,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:13:05,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:13:05,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:12:58" (1/3) ... [2019-09-08 10:13:05,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cd925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:13:05, skipping insertion in model container [2019-09-08 10:13:05,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:13:01" (2/3) ... [2019-09-08 10:13:05,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62cd925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:13:05, skipping insertion in model container [2019-09-08 10:13:05,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:13:05" (3/3) ... [2019-09-08 10:13:05,639 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 10:13:05,649 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:13:05,660 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:13:05,686 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:13:05,738 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:13:05,739 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:13:05,739 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:13:05,740 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:13:05,740 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:13:05,740 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:13:05,740 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:13:05,740 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:13:05,741 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:13:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states. [2019-09-08 10:13:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-08 10:13:05,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:05,829 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] [2019-09-08 10:13:05,831 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:05,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:05,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1613772581, now seen corresponding path program 1 times [2019-09-08 10:13:05,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:05,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:05,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:05,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:05,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:07,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:07,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:07,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:07,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:07,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:07,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:07,055 INFO L87 Difference]: Start difference. First operand 1439 states. Second operand 3 states. [2019-09-08 10:13:07,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:07,311 INFO L93 Difference]: Finished difference Result 2885 states and 5050 transitions. [2019-09-08 10:13:07,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:07,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 360 [2019-09-08 10:13:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:07,351 INFO L225 Difference]: With dead ends: 2885 [2019-09-08 10:13:07,352 INFO L226 Difference]: Without dead ends: 2009 [2019-09-08 10:13:07,367 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 10:13:07,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2019-09-08 10:13:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 2007. [2019-09-08 10:13:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-09-08 10:13:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 3353 transitions. [2019-09-08 10:13:07,559 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 3353 transitions. Word has length 360 [2019-09-08 10:13:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:07,565 INFO L475 AbstractCegarLoop]: Abstraction has 2007 states and 3353 transitions. [2019-09-08 10:13:07,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 3353 transitions. [2019-09-08 10:13:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-09-08 10:13:07,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:07,579 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] [2019-09-08 10:13:07,580 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:07,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:07,581 INFO L82 PathProgramCache]: Analyzing trace with hash 476465467, now seen corresponding path program 1 times [2019-09-08 10:13:07,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:07,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:07,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:07,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:07,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:07,970 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 10:13:07,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:07,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:07,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:07,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:07,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:07,977 INFO L87 Difference]: Start difference. First operand 2007 states and 3353 transitions. Second operand 3 states. [2019-09-08 10:13:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:08,168 INFO L93 Difference]: Finished difference Result 4414 states and 7290 transitions. [2019-09-08 10:13:08,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:08,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-09-08 10:13:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:08,188 INFO L225 Difference]: With dead ends: 4414 [2019-09-08 10:13:08,188 INFO L226 Difference]: Without dead ends: 3001 [2019-09-08 10:13:08,193 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 10:13:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2019-09-08 10:13:08,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2999. [2019-09-08 10:13:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-09-08 10:13:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 4968 transitions. [2019-09-08 10:13:08,320 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 4968 transitions. Word has length 362 [2019-09-08 10:13:08,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:08,323 INFO L475 AbstractCegarLoop]: Abstraction has 2999 states and 4968 transitions. [2019-09-08 10:13:08,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 4968 transitions. [2019-09-08 10:13:08,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-08 10:13:08,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:08,341 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:08,341 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:08,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:08,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1279553581, now seen corresponding path program 1 times [2019-09-08 10:13:08,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:08,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:08,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:08,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:08,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:08,709 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 10:13:08,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:08,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:08,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:08,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:08,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:08,711 INFO L87 Difference]: Start difference. First operand 2999 states and 4968 transitions. Second operand 3 states. [2019-09-08 10:13:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:09,004 INFO L93 Difference]: Finished difference Result 7054 states and 11582 transitions. [2019-09-08 10:13:09,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:09,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2019-09-08 10:13:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:09,030 INFO L225 Difference]: With dead ends: 7054 [2019-09-08 10:13:09,030 INFO L226 Difference]: Without dead ends: 4672 [2019-09-08 10:13:09,036 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 10:13:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4672 states. [2019-09-08 10:13:09,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4672 to 4670. [2019-09-08 10:13:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4670 states. [2019-09-08 10:13:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 7674 transitions. [2019-09-08 10:13:09,237 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 7674 transitions. Word has length 364 [2019-09-08 10:13:09,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:09,237 INFO L475 AbstractCegarLoop]: Abstraction has 4670 states and 7674 transitions. [2019-09-08 10:13:09,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:09,238 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 7674 transitions. [2019-09-08 10:13:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-08 10:13:09,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:09,254 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] [2019-09-08 10:13:09,254 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:09,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2054229851, now seen corresponding path program 1 times [2019-09-08 10:13:09,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:09,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:09,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:09,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:09,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:09,636 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 10:13:09,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:09,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:09,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:09,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:09,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:09,640 INFO L87 Difference]: Start difference. First operand 4670 states and 7674 transitions. Second operand 3 states. [2019-09-08 10:13:10,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:10,238 INFO L93 Difference]: Finished difference Result 11409 states and 18611 transitions. [2019-09-08 10:13:10,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:10,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-09-08 10:13:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:10,275 INFO L225 Difference]: With dead ends: 11409 [2019-09-08 10:13:10,276 INFO L226 Difference]: Without dead ends: 7379 [2019-09-08 10:13:10,287 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 10:13:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7379 states. [2019-09-08 10:13:10,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7379 to 7377. [2019-09-08 10:13:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7377 states. [2019-09-08 10:13:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7377 states to 7377 states and 12020 transitions. [2019-09-08 10:13:10,677 INFO L78 Accepts]: Start accepts. Automaton has 7377 states and 12020 transitions. Word has length 366 [2019-09-08 10:13:10,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:10,679 INFO L475 AbstractCegarLoop]: Abstraction has 7377 states and 12020 transitions. [2019-09-08 10:13:10,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 7377 states and 12020 transitions. [2019-09-08 10:13:10,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-08 10:13:10,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:10,712 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] [2019-09-08 10:13:10,712 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:10,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:10,713 INFO L82 PathProgramCache]: Analyzing trace with hash -660941057, now seen corresponding path program 1 times [2019-09-08 10:13:10,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:10,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:10,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:10,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:10,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:11,107 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 10:13:11,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:11,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:11,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:11,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:11,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:11,110 INFO L87 Difference]: Start difference. First operand 7377 states and 12020 transitions. Second operand 3 states. [2019-09-08 10:13:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:11,750 INFO L93 Difference]: Finished difference Result 18228 states and 29488 transitions. [2019-09-08 10:13:11,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:11,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 368 [2019-09-08 10:13:11,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:11,800 INFO L225 Difference]: With dead ends: 18228 [2019-09-08 10:13:11,801 INFO L226 Difference]: Without dead ends: 11514 [2019-09-08 10:13:11,817 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 10:13:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11514 states. [2019-09-08 10:13:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11514 to 11512. [2019-09-08 10:13:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11512 states. [2019-09-08 10:13:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11512 states to 11512 states and 18562 transitions. [2019-09-08 10:13:12,391 INFO L78 Accepts]: Start accepts. Automaton has 11512 states and 18562 transitions. Word has length 368 [2019-09-08 10:13:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:12,392 INFO L475 AbstractCegarLoop]: Abstraction has 11512 states and 18562 transitions. [2019-09-08 10:13:12,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:12,392 INFO L276 IsEmpty]: Start isEmpty. Operand 11512 states and 18562 transitions. [2019-09-08 10:13:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-09-08 10:13:12,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:12,422 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] [2019-09-08 10:13:12,423 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:12,423 INFO L82 PathProgramCache]: Analyzing trace with hash 451806091, now seen corresponding path program 1 times [2019-09-08 10:13:12,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:12,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:12,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:12,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:12,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:13,015 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 10:13:13,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:13,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:13:13,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:13:13,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:13:13,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:13:13,018 INFO L87 Difference]: Start difference. First operand 11512 states and 18562 transitions. Second operand 3 states. [2019-09-08 10:13:13,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:13,741 INFO L93 Difference]: Finished difference Result 19693 states and 32252 transitions. [2019-09-08 10:13:13,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:13:13,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-09-08 10:13:13,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:13,782 INFO L225 Difference]: With dead ends: 19693 [2019-09-08 10:13:13,782 INFO L226 Difference]: Without dead ends: 16283 [2019-09-08 10:13:13,796 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 10:13:13,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16283 states. [2019-09-08 10:13:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16283 to 16281. [2019-09-08 10:13:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16281 states. [2019-09-08 10:13:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16281 states to 16281 states and 26410 transitions. [2019-09-08 10:13:15,232 INFO L78 Accepts]: Start accepts. Automaton has 16281 states and 26410 transitions. Word has length 370 [2019-09-08 10:13:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:15,235 INFO L475 AbstractCegarLoop]: Abstraction has 16281 states and 26410 transitions. [2019-09-08 10:13:15,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:13:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 16281 states and 26410 transitions. [2019-09-08 10:13:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-08 10:13:15,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:15,266 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] [2019-09-08 10:13:15,267 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:15,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:15,267 INFO L82 PathProgramCache]: Analyzing trace with hash 384532741, now seen corresponding path program 1 times [2019-09-08 10:13:15,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:15,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:15,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:15,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:15,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:15,695 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 10:13:15,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:15,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:13:15,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:13:15,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:13:15,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:13:15,697 INFO L87 Difference]: Start difference. First operand 16281 states and 26410 transitions. Second operand 5 states. [2019-09-08 10:13:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:17,077 INFO L93 Difference]: Finished difference Result 43891 states and 72558 transitions. [2019-09-08 10:13:17,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:13:17,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 371 [2019-09-08 10:13:17,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:17,201 INFO L225 Difference]: With dead ends: 43891 [2019-09-08 10:13:17,202 INFO L226 Difference]: Without dead ends: 37489 [2019-09-08 10:13:17,238 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 10:13:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37489 states. [2019-09-08 10:13:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37489 to 29290. [2019-09-08 10:13:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29290 states. [2019-09-08 10:13:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29290 states to 29290 states and 48034 transitions. [2019-09-08 10:13:18,711 INFO L78 Accepts]: Start accepts. Automaton has 29290 states and 48034 transitions. Word has length 371 [2019-09-08 10:13:18,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:18,711 INFO L475 AbstractCegarLoop]: Abstraction has 29290 states and 48034 transitions. [2019-09-08 10:13:18,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:13:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 29290 states and 48034 transitions. [2019-09-08 10:13:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-08 10:13:18,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:18,742 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:13:18,743 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:18,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:18,743 INFO L82 PathProgramCache]: Analyzing trace with hash 138433294, now seen corresponding path program 1 times [2019-09-08 10:13:18,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:18,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:18,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:18,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:18,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:19,456 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 10:13:19,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:19,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:13:19,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:13:19,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:13:19,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:13:19,459 INFO L87 Difference]: Start difference. First operand 29290 states and 48034 transitions. Second operand 7 states. [2019-09-08 10:13:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:21,816 INFO L93 Difference]: Finished difference Result 68324 states and 113288 transitions. [2019-09-08 10:13:21,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:13:21,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 371 [2019-09-08 10:13:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:21,940 INFO L225 Difference]: With dead ends: 68324 [2019-09-08 10:13:21,940 INFO L226 Difference]: Without dead ends: 49538 [2019-09-08 10:13:22,006 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 10:13:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49538 states. [2019-09-08 10:13:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49538 to 32694. [2019-09-08 10:13:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32694 states. [2019-09-08 10:13:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32694 states to 32694 states and 53774 transitions. [2019-09-08 10:13:23,665 INFO L78 Accepts]: Start accepts. Automaton has 32694 states and 53774 transitions. Word has length 371 [2019-09-08 10:13:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:23,666 INFO L475 AbstractCegarLoop]: Abstraction has 32694 states and 53774 transitions. [2019-09-08 10:13:23,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:13:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 32694 states and 53774 transitions. [2019-09-08 10:13:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 10:13:23,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:23,694 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] [2019-09-08 10:13:23,695 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:23,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:23,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1000016727, now seen corresponding path program 1 times [2019-09-08 10:13:23,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:23,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:23,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:23,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:23,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:13:24,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:24,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:13:24,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:13:24,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:13:24,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:13:24,308 INFO L87 Difference]: Start difference. First operand 32694 states and 53774 transitions. Second operand 7 states. [2019-09-08 10:13:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:27,997 INFO L93 Difference]: Finished difference Result 109768 states and 182412 transitions. [2019-09-08 10:13:27,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:13:27,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-08 10:13:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:28,170 INFO L225 Difference]: With dead ends: 109768 [2019-09-08 10:13:28,171 INFO L226 Difference]: Without dead ends: 90982 [2019-09-08 10:13:28,241 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 10:13:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90982 states. [2019-09-08 10:13:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90982 to 39920. [2019-09-08 10:13:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39920 states. [2019-09-08 10:13:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39920 states to 39920 states and 65902 transitions. [2019-09-08 10:13:30,496 INFO L78 Accepts]: Start accepts. Automaton has 39920 states and 65902 transitions. Word has length 372 [2019-09-08 10:13:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:30,497 INFO L475 AbstractCegarLoop]: Abstraction has 39920 states and 65902 transitions. [2019-09-08 10:13:30,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:13:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 39920 states and 65902 transitions. [2019-09-08 10:13:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 10:13:30,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:30,518 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] [2019-09-08 10:13:30,518 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:30,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:30,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1696383086, now seen corresponding path program 1 times [2019-09-08 10:13:30,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:30,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:30,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:30,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:30,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:30,891 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 10:13:30,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:30,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:13:30,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:13:30,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:13:30,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:13:30,892 INFO L87 Difference]: Start difference. First operand 39920 states and 65902 transitions. Second operand 5 states. [2019-09-08 10:13:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:36,491 INFO L93 Difference]: Finished difference Result 136940 states and 227746 transitions. [2019-09-08 10:13:36,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:13:36,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 372 [2019-09-08 10:13:36,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:36,685 INFO L225 Difference]: With dead ends: 136940 [2019-09-08 10:13:36,686 INFO L226 Difference]: Without dead ends: 107930 [2019-09-08 10:13:36,738 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 10:13:36,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107930 states. [2019-09-08 10:13:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107930 to 80538. [2019-09-08 10:13:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80538 states. [2019-09-08 10:13:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80538 states to 80538 states and 133122 transitions. [2019-09-08 10:13:40,767 INFO L78 Accepts]: Start accepts. Automaton has 80538 states and 133122 transitions. Word has length 372 [2019-09-08 10:13:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:13:40,768 INFO L475 AbstractCegarLoop]: Abstraction has 80538 states and 133122 transitions. [2019-09-08 10:13:40,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:13:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 80538 states and 133122 transitions. [2019-09-08 10:13:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 10:13:40,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:13:40,789 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] [2019-09-08 10:13:40,789 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:13:40,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:13:40,789 INFO L82 PathProgramCache]: Analyzing trace with hash -235962621, now seen corresponding path program 1 times [2019-09-08 10:13:40,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:13:40,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:13:40,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:40,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:13:40,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:13:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:13:41,784 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 10:13:41,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:13:41,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:13:41,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:13:41,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:13:41,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:13:41,785 INFO L87 Difference]: Start difference. First operand 80538 states and 133122 transitions. Second operand 7 states. [2019-09-08 10:13:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:13:52,627 INFO L93 Difference]: Finished difference Result 269126 states and 446484 transitions. [2019-09-08 10:13:52,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:13:52,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-08 10:13:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:13:52,940 INFO L225 Difference]: With dead ends: 269126 [2019-09-08 10:13:52,941 INFO L226 Difference]: Without dead ends: 213572 [2019-09-08 10:13:53,031 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 10:13:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213572 states. [2019-09-08 10:14:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213572 to 84110. [2019-09-08 10:14:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84110 states. [2019-09-08 10:14:00,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84110 states to 84110 states and 139090 transitions. [2019-09-08 10:14:00,978 INFO L78 Accepts]: Start accepts. Automaton has 84110 states and 139090 transitions. Word has length 372 [2019-09-08 10:14:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:00,978 INFO L475 AbstractCegarLoop]: Abstraction has 84110 states and 139090 transitions. [2019-09-08 10:14:00,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:14:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 84110 states and 139090 transitions. [2019-09-08 10:14:00,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 10:14:00,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:00,992 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] [2019-09-08 10:14:00,992 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:00,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:00,993 INFO L82 PathProgramCache]: Analyzing trace with hash -903330698, now seen corresponding path program 1 times [2019-09-08 10:14:00,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:00,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:00,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:00,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:00,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:01,474 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 10:14:01,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:01,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:14:01,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:14:01,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:14:01,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:14:01,476 INFO L87 Difference]: Start difference. First operand 84110 states and 139090 transitions. Second operand 7 states. [2019-09-08 10:14:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:13,613 INFO L93 Difference]: Finished difference Result 272970 states and 452916 transitions. [2019-09-08 10:14:13,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 10:14:13,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-08 10:14:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:13,953 INFO L225 Difference]: With dead ends: 272970 [2019-09-08 10:14:13,954 INFO L226 Difference]: Without dead ends: 217416 [2019-09-08 10:14:14,034 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 10:14:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217416 states. [2019-09-08 10:14:22,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217416 to 87682. [2019-09-08 10:14:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87682 states. [2019-09-08 10:14:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87682 states to 87682 states and 145058 transitions. [2019-09-08 10:14:22,477 INFO L78 Accepts]: Start accepts. Automaton has 87682 states and 145058 transitions. Word has length 372 [2019-09-08 10:14:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:22,478 INFO L475 AbstractCegarLoop]: Abstraction has 87682 states and 145058 transitions. [2019-09-08 10:14:22,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:14:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 87682 states and 145058 transitions. [2019-09-08 10:14:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 10:14:22,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:22,494 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] [2019-09-08 10:14:22,494 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:22,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:22,495 INFO L82 PathProgramCache]: Analyzing trace with hash -346878678, now seen corresponding path program 1 times [2019-09-08 10:14:22,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:22,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:22,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:22,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:22,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:23,109 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 10:14:23,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:23,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:23,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:23,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:23,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:23,112 INFO L87 Difference]: Start difference. First operand 87682 states and 145058 transitions. Second operand 3 states. [2019-09-08 10:14:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:14:34,910 INFO L93 Difference]: Finished difference Result 210615 states and 348796 transitions. [2019-09-08 10:14:34,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:14:34,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-08 10:14:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:14:35,138 INFO L225 Difference]: With dead ends: 210615 [2019-09-08 10:14:35,138 INFO L226 Difference]: Without dead ends: 172289 [2019-09-08 10:14:35,192 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 10:14:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172289 states. [2019-09-08 10:14:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172289 to 172287. [2019-09-08 10:14:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172287 states. [2019-09-08 10:14:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172287 states to 172287 states and 284866 transitions. [2019-09-08 10:14:49,195 INFO L78 Accepts]: Start accepts. Automaton has 172287 states and 284866 transitions. Word has length 372 [2019-09-08 10:14:49,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:14:49,195 INFO L475 AbstractCegarLoop]: Abstraction has 172287 states and 284866 transitions. [2019-09-08 10:14:49,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:14:49,195 INFO L276 IsEmpty]: Start isEmpty. Operand 172287 states and 284866 transitions. [2019-09-08 10:14:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 10:14:49,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:14:49,225 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] [2019-09-08 10:14:49,225 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:14:49,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:14:49,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2030214534, now seen corresponding path program 1 times [2019-09-08 10:14:49,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:14:49,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:14:49,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:49,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:14:49,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:14:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:14:49,465 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 10:14:49,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:14:49,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:14:49,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:14:49,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:14:49,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:14:49,468 INFO L87 Difference]: Start difference. First operand 172287 states and 284866 transitions. Second operand 3 states. [2019-09-08 10:15:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:15:13,944 INFO L93 Difference]: Finished difference Result 512409 states and 847456 transitions. [2019-09-08 10:15:13,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:15:13,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 373 [2019-09-08 10:15:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:15:14,505 INFO L225 Difference]: With dead ends: 512409 [2019-09-08 10:15:14,505 INFO L226 Difference]: Without dead ends: 340231 [2019-09-08 10:15:14,652 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 10:15:14,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340231 states. [2019-09-08 10:15:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340231 to 340229. [2019-09-08 10:15:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340229 states. [2019-09-08 10:15:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340229 states to 340229 states and 561080 transitions. [2019-09-08 10:15:46,822 INFO L78 Accepts]: Start accepts. Automaton has 340229 states and 561080 transitions. Word has length 373 [2019-09-08 10:15:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:15:46,823 INFO L475 AbstractCegarLoop]: Abstraction has 340229 states and 561080 transitions. [2019-09-08 10:15:46,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:15:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 340229 states and 561080 transitions. [2019-09-08 10:15:46,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 10:15:46,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:15:46,865 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] [2019-09-08 10:15:46,866 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:15:46,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:15:46,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1049430464, now seen corresponding path program 1 times [2019-09-08 10:15:46,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:15:46,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:15:46,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:46,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:15:46,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:15:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:15:47,651 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 10:15:47,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:15:47,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:15:47,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:15:47,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:15:47,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:15:47,653 INFO L87 Difference]: Start difference. First operand 340229 states and 561080 transitions. Second operand 3 states. [2019-09-08 10:16:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:39,237 INFO L93 Difference]: Finished difference Result 1011685 states and 1668852 transitions. [2019-09-08 10:16:39,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:16:39,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 373 [2019-09-08 10:16:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:40,279 INFO L225 Difference]: With dead ends: 1011685 [2019-09-08 10:16:40,279 INFO L226 Difference]: Without dead ends: 671569 [2019-09-08 10:16:40,561 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 10:16:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671569 states. [2019-09-08 10:17:50,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671569 to 671567. [2019-09-08 10:17:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671567 states. [2019-09-08 10:17:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671567 states to 671567 states and 1104501 transitions. [2019-09-08 10:17:51,929 INFO L78 Accepts]: Start accepts. Automaton has 671567 states and 1104501 transitions. Word has length 373 [2019-09-08 10:17:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:51,929 INFO L475 AbstractCegarLoop]: Abstraction has 671567 states and 1104501 transitions. [2019-09-08 10:17:51,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:17:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 671567 states and 1104501 transitions. [2019-09-08 10:17:52,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 10:17:52,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:52,003 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] [2019-09-08 10:17:52,003 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:52,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:52,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1775706260, now seen corresponding path program 1 times [2019-09-08 10:17:52,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:52,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:52,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:52,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:52,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:53,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:53,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:17:53,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:17:53,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:17:53,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:17:53,197 INFO L87 Difference]: Start difference. First operand 671567 states and 1104501 transitions. Second operand 5 states. [2019-09-08 10:21:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:21:03,652 INFO L93 Difference]: Finished difference Result 2716903 states and 4480721 transitions. [2019-09-08 10:21:03,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:21:03,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 373 [2019-09-08 10:21:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:21:07,316 INFO L225 Difference]: With dead ends: 2716903 [2019-09-08 10:21:07,316 INFO L226 Difference]: Without dead ends: 2127205 [2019-09-08 10:21:07,930 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 10:21:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127205 states.