/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 04:32:36,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 04:32:36,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 04:32:36,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 04:32:36,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 04:32:36,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 04:32:36,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 04:32:36,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 04:32:36,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 04:32:36,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 04:32:36,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 04:32:36,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 04:32:36,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 04:32:36,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 04:32:36,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 04:32:36,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 04:32:36,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 04:32:36,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 04:32:36,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 04:32:36,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 04:32:36,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 04:32:36,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 04:32:36,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 04:32:36,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 04:32:36,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 04:32:36,689 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 04:32:36,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 04:32:36,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 04:32:36,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 04:32:36,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 04:32:36,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 04:32:36,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 04:32:36,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 04:32:36,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 04:32:36,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 04:32:36,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 04:32:36,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 04:32:36,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 04:32:36,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 04:32:36,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 04:32:36,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 04:32:36,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 04:32:36,735 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 04:32:36,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 04:32:36,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 04:32:36,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 04:32:36,738 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 04:32:36,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 04:32:36,738 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 04:32:36,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 04:32:36,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 04:32:36,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 04:32:36,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 04:32:36,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 04:32:36,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 04:32:36,740 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 04:32:36,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 04:32:36,741 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 04:32:36,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 04:32:36,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 04:32:36,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 04:32:36,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 04:32:36,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 04:32:36,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 04:32:36,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 04:32:36,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 04:32:36,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 04:32:36,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 04:32:36,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 04:32:36,743 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 04:32:36,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 04:32:36,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 04:32:37,052 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 04:32:37,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 04:32:37,081 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 04:32:37,082 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 04:32:37,083 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 04:32:37,084 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2019-12-19 04:32:37,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb7dfc77/3ead1e0e6a614a1a9c022752d21855ec/FLAGcda3e0eae [2019-12-19 04:32:37,703 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 04:32:37,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2019-12-19 04:32:37,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb7dfc77/3ead1e0e6a614a1a9c022752d21855ec/FLAGcda3e0eae [2019-12-19 04:32:38,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb7dfc77/3ead1e0e6a614a1a9c022752d21855ec [2019-12-19 04:32:38,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 04:32:38,034 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 04:32:38,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 04:32:38,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 04:32:38,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 04:32:38,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:32:38" (1/1) ... [2019-12-19 04:32:38,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317ba546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:38, skipping insertion in model container [2019-12-19 04:32:38,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:32:38" (1/1) ... [2019-12-19 04:32:38,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 04:32:38,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 04:32:38,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:32:38,698 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 04:32:38,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:32:38,851 INFO L208 MainTranslator]: Completed translation [2019-12-19 04:32:38,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:38 WrapperNode [2019-12-19 04:32:38,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 04:32:38,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 04:32:38,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 04:32:38,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 04:32:38,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:38" (1/1) ... [2019-12-19 04:32:38,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:38" (1/1) ... [2019-12-19 04:32:38,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 04:32:38,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 04:32:38,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 04:32:38,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 04:32:38,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:38" (1/1) ... [2019-12-19 04:32:38,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:38" (1/1) ... [2019-12-19 04:32:38,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:38" (1/1) ... [2019-12-19 04:32:38,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:38" (1/1) ... [2019-12-19 04:32:38,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:38" (1/1) ... [2019-12-19 04:32:38,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:38" (1/1) ... [2019-12-19 04:32:38,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:38" (1/1) ... [2019-12-19 04:32:38,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 04:32:38,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 04:32:38,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 04:32:38,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 04:32:38,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:38" (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-12-19 04:32:39,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 04:32:39,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 04:32:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 04:32:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 04:32:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 04:32:39,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 04:32:39,029 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 04:32:39,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 04:32:39,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 04:32:39,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 04:32:39,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 04:32:39,035 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 04:32:39,751 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 04:32:39,751 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 04:32:39,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:32:39 BoogieIcfgContainer [2019-12-19 04:32:39,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 04:32:39,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 04:32:39,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 04:32:39,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 04:32:39,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 04:32:38" (1/3) ... [2019-12-19 04:32:39,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501ef792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:32:39, skipping insertion in model container [2019-12-19 04:32:39,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:38" (2/3) ... [2019-12-19 04:32:39,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501ef792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:32:39, skipping insertion in model container [2019-12-19 04:32:39,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:32:39" (3/3) ... [2019-12-19 04:32:39,762 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2019-12-19 04:32:39,772 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 04:32:39,772 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 04:32:39,780 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 04:32:39,781 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 04:32:39,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,817 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,818 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,818 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,819 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,819 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,827 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,827 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,840 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,840 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,841 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,844 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,845 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:39,861 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 04:32:39,882 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 04:32:39,882 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 04:32:39,882 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 04:32:39,882 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 04:32:39,883 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 04:32:39,883 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 04:32:39,883 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 04:32:39,883 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 04:32:39,898 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-19 04:32:41,211 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22510 states. [2019-12-19 04:32:41,213 INFO L276 IsEmpty]: Start isEmpty. Operand 22510 states. [2019-12-19 04:32:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-19 04:32:41,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:32:41,221 INFO L411 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] [2019-12-19 04:32:41,222 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:32:41,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:32:41,227 INFO L82 PathProgramCache]: Analyzing trace with hash 772326421, now seen corresponding path program 1 times [2019-12-19 04:32:41,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:32:41,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543069908] [2019-12-19 04:32:41,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:32:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:32:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:32:41,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543069908] [2019-12-19 04:32:41,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:32:41,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:32:41,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459512530] [2019-12-19 04:32:41,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:32:41,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:32:41,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:32:41,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:32:41,588 INFO L87 Difference]: Start difference. First operand 22510 states. Second operand 4 states. [2019-12-19 04:32:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:32:42,202 INFO L93 Difference]: Finished difference Result 23454 states and 91771 transitions. [2019-12-19 04:32:42,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:32:42,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-19 04:32:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:32:42,420 INFO L225 Difference]: With dead ends: 23454 [2019-12-19 04:32:42,420 INFO L226 Difference]: Without dead ends: 21278 [2019-12-19 04:32:42,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:32:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2019-12-19 04:32:44,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 21278. [2019-12-19 04:32:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21278 states. [2019-12-19 04:32:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21278 states to 21278 states and 83795 transitions. [2019-12-19 04:32:44,256 INFO L78 Accepts]: Start accepts. Automaton has 21278 states and 83795 transitions. Word has length 33 [2019-12-19 04:32:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:32:44,257 INFO L462 AbstractCegarLoop]: Abstraction has 21278 states and 83795 transitions. [2019-12-19 04:32:44,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:32:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21278 states and 83795 transitions. [2019-12-19 04:32:44,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-19 04:32:44,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:32:44,263 INFO L411 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] [2019-12-19 04:32:44,264 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:32:44,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:32:44,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2041424114, now seen corresponding path program 1 times [2019-12-19 04:32:44,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:32:44,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449403984] [2019-12-19 04:32:44,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:32:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:32:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:32:44,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449403984] [2019-12-19 04:32:44,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:32:44,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:32:44,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316535330] [2019-12-19 04:32:44,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:32:44,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:32:44,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:32:44,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:32:44,427 INFO L87 Difference]: Start difference. First operand 21278 states and 83795 transitions. Second operand 5 states. [2019-12-19 04:32:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:32:46,046 INFO L93 Difference]: Finished difference Result 34712 states and 129091 transitions. [2019-12-19 04:32:46,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:32:46,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-19 04:32:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:32:46,214 INFO L225 Difference]: With dead ends: 34712 [2019-12-19 04:32:46,214 INFO L226 Difference]: Without dead ends: 34568 [2019-12-19 04:32:46,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:32:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34568 states. [2019-12-19 04:32:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34568 to 33068. [2019-12-19 04:32:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-19 04:32:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 123979 transitions. [2019-12-19 04:32:48,650 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 123979 transitions. Word has length 44 [2019-12-19 04:32:48,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:32:48,651 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 123979 transitions. [2019-12-19 04:32:48,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:32:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 123979 transitions. [2019-12-19 04:32:48,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-19 04:32:48,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:32:48,655 INFO L411 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] [2019-12-19 04:32:48,656 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:32:48,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:32:48,656 INFO L82 PathProgramCache]: Analyzing trace with hash 865833508, now seen corresponding path program 1 times [2019-12-19 04:32:48,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:32:48,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042078772] [2019-12-19 04:32:48,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:32:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:32:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:32:48,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042078772] [2019-12-19 04:32:48,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:32:48,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:32:48,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465459164] [2019-12-19 04:32:48,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:32:48,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:32:48,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:32:48,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:32:48,775 INFO L87 Difference]: Start difference. First operand 33068 states and 123979 transitions. Second operand 5 states. [2019-12-19 04:32:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:32:49,350 INFO L93 Difference]: Finished difference Result 40220 states and 148648 transitions. [2019-12-19 04:32:49,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:32:49,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-19 04:32:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:32:49,526 INFO L225 Difference]: With dead ends: 40220 [2019-12-19 04:32:49,527 INFO L226 Difference]: Without dead ends: 40060 [2019-12-19 04:32:49,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:32:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40060 states. [2019-12-19 04:32:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40060 to 34641. [2019-12-19 04:32:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34641 states. [2019-12-19 04:32:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 129275 transitions. [2019-12-19 04:32:52,052 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 129275 transitions. Word has length 45 [2019-12-19 04:32:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:32:52,053 INFO L462 AbstractCegarLoop]: Abstraction has 34641 states and 129275 transitions. [2019-12-19 04:32:52,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:32:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 129275 transitions. [2019-12-19 04:32:52,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 04:32:52,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:32:52,068 INFO L411 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] [2019-12-19 04:32:52,068 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:32:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:32:52,069 INFO L82 PathProgramCache]: Analyzing trace with hash -566493931, now seen corresponding path program 1 times [2019-12-19 04:32:52,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:32:52,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351043175] [2019-12-19 04:32:52,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:32:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:32:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:32:52,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351043175] [2019-12-19 04:32:52,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:32:52,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:32:52,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145180066] [2019-12-19 04:32:52,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:32:52,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:32:52,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:32:52,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:32:52,457 INFO L87 Difference]: Start difference. First operand 34641 states and 129275 transitions. Second operand 6 states. [2019-12-19 04:32:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:32:53,497 INFO L93 Difference]: Finished difference Result 45669 states and 166169 transitions. [2019-12-19 04:32:53,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:32:53,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-19 04:32:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:32:53,750 INFO L225 Difference]: With dead ends: 45669 [2019-12-19 04:32:53,750 INFO L226 Difference]: Without dead ends: 45525 [2019-12-19 04:32:53,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-19 04:32:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45525 states. [2019-12-19 04:32:56,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45525 to 33604. [2019-12-19 04:32:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33604 states. [2019-12-19 04:32:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33604 states to 33604 states and 125430 transitions. [2019-12-19 04:32:56,133 INFO L78 Accepts]: Start accepts. Automaton has 33604 states and 125430 transitions. Word has length 52 [2019-12-19 04:32:56,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:32:56,133 INFO L462 AbstractCegarLoop]: Abstraction has 33604 states and 125430 transitions. [2019-12-19 04:32:56,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:32:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 33604 states and 125430 transitions. [2019-12-19 04:32:56,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-19 04:32:56,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:32:56,172 INFO L411 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] [2019-12-19 04:32:56,172 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:32:56,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:32:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash -885098341, now seen corresponding path program 1 times [2019-12-19 04:32:56,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:32:56,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889687245] [2019-12-19 04:32:56,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:32:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:32:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:32:56,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889687245] [2019-12-19 04:32:56,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:32:56,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:32:56,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101724097] [2019-12-19 04:32:56,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:32:56,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:32:56,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:32:56,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:32:56,274 INFO L87 Difference]: Start difference. First operand 33604 states and 125430 transitions. Second operand 6 states. [2019-12-19 04:32:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:32:57,203 INFO L93 Difference]: Finished difference Result 46076 states and 167863 transitions. [2019-12-19 04:32:57,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:32:57,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-19 04:32:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:32:57,328 INFO L225 Difference]: With dead ends: 46076 [2019-12-19 04:32:57,328 INFO L226 Difference]: Without dead ends: 45836 [2019-12-19 04:32:57,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:32:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45836 states. [2019-12-19 04:32:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45836 to 39965. [2019-12-19 04:32:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39965 states. [2019-12-19 04:33:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39965 states to 39965 states and 147354 transitions. [2019-12-19 04:33:00,036 INFO L78 Accepts]: Start accepts. Automaton has 39965 states and 147354 transitions. Word has length 59 [2019-12-19 04:33:00,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:00,036 INFO L462 AbstractCegarLoop]: Abstraction has 39965 states and 147354 transitions. [2019-12-19 04:33:00,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 39965 states and 147354 transitions. [2019-12-19 04:33:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 04:33:00,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:00,075 INFO L411 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] [2019-12-19 04:33:00,075 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:00,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:00,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1504066544, now seen corresponding path program 1 times [2019-12-19 04:33:00,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:00,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345847490] [2019-12-19 04:33:00,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:00,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345847490] [2019-12-19 04:33:00,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:00,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:33:00,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050239577] [2019-12-19 04:33:00,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:33:00,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:00,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:33:00,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:33:00,121 INFO L87 Difference]: Start difference. First operand 39965 states and 147354 transitions. Second operand 3 states. [2019-12-19 04:33:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:00,406 INFO L93 Difference]: Finished difference Result 50263 states and 182189 transitions. [2019-12-19 04:33:00,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:33:00,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-19 04:33:00,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:00,504 INFO L225 Difference]: With dead ends: 50263 [2019-12-19 04:33:00,504 INFO L226 Difference]: Without dead ends: 50263 [2019-12-19 04:33:00,505 INFO L631 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-12-19 04:33:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50263 states. [2019-12-19 04:33:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50263 to 43895. [2019-12-19 04:33:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43895 states. [2019-12-19 04:33:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43895 states to 43895 states and 160792 transitions. [2019-12-19 04:33:01,514 INFO L78 Accepts]: Start accepts. Automaton has 43895 states and 160792 transitions. Word has length 61 [2019-12-19 04:33:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:01,515 INFO L462 AbstractCegarLoop]: Abstraction has 43895 states and 160792 transitions. [2019-12-19 04:33:01,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:33:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 43895 states and 160792 transitions. [2019-12-19 04:33:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 04:33:01,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:01,546 INFO L411 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] [2019-12-19 04:33:01,547 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:01,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:01,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1371095923, now seen corresponding path program 1 times [2019-12-19 04:33:01,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:01,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698618134] [2019-12-19 04:33:01,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:01,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698618134] [2019-12-19 04:33:01,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:01,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:01,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748557111] [2019-12-19 04:33:01,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:01,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:01,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:01,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:01,649 INFO L87 Difference]: Start difference. First operand 43895 states and 160792 transitions. Second operand 7 states. [2019-12-19 04:33:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:02,716 INFO L93 Difference]: Finished difference Result 55891 states and 200526 transitions. [2019-12-19 04:33:02,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 04:33:02,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-19 04:33:02,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:03,342 INFO L225 Difference]: With dead ends: 55891 [2019-12-19 04:33:03,343 INFO L226 Difference]: Without dead ends: 55651 [2019-12-19 04:33:03,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 04:33:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55651 states. [2019-12-19 04:33:04,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55651 to 45121. [2019-12-19 04:33:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45121 states. [2019-12-19 04:33:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45121 states to 45121 states and 164959 transitions. [2019-12-19 04:33:04,169 INFO L78 Accepts]: Start accepts. Automaton has 45121 states and 164959 transitions. Word has length 65 [2019-12-19 04:33:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:04,170 INFO L462 AbstractCegarLoop]: Abstraction has 45121 states and 164959 transitions. [2019-12-19 04:33:04,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 45121 states and 164959 transitions. [2019-12-19 04:33:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 04:33:06,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:06,219 INFO L411 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] [2019-12-19 04:33:06,219 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:06,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:06,219 INFO L82 PathProgramCache]: Analyzing trace with hash -330249588, now seen corresponding path program 1 times [2019-12-19 04:33:06,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:06,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911334107] [2019-12-19 04:33:06,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:06,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911334107] [2019-12-19 04:33:06,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:06,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:33:06,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574120591] [2019-12-19 04:33:06,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:33:06,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:06,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:33:06,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:33:06,297 INFO L87 Difference]: Start difference. First operand 45121 states and 164959 transitions. Second operand 4 states. [2019-12-19 04:33:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:06,899 INFO L93 Difference]: Finished difference Result 69403 states and 252019 transitions. [2019-12-19 04:33:06,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:33:06,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-19 04:33:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:07,105 INFO L225 Difference]: With dead ends: 69403 [2019-12-19 04:33:07,105 INFO L226 Difference]: Without dead ends: 69403 [2019-12-19 04:33:07,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:07,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69403 states. [2019-12-19 04:33:08,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69403 to 53611. [2019-12-19 04:33:08,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53611 states. [2019-12-19 04:33:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53611 states to 53611 states and 195428 transitions. [2019-12-19 04:33:08,362 INFO L78 Accepts]: Start accepts. Automaton has 53611 states and 195428 transitions. Word has length 66 [2019-12-19 04:33:08,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:08,362 INFO L462 AbstractCegarLoop]: Abstraction has 53611 states and 195428 transitions. [2019-12-19 04:33:08,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:33:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand 53611 states and 195428 transitions. [2019-12-19 04:33:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 04:33:08,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:08,401 INFO L411 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] [2019-12-19 04:33:08,401 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash 434850924, now seen corresponding path program 1 times [2019-12-19 04:33:08,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:08,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75997964] [2019-12-19 04:33:08,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:08,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75997964] [2019-12-19 04:33:08,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:08,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:08,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852541070] [2019-12-19 04:33:08,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:08,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:08,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:08,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:08,531 INFO L87 Difference]: Start difference. First operand 53611 states and 195428 transitions. Second operand 7 states. [2019-12-19 04:33:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:09,809 INFO L93 Difference]: Finished difference Result 63822 states and 228895 transitions. [2019-12-19 04:33:09,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 04:33:09,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-19 04:33:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:10,388 INFO L225 Difference]: With dead ends: 63822 [2019-12-19 04:33:10,388 INFO L226 Difference]: Without dead ends: 63622 [2019-12-19 04:33:10,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-19 04:33:10,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63622 states. [2019-12-19 04:33:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63622 to 54380. [2019-12-19 04:33:11,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54380 states. [2019-12-19 04:33:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54380 states to 54380 states and 197958 transitions. [2019-12-19 04:33:11,333 INFO L78 Accepts]: Start accepts. Automaton has 54380 states and 197958 transitions. Word has length 66 [2019-12-19 04:33:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:11,334 INFO L462 AbstractCegarLoop]: Abstraction has 54380 states and 197958 transitions. [2019-12-19 04:33:11,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 54380 states and 197958 transitions. [2019-12-19 04:33:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:33:11,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:11,924 INFO L411 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] [2019-12-19 04:33:11,924 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:11,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:11,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1137053182, now seen corresponding path program 1 times [2019-12-19 04:33:11,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:11,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274124014] [2019-12-19 04:33:11,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:12,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274124014] [2019-12-19 04:33:12,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:12,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:12,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402609831] [2019-12-19 04:33:12,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:12,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:12,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:12,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:12,042 INFO L87 Difference]: Start difference. First operand 54380 states and 197958 transitions. Second operand 6 states. [2019-12-19 04:33:12,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:12,797 INFO L93 Difference]: Finished difference Result 75817 states and 274672 transitions. [2019-12-19 04:33:12,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:33:12,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 04:33:12,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:12,949 INFO L225 Difference]: With dead ends: 75817 [2019-12-19 04:33:12,949 INFO L226 Difference]: Without dead ends: 75173 [2019-12-19 04:33:12,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75173 states. [2019-12-19 04:33:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75173 to 65280. [2019-12-19 04:33:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65280 states. [2019-12-19 04:33:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65280 states to 65280 states and 238125 transitions. [2019-12-19 04:33:16,426 INFO L78 Accepts]: Start accepts. Automaton has 65280 states and 238125 transitions. Word has length 68 [2019-12-19 04:33:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:16,426 INFO L462 AbstractCegarLoop]: Abstraction has 65280 states and 238125 transitions. [2019-12-19 04:33:16,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 65280 states and 238125 transitions. [2019-12-19 04:33:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:33:16,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:16,494 INFO L411 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] [2019-12-19 04:33:16,494 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:16,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2098667199, now seen corresponding path program 1 times [2019-12-19 04:33:16,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:16,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475001825] [2019-12-19 04:33:16,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:16,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475001825] [2019-12-19 04:33:16,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:16,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:16,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817166665] [2019-12-19 04:33:16,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:16,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:16,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:16,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:16,603 INFO L87 Difference]: Start difference. First operand 65280 states and 238125 transitions. Second operand 7 states. [2019-12-19 04:33:17,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:17,720 INFO L93 Difference]: Finished difference Result 92241 states and 326467 transitions. [2019-12-19 04:33:17,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:33:17,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-19 04:33:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:17,937 INFO L225 Difference]: With dead ends: 92241 [2019-12-19 04:33:17,937 INFO L226 Difference]: Without dead ends: 92241 [2019-12-19 04:33:17,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:33:18,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92241 states. [2019-12-19 04:33:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92241 to 84350. [2019-12-19 04:33:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84350 states. [2019-12-19 04:33:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84350 states to 84350 states and 301234 transitions. [2019-12-19 04:33:20,118 INFO L78 Accepts]: Start accepts. Automaton has 84350 states and 301234 transitions. Word has length 68 [2019-12-19 04:33:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:20,118 INFO L462 AbstractCegarLoop]: Abstraction has 84350 states and 301234 transitions. [2019-12-19 04:33:20,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 84350 states and 301234 transitions. [2019-12-19 04:33:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:33:23,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:23,358 INFO L411 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] [2019-12-19 04:33:23,358 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:23,358 INFO L82 PathProgramCache]: Analyzing trace with hash -951535616, now seen corresponding path program 1 times [2019-12-19 04:33:23,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:23,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088402228] [2019-12-19 04:33:23,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:23,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088402228] [2019-12-19 04:33:23,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:23,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:33:23,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995797531] [2019-12-19 04:33:23,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:33:23,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:23,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:33:23,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:33:23,417 INFO L87 Difference]: Start difference. First operand 84350 states and 301234 transitions. Second operand 3 states. [2019-12-19 04:33:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:23,756 INFO L93 Difference]: Finished difference Result 63509 states and 230498 transitions. [2019-12-19 04:33:23,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:33:23,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-19 04:33:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:23,893 INFO L225 Difference]: With dead ends: 63509 [2019-12-19 04:33:23,893 INFO L226 Difference]: Without dead ends: 63347 [2019-12-19 04:33:23,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:33:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63347 states. [2019-12-19 04:33:24,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63347 to 63307. [2019-12-19 04:33:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63307 states. [2019-12-19 04:33:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63307 states to 63307 states and 229913 transitions. [2019-12-19 04:33:25,489 INFO L78 Accepts]: Start accepts. Automaton has 63307 states and 229913 transitions. Word has length 68 [2019-12-19 04:33:25,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:25,489 INFO L462 AbstractCegarLoop]: Abstraction has 63307 states and 229913 transitions. [2019-12-19 04:33:25,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:33:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 63307 states and 229913 transitions. [2019-12-19 04:33:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 04:33:25,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:25,545 INFO L411 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] [2019-12-19 04:33:25,545 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:25,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:25,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1567683976, now seen corresponding path program 1 times [2019-12-19 04:33:25,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:25,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057011058] [2019-12-19 04:33:25,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:25,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057011058] [2019-12-19 04:33:25,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:25,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:25,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197604778] [2019-12-19 04:33:25,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:25,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:25,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:25,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:25,651 INFO L87 Difference]: Start difference. First operand 63307 states and 229913 transitions. Second operand 5 states. [2019-12-19 04:33:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:26,305 INFO L93 Difference]: Finished difference Result 84435 states and 303683 transitions. [2019-12-19 04:33:26,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:33:26,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 04:33:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:26,488 INFO L225 Difference]: With dead ends: 84435 [2019-12-19 04:33:26,488 INFO L226 Difference]: Without dead ends: 84239 [2019-12-19 04:33:26,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84239 states. [2019-12-19 04:33:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84239 to 76154. [2019-12-19 04:33:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76154 states. [2019-12-19 04:33:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76154 states to 76154 states and 275571 transitions. [2019-12-19 04:33:28,431 INFO L78 Accepts]: Start accepts. Automaton has 76154 states and 275571 transitions. Word has length 69 [2019-12-19 04:33:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:28,431 INFO L462 AbstractCegarLoop]: Abstraction has 76154 states and 275571 transitions. [2019-12-19 04:33:28,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 76154 states and 275571 transitions. [2019-12-19 04:33:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 04:33:28,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:28,510 INFO L411 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] [2019-12-19 04:33:28,510 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:28,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:28,510 INFO L82 PathProgramCache]: Analyzing trace with hash -322919495, now seen corresponding path program 1 times [2019-12-19 04:33:28,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:28,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36668821] [2019-12-19 04:33:28,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:28,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36668821] [2019-12-19 04:33:28,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:28,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:33:28,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52330336] [2019-12-19 04:33:28,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:33:28,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:28,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:33:28,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:33:28,582 INFO L87 Difference]: Start difference. First operand 76154 states and 275571 transitions. Second operand 4 states. [2019-12-19 04:33:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:28,691 INFO L93 Difference]: Finished difference Result 19622 states and 62292 transitions. [2019-12-19 04:33:28,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:33:28,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-19 04:33:28,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:28,736 INFO L225 Difference]: With dead ends: 19622 [2019-12-19 04:33:28,737 INFO L226 Difference]: Without dead ends: 19144 [2019-12-19 04:33:28,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19144 states. [2019-12-19 04:33:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19144 to 19132. [2019-12-19 04:33:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19132 states. [2019-12-19 04:33:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19132 states to 19132 states and 60787 transitions. [2019-12-19 04:33:29,009 INFO L78 Accepts]: Start accepts. Automaton has 19132 states and 60787 transitions. Word has length 69 [2019-12-19 04:33:29,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:29,009 INFO L462 AbstractCegarLoop]: Abstraction has 19132 states and 60787 transitions. [2019-12-19 04:33:29,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:33:29,010 INFO L276 IsEmpty]: Start isEmpty. Operand 19132 states and 60787 transitions. [2019-12-19 04:33:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 04:33:29,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:29,030 INFO L411 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] [2019-12-19 04:33:29,031 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:29,031 INFO L82 PathProgramCache]: Analyzing trace with hash 992958347, now seen corresponding path program 1 times [2019-12-19 04:33:29,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:29,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172028722] [2019-12-19 04:33:29,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:29,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172028722] [2019-12-19 04:33:29,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:29,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:33:29,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64781899] [2019-12-19 04:33:29,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:33:29,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:29,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:33:29,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:33:29,093 INFO L87 Difference]: Start difference. First operand 19132 states and 60787 transitions. Second operand 4 states. [2019-12-19 04:33:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:29,357 INFO L93 Difference]: Finished difference Result 24082 states and 75455 transitions. [2019-12-19 04:33:29,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:33:29,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-19 04:33:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:29,402 INFO L225 Difference]: With dead ends: 24082 [2019-12-19 04:33:29,402 INFO L226 Difference]: Without dead ends: 24082 [2019-12-19 04:33:29,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24082 states. [2019-12-19 04:33:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24082 to 19972. [2019-12-19 04:33:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19972 states. [2019-12-19 04:33:29,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19972 states to 19972 states and 63154 transitions. [2019-12-19 04:33:29,674 INFO L78 Accepts]: Start accepts. Automaton has 19972 states and 63154 transitions. Word has length 78 [2019-12-19 04:33:29,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:29,675 INFO L462 AbstractCegarLoop]: Abstraction has 19972 states and 63154 transitions. [2019-12-19 04:33:29,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:33:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 19972 states and 63154 transitions. [2019-12-19 04:33:29,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 04:33:29,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:29,691 INFO L411 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] [2019-12-19 04:33:29,691 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:29,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:29,691 INFO L82 PathProgramCache]: Analyzing trace with hash 738221802, now seen corresponding path program 1 times [2019-12-19 04:33:29,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:29,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707456709] [2019-12-19 04:33:29,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:29,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707456709] [2019-12-19 04:33:29,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:29,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:33:29,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871742569] [2019-12-19 04:33:29,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:33:29,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:29,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:33:29,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:29,781 INFO L87 Difference]: Start difference. First operand 19972 states and 63154 transitions. Second operand 8 states. [2019-12-19 04:33:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:30,780 INFO L93 Difference]: Finished difference Result 22078 states and 69346 transitions. [2019-12-19 04:33:30,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 04:33:30,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-12-19 04:33:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:30,813 INFO L225 Difference]: With dead ends: 22078 [2019-12-19 04:33:30,814 INFO L226 Difference]: Without dead ends: 22030 [2019-12-19 04:33:30,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-19 04:33:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22030 states. [2019-12-19 04:33:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22030 to 19444. [2019-12-19 04:33:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19444 states. [2019-12-19 04:33:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19444 states to 19444 states and 61656 transitions. [2019-12-19 04:33:31,083 INFO L78 Accepts]: Start accepts. Automaton has 19444 states and 61656 transitions. Word has length 78 [2019-12-19 04:33:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:31,084 INFO L462 AbstractCegarLoop]: Abstraction has 19444 states and 61656 transitions. [2019-12-19 04:33:31,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:33:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 19444 states and 61656 transitions. [2019-12-19 04:33:31,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:33:31,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:31,104 INFO L411 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] [2019-12-19 04:33:31,104 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:31,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:31,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1156410968, now seen corresponding path program 1 times [2019-12-19 04:33:31,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:31,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443233010] [2019-12-19 04:33:31,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:31,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443233010] [2019-12-19 04:33:31,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:31,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:33:31,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856576054] [2019-12-19 04:33:31,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:33:31,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:31,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:33:31,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:31,182 INFO L87 Difference]: Start difference. First operand 19444 states and 61656 transitions. Second operand 8 states. [2019-12-19 04:33:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:33,826 INFO L93 Difference]: Finished difference Result 50438 states and 153674 transitions. [2019-12-19 04:33:33,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-19 04:33:33,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-12-19 04:33:33,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:33,906 INFO L225 Difference]: With dead ends: 50438 [2019-12-19 04:33:33,906 INFO L226 Difference]: Without dead ends: 49739 [2019-12-19 04:33:33,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-19 04:33:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49739 states. [2019-12-19 04:33:34,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49739 to 29972. [2019-12-19 04:33:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29972 states. [2019-12-19 04:33:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29972 states to 29972 states and 93586 transitions. [2019-12-19 04:33:34,436 INFO L78 Accepts]: Start accepts. Automaton has 29972 states and 93586 transitions. Word has length 81 [2019-12-19 04:33:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:34,437 INFO L462 AbstractCegarLoop]: Abstraction has 29972 states and 93586 transitions. [2019-12-19 04:33:34,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:33:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 29972 states and 93586 transitions. [2019-12-19 04:33:34,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:33:34,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:34,464 INFO L411 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] [2019-12-19 04:33:34,464 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:34,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:34,465 INFO L82 PathProgramCache]: Analyzing trace with hash -194796951, now seen corresponding path program 1 times [2019-12-19 04:33:34,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:34,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775696812] [2019-12-19 04:33:34,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:34,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775696812] [2019-12-19 04:33:34,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:34,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:34,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196372683] [2019-12-19 04:33:34,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:34,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:34,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:34,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:34,583 INFO L87 Difference]: Start difference. First operand 29972 states and 93586 transitions. Second operand 6 states. [2019-12-19 04:33:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:35,304 INFO L93 Difference]: Finished difference Result 31402 states and 97511 transitions. [2019-12-19 04:33:35,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:33:35,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-19 04:33:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:35,386 INFO L225 Difference]: With dead ends: 31402 [2019-12-19 04:33:35,387 INFO L226 Difference]: Without dead ends: 31402 [2019-12-19 04:33:35,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:35,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31402 states. [2019-12-19 04:33:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31402 to 29633. [2019-12-19 04:33:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29633 states. [2019-12-19 04:33:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29633 states to 29633 states and 92417 transitions. [2019-12-19 04:33:36,159 INFO L78 Accepts]: Start accepts. Automaton has 29633 states and 92417 transitions. Word has length 81 [2019-12-19 04:33:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:36,160 INFO L462 AbstractCegarLoop]: Abstraction has 29633 states and 92417 transitions. [2019-12-19 04:33:36,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 29633 states and 92417 transitions. [2019-12-19 04:33:36,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:33:36,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:36,213 INFO L411 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] [2019-12-19 04:33:36,214 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:36,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:36,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2130457238, now seen corresponding path program 1 times [2019-12-19 04:33:36,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:36,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335991293] [2019-12-19 04:33:36,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:36,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335991293] [2019-12-19 04:33:36,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:36,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:36,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801819923] [2019-12-19 04:33:36,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:36,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:36,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:36,365 INFO L87 Difference]: Start difference. First operand 29633 states and 92417 transitions. Second operand 7 states. [2019-12-19 04:33:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:36,916 INFO L93 Difference]: Finished difference Result 31147 states and 96573 transitions. [2019-12-19 04:33:36,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:33:36,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-19 04:33:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:36,961 INFO L225 Difference]: With dead ends: 31147 [2019-12-19 04:33:36,961 INFO L226 Difference]: Without dead ends: 31147 [2019-12-19 04:33:36,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:33:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31147 states. [2019-12-19 04:33:37,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31147 to 29965. [2019-12-19 04:33:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29965 states. [2019-12-19 04:33:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29965 states to 29965 states and 93248 transitions. [2019-12-19 04:33:37,354 INFO L78 Accepts]: Start accepts. Automaton has 29965 states and 93248 transitions. Word has length 81 [2019-12-19 04:33:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:37,355 INFO L462 AbstractCegarLoop]: Abstraction has 29965 states and 93248 transitions. [2019-12-19 04:33:37,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 29965 states and 93248 transitions. [2019-12-19 04:33:37,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:33:37,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:37,384 INFO L411 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] [2019-12-19 04:33:37,384 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:37,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:37,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1800691477, now seen corresponding path program 1 times [2019-12-19 04:33:37,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:37,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931530209] [2019-12-19 04:33:37,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:37,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931530209] [2019-12-19 04:33:37,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:37,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:37,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188923029] [2019-12-19 04:33:37,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:37,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:37,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:37,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:37,463 INFO L87 Difference]: Start difference. First operand 29965 states and 93248 transitions. Second operand 5 states. [2019-12-19 04:33:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:37,506 INFO L93 Difference]: Finished difference Result 4528 states and 11184 transitions. [2019-12-19 04:33:37,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:33:37,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-19 04:33:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:37,512 INFO L225 Difference]: With dead ends: 4528 [2019-12-19 04:33:37,512 INFO L226 Difference]: Without dead ends: 3738 [2019-12-19 04:33:37,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2019-12-19 04:33:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3435. [2019-12-19 04:33:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-12-19 04:33:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 8385 transitions. [2019-12-19 04:33:37,560 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 8385 transitions. Word has length 81 [2019-12-19 04:33:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:37,561 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 8385 transitions. [2019-12-19 04:33:37,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 8385 transitions. [2019-12-19 04:33:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:37,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:37,565 INFO L411 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] [2019-12-19 04:33:37,566 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:37,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:37,566 INFO L82 PathProgramCache]: Analyzing trace with hash 636830190, now seen corresponding path program 1 times [2019-12-19 04:33:37,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:37,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7215573] [2019-12-19 04:33:37,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:37,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7215573] [2019-12-19 04:33:37,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:37,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:37,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340907067] [2019-12-19 04:33:37,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:37,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:37,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:37,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:37,734 INFO L87 Difference]: Start difference. First operand 3435 states and 8385 transitions. Second operand 6 states. [2019-12-19 04:33:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:38,042 INFO L93 Difference]: Finished difference Result 3465 states and 8375 transitions. [2019-12-19 04:33:38,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 04:33:38,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:33:38,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:38,048 INFO L225 Difference]: With dead ends: 3465 [2019-12-19 04:33:38,048 INFO L226 Difference]: Without dead ends: 3465 [2019-12-19 04:33:38,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:33:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2019-12-19 04:33:38,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 3315. [2019-12-19 04:33:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3315 states. [2019-12-19 04:33:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 8065 transitions. [2019-12-19 04:33:38,079 INFO L78 Accepts]: Start accepts. Automaton has 3315 states and 8065 transitions. Word has length 93 [2019-12-19 04:33:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:38,079 INFO L462 AbstractCegarLoop]: Abstraction has 3315 states and 8065 transitions. [2019-12-19 04:33:38,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:38,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 8065 transitions. [2019-12-19 04:33:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:38,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:38,083 INFO L411 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] [2019-12-19 04:33:38,083 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:38,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:38,083 INFO L82 PathProgramCache]: Analyzing trace with hash 966595951, now seen corresponding path program 1 times [2019-12-19 04:33:38,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:38,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607233758] [2019-12-19 04:33:38,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:38,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607233758] [2019-12-19 04:33:38,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:38,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:33:38,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022379628] [2019-12-19 04:33:38,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:33:38,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:38,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:33:38,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:33:38,142 INFO L87 Difference]: Start difference. First operand 3315 states and 8065 transitions. Second operand 4 states. [2019-12-19 04:33:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:38,289 INFO L93 Difference]: Finished difference Result 4130 states and 9838 transitions. [2019-12-19 04:33:38,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:33:38,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-19 04:33:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:38,296 INFO L225 Difference]: With dead ends: 4130 [2019-12-19 04:33:38,296 INFO L226 Difference]: Without dead ends: 4073 [2019-12-19 04:33:38,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:33:38,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2019-12-19 04:33:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 3580. [2019-12-19 04:33:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3580 states. [2019-12-19 04:33:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 8651 transitions. [2019-12-19 04:33:38,356 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 8651 transitions. Word has length 93 [2019-12-19 04:33:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:38,356 INFO L462 AbstractCegarLoop]: Abstraction has 3580 states and 8651 transitions. [2019-12-19 04:33:38,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:33:38,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 8651 transitions. [2019-12-19 04:33:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:38,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:38,363 INFO L411 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] [2019-12-19 04:33:38,363 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:38,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:38,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1662428928, now seen corresponding path program 1 times [2019-12-19 04:33:38,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:38,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008871071] [2019-12-19 04:33:38,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:38,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008871071] [2019-12-19 04:33:38,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:38,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:38,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648285676] [2019-12-19 04:33:38,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:38,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:38,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:38,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:38,450 INFO L87 Difference]: Start difference. First operand 3580 states and 8651 transitions. Second operand 5 states. [2019-12-19 04:33:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:38,990 INFO L93 Difference]: Finished difference Result 5452 states and 13125 transitions. [2019-12-19 04:33:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:33:38,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-19 04:33:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:38,997 INFO L225 Difference]: With dead ends: 5452 [2019-12-19 04:33:38,997 INFO L226 Difference]: Without dead ends: 5452 [2019-12-19 04:33:38,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-12-19 04:33:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 3913. [2019-12-19 04:33:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2019-12-19 04:33:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 9527 transitions. [2019-12-19 04:33:39,063 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 9527 transitions. Word has length 93 [2019-12-19 04:33:39,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:39,063 INFO L462 AbstractCegarLoop]: Abstraction has 3913 states and 9527 transitions. [2019-12-19 04:33:39,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 9527 transitions. [2019-12-19 04:33:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:39,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:39,070 INFO L411 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] [2019-12-19 04:33:39,070 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:39,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1945579392, now seen corresponding path program 1 times [2019-12-19 04:33:39,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:39,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465630117] [2019-12-19 04:33:39,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:39,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465630117] [2019-12-19 04:33:39,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:39,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:39,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243099876] [2019-12-19 04:33:39,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:39,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:39,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:39,196 INFO L87 Difference]: Start difference. First operand 3913 states and 9527 transitions. Second operand 6 states. [2019-12-19 04:33:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:39,449 INFO L93 Difference]: Finished difference Result 4703 states and 11075 transitions. [2019-12-19 04:33:39,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:33:39,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:33:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:39,455 INFO L225 Difference]: With dead ends: 4703 [2019-12-19 04:33:39,456 INFO L226 Difference]: Without dead ends: 4703 [2019-12-19 04:33:39,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 04:33:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2019-12-19 04:33:39,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 4080. [2019-12-19 04:33:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4080 states. [2019-12-19 04:33:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 9838 transitions. [2019-12-19 04:33:39,507 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 9838 transitions. Word has length 93 [2019-12-19 04:33:39,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:39,507 INFO L462 AbstractCegarLoop]: Abstraction has 4080 states and 9838 transitions. [2019-12-19 04:33:39,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 9838 transitions. [2019-12-19 04:33:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:39,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:39,511 INFO L411 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] [2019-12-19 04:33:39,511 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash 648647425, now seen corresponding path program 1 times [2019-12-19 04:33:39,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:39,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770227022] [2019-12-19 04:33:39,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:39,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770227022] [2019-12-19 04:33:39,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:39,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:39,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330488960] [2019-12-19 04:33:39,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:39,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:39,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:39,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:39,579 INFO L87 Difference]: Start difference. First operand 4080 states and 9838 transitions. Second operand 5 states. [2019-12-19 04:33:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:39,797 INFO L93 Difference]: Finished difference Result 4870 states and 11542 transitions. [2019-12-19 04:33:39,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:33:39,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-19 04:33:39,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:39,804 INFO L225 Difference]: With dead ends: 4870 [2019-12-19 04:33:39,805 INFO L226 Difference]: Without dead ends: 4824 [2019-12-19 04:33:39,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2019-12-19 04:33:39,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4158. [2019-12-19 04:33:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4158 states. [2019-12-19 04:33:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 10005 transitions. [2019-12-19 04:33:39,841 INFO L78 Accepts]: Start accepts. Automaton has 4158 states and 10005 transitions. Word has length 93 [2019-12-19 04:33:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:39,841 INFO L462 AbstractCegarLoop]: Abstraction has 4158 states and 10005 transitions. [2019-12-19 04:33:39,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4158 states and 10005 transitions. [2019-12-19 04:33:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:39,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:39,845 INFO L411 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] [2019-12-19 04:33:39,845 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:39,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:39,846 INFO L82 PathProgramCache]: Analyzing trace with hash 970728323, now seen corresponding path program 1 times [2019-12-19 04:33:39,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:39,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126282333] [2019-12-19 04:33:39,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:39,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126282333] [2019-12-19 04:33:39,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:39,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:39,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830998237] [2019-12-19 04:33:39,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:39,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:39,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:39,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:39,951 INFO L87 Difference]: Start difference. First operand 4158 states and 10005 transitions. Second operand 7 states. [2019-12-19 04:33:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:40,521 INFO L93 Difference]: Finished difference Result 5046 states and 11917 transitions. [2019-12-19 04:33:40,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:33:40,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-12-19 04:33:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:40,529 INFO L225 Difference]: With dead ends: 5046 [2019-12-19 04:33:40,530 INFO L226 Difference]: Without dead ends: 5002 [2019-12-19 04:33:40,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:33:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2019-12-19 04:33:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4203. [2019-12-19 04:33:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4203 states. [2019-12-19 04:33:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4203 states to 4203 states and 10074 transitions. [2019-12-19 04:33:40,594 INFO L78 Accepts]: Start accepts. Automaton has 4203 states and 10074 transitions. Word has length 93 [2019-12-19 04:33:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:40,595 INFO L462 AbstractCegarLoop]: Abstraction has 4203 states and 10074 transitions. [2019-12-19 04:33:40,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4203 states and 10074 transitions. [2019-12-19 04:33:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:40,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:40,600 INFO L411 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] [2019-12-19 04:33:40,600 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:40,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:40,601 INFO L82 PathProgramCache]: Analyzing trace with hash 83557860, now seen corresponding path program 1 times [2019-12-19 04:33:40,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:40,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545674914] [2019-12-19 04:33:40,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:40,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:40,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545674914] [2019-12-19 04:33:40,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:40,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:40,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698206001] [2019-12-19 04:33:40,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:40,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:40,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:40,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:40,689 INFO L87 Difference]: Start difference. First operand 4203 states and 10074 transitions. Second operand 6 states. [2019-12-19 04:33:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:40,834 INFO L93 Difference]: Finished difference Result 3248 states and 7928 transitions. [2019-12-19 04:33:40,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:33:40,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:33:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:40,841 INFO L225 Difference]: With dead ends: 3248 [2019-12-19 04:33:40,841 INFO L226 Difference]: Without dead ends: 3248 [2019-12-19 04:33:40,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:40,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2019-12-19 04:33:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2988. [2019-12-19 04:33:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-12-19 04:33:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 7372 transitions. [2019-12-19 04:33:40,898 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 7372 transitions. Word has length 93 [2019-12-19 04:33:40,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:40,899 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 7372 transitions. [2019-12-19 04:33:40,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 7372 transitions. [2019-12-19 04:33:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:40,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:40,904 INFO L411 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] [2019-12-19 04:33:40,904 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:40,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:40,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1079948161, now seen corresponding path program 1 times [2019-12-19 04:33:40,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:40,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763029114] [2019-12-19 04:33:40,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:41,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763029114] [2019-12-19 04:33:41,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:41,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:41,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28642202] [2019-12-19 04:33:41,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:41,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:41,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:41,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:41,048 INFO L87 Difference]: Start difference. First operand 2988 states and 7372 transitions. Second operand 6 states. [2019-12-19 04:33:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:41,137 INFO L93 Difference]: Finished difference Result 3169 states and 7662 transitions. [2019-12-19 04:33:41,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:33:41,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 04:33:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:41,143 INFO L225 Difference]: With dead ends: 3169 [2019-12-19 04:33:41,143 INFO L226 Difference]: Without dead ends: 3124 [2019-12-19 04:33:41,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2019-12-19 04:33:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3050. [2019-12-19 04:33:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3050 states. [2019-12-19 04:33:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 7431 transitions. [2019-12-19 04:33:41,186 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 7431 transitions. Word has length 95 [2019-12-19 04:33:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:41,186 INFO L462 AbstractCegarLoop]: Abstraction has 3050 states and 7431 transitions. [2019-12-19 04:33:41,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 7431 transitions. [2019-12-19 04:33:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:41,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:41,191 INFO L411 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] [2019-12-19 04:33:41,191 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1737866465, now seen corresponding path program 2 times [2019-12-19 04:33:41,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:41,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71929338] [2019-12-19 04:33:41,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:41,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71929338] [2019-12-19 04:33:41,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:41,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:41,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401159361] [2019-12-19 04:33:41,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:41,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:41,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:41,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:41,296 INFO L87 Difference]: Start difference. First operand 3050 states and 7431 transitions. Second operand 6 states. [2019-12-19 04:33:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:41,504 INFO L93 Difference]: Finished difference Result 3282 states and 7887 transitions. [2019-12-19 04:33:41,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 04:33:41,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 04:33:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:41,509 INFO L225 Difference]: With dead ends: 3282 [2019-12-19 04:33:41,509 INFO L226 Difference]: Without dead ends: 3282 [2019-12-19 04:33:41,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:33:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2019-12-19 04:33:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3176. [2019-12-19 04:33:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3176 states. [2019-12-19 04:33:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 3176 states and 7680 transitions. [2019-12-19 04:33:41,564 INFO L78 Accepts]: Start accepts. Automaton has 3176 states and 7680 transitions. Word has length 95 [2019-12-19 04:33:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:41,565 INFO L462 AbstractCegarLoop]: Abstraction has 3176 states and 7680 transitions. [2019-12-19 04:33:41,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3176 states and 7680 transitions. [2019-12-19 04:33:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:41,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:41,569 INFO L411 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] [2019-12-19 04:33:41,570 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:41,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:41,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1408100704, now seen corresponding path program 1 times [2019-12-19 04:33:41,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:41,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105602038] [2019-12-19 04:33:41,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:41,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105602038] [2019-12-19 04:33:41,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:41,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:41,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110722900] [2019-12-19 04:33:41,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:41,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:41,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:41,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:41,635 INFO L87 Difference]: Start difference. First operand 3176 states and 7680 transitions. Second operand 5 states. [2019-12-19 04:33:41,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:41,807 INFO L93 Difference]: Finished difference Result 3783 states and 8972 transitions. [2019-12-19 04:33:41,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:33:41,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 04:33:41,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:41,814 INFO L225 Difference]: With dead ends: 3783 [2019-12-19 04:33:41,814 INFO L226 Difference]: Without dead ends: 3783 [2019-12-19 04:33:41,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2019-12-19 04:33:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3514. [2019-12-19 04:33:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-12-19 04:33:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 8390 transitions. [2019-12-19 04:33:41,867 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 8390 transitions. Word has length 95 [2019-12-19 04:33:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:41,868 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 8390 transitions. [2019-12-19 04:33:41,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 8390 transitions. [2019-12-19 04:33:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:41,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:41,872 INFO L411 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] [2019-12-19 04:33:41,872 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:41,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:41,873 INFO L82 PathProgramCache]: Analyzing trace with hash 593612287, now seen corresponding path program 1 times [2019-12-19 04:33:41,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:41,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087479431] [2019-12-19 04:33:41,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:41,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087479431] [2019-12-19 04:33:41,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:41,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:41,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768775923] [2019-12-19 04:33:41,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:41,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:41,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:41,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:41,957 INFO L87 Difference]: Start difference. First operand 3514 states and 8390 transitions. Second operand 5 states. [2019-12-19 04:33:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:42,179 INFO L93 Difference]: Finished difference Result 3181 states and 7442 transitions. [2019-12-19 04:33:42,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:33:42,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 04:33:42,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:42,183 INFO L225 Difference]: With dead ends: 3181 [2019-12-19 04:33:42,184 INFO L226 Difference]: Without dead ends: 3163 [2019-12-19 04:33:42,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2019-12-19 04:33:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2489. [2019-12-19 04:33:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2489 states. [2019-12-19 04:33:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 5939 transitions. [2019-12-19 04:33:42,210 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 5939 transitions. Word has length 95 [2019-12-19 04:33:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:42,210 INFO L462 AbstractCegarLoop]: Abstraction has 2489 states and 5939 transitions. [2019-12-19 04:33:42,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 5939 transitions. [2019-12-19 04:33:42,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:42,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:42,212 INFO L411 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] [2019-12-19 04:33:42,212 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:42,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:42,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1838376768, now seen corresponding path program 1 times [2019-12-19 04:33:42,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:42,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403090788] [2019-12-19 04:33:42,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:42,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403090788] [2019-12-19 04:33:42,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:42,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:42,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858191808] [2019-12-19 04:33:42,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:42,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:42,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:42,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:42,291 INFO L87 Difference]: Start difference. First operand 2489 states and 5939 transitions. Second operand 6 states. [2019-12-19 04:33:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:42,400 INFO L93 Difference]: Finished difference Result 2568 states and 6098 transitions. [2019-12-19 04:33:42,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:33:42,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 04:33:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:42,403 INFO L225 Difference]: With dead ends: 2568 [2019-12-19 04:33:42,403 INFO L226 Difference]: Without dead ends: 2568 [2019-12-19 04:33:42,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:42,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2019-12-19 04:33:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2463. [2019-12-19 04:33:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-19 04:33:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5887 transitions. [2019-12-19 04:33:42,428 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5887 transitions. Word has length 95 [2019-12-19 04:33:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:42,428 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 5887 transitions. [2019-12-19 04:33:42,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5887 transitions. [2019-12-19 04:33:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:42,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:42,430 INFO L411 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] [2019-12-19 04:33:42,430 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:42,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:42,431 INFO L82 PathProgramCache]: Analyzing trace with hash -2136197344, now seen corresponding path program 1 times [2019-12-19 04:33:42,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:42,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037479342] [2019-12-19 04:33:42,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:42,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037479342] [2019-12-19 04:33:42,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:42,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:42,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089096736] [2019-12-19 04:33:42,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:42,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:42,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:42,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:42,519 INFO L87 Difference]: Start difference. First operand 2463 states and 5887 transitions. Second operand 5 states. [2019-12-19 04:33:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:42,558 INFO L93 Difference]: Finished difference Result 3753 states and 9136 transitions. [2019-12-19 04:33:42,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:33:42,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 04:33:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:42,564 INFO L225 Difference]: With dead ends: 3753 [2019-12-19 04:33:42,564 INFO L226 Difference]: Without dead ends: 3753 [2019-12-19 04:33:42,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2019-12-19 04:33:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 2353. [2019-12-19 04:33:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2019-12-19 04:33:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 5613 transitions. [2019-12-19 04:33:42,596 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 5613 transitions. Word has length 95 [2019-12-19 04:33:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:42,596 INFO L462 AbstractCegarLoop]: Abstraction has 2353 states and 5613 transitions. [2019-12-19 04:33:42,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 5613 transitions. [2019-12-19 04:33:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:42,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:42,599 INFO L411 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] [2019-12-19 04:33:42,599 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:42,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:42,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1806431583, now seen corresponding path program 1 times [2019-12-19 04:33:42,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:42,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466048540] [2019-12-19 04:33:42,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:42,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466048540] [2019-12-19 04:33:42,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:42,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:42,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880768843] [2019-12-19 04:33:42,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:42,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:42,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:42,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:42,698 INFO L87 Difference]: Start difference. First operand 2353 states and 5613 transitions. Second operand 7 states. [2019-12-19 04:33:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:42,784 INFO L93 Difference]: Finished difference Result 3953 states and 9579 transitions. [2019-12-19 04:33:42,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:33:42,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-19 04:33:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:42,787 INFO L225 Difference]: With dead ends: 3953 [2019-12-19 04:33:42,788 INFO L226 Difference]: Without dead ends: 1788 [2019-12-19 04:33:42,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:33:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-12-19 04:33:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1788. [2019-12-19 04:33:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1788 states. [2019-12-19 04:33:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 4325 transitions. [2019-12-19 04:33:42,806 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 4325 transitions. Word has length 95 [2019-12-19 04:33:42,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:42,806 INFO L462 AbstractCegarLoop]: Abstraction has 1788 states and 4325 transitions. [2019-12-19 04:33:42,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 4325 transitions. [2019-12-19 04:33:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:42,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:42,808 INFO L411 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] [2019-12-19 04:33:42,808 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:42,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:42,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2061196609, now seen corresponding path program 2 times [2019-12-19 04:33:42,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:42,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052537249] [2019-12-19 04:33:42,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:42,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052537249] [2019-12-19 04:33:42,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:42,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:33:42,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421030652] [2019-12-19 04:33:42,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:33:42,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:42,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:33:42,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:33:42,942 INFO L87 Difference]: Start difference. First operand 1788 states and 4325 transitions. Second operand 11 states. [2019-12-19 04:33:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:43,187 INFO L93 Difference]: Finished difference Result 3218 states and 7882 transitions. [2019-12-19 04:33:43,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:33:43,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-19 04:33:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:43,190 INFO L225 Difference]: With dead ends: 3218 [2019-12-19 04:33:43,190 INFO L226 Difference]: Without dead ends: 2318 [2019-12-19 04:33:43,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-19 04:33:43,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-12-19 04:33:43,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2206. [2019-12-19 04:33:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2019-12-19 04:33:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 5235 transitions. [2019-12-19 04:33:43,211 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 5235 transitions. Word has length 95 [2019-12-19 04:33:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:43,211 INFO L462 AbstractCegarLoop]: Abstraction has 2206 states and 5235 transitions. [2019-12-19 04:33:43,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:33:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 5235 transitions. [2019-12-19 04:33:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:43,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:43,214 INFO L411 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] [2019-12-19 04:33:43,215 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:43,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash 331051299, now seen corresponding path program 3 times [2019-12-19 04:33:43,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:43,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5652928] [2019-12-19 04:33:43,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:33:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:33:43,296 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 04:33:43,296 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 04:33:43,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:33:43 BasicIcfg [2019-12-19 04:33:43,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 04:33:43,471 INFO L168 Benchmark]: Toolchain (without parser) took 65436.40 ms. Allocated memory was 146.3 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 102.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-19 04:33:43,471 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-19 04:33:43,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.28 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 158.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-19 04:33:43,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.76 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 04:33:43,472 INFO L168 Benchmark]: Boogie Preprocessor took 39.51 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 04:33:43,472 INFO L168 Benchmark]: RCFGBuilder took 791.60 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 108.2 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-19 04:33:43,473 INFO L168 Benchmark]: TraceAbstraction took 63714.51 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 108.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-19 04:33:43,475 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.28 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 102.3 MB in the beginning and 158.2 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.76 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.51 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.60 ms. Allocated memory is still 203.4 MB. Free memory was 152.3 MB in the beginning and 108.2 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63714.51 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 108.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2009; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 0 pthread_t t2010; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 2 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y = y$flush_delayed ? y$mem_tmp : y [L807] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 63.4s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8803 SDtfs, 9600 SDslu, 21729 SDs, 0 SdLazy, 9239 SolverSat, 658 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 101 SyntacticMatches, 23 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84350occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 129551 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2819 NumberOfCodeBlocks, 2819 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2689 ConstructedInterpolants, 0 QuantifiedInterpolants, 519881 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...