/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 22:04:29,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 22:04:29,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 22:04:29,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 22:04:29,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 22:04:29,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 22:04:29,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 22:04:29,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 22:04:29,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 22:04:29,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 22:04:29,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 22:04:29,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 22:04:29,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 22:04:29,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 22:04:29,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 22:04:29,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 22:04:29,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 22:04:29,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 22:04:29,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 22:04:29,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 22:04:29,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 22:04:29,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 22:04:29,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 22:04:29,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 22:04:29,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 22:04:29,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 22:04:29,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 22:04:29,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 22:04:29,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 22:04:29,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 22:04:29,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 22:04:29,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 22:04:29,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 22:04:29,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 22:04:29,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 22:04:29,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 22:04:29,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 22:04:29,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 22:04:29,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 22:04:29,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 22:04:29,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 22:04:29,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-21 22:04:29,834 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 22:04:29,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 22:04:29,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 22:04:29,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 22:04:29,837 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 22:04:29,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 22:04:29,837 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 22:04:29,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 22:04:29,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 22:04:29,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 22:04:29,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 22:04:29,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 22:04:29,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 22:04:29,840 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 22:04:29,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 22:04:29,841 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 22:04:29,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 22:04:29,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 22:04:29,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 22:04:29,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 22:04:29,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 22:04:29,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:04:29,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 22:04:29,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-21 22:04:29,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 22:04:29,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 22:04:29,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 22:04:29,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 22:04:29,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-21 22:04:29,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-21 22:04:30,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 22:04:30,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 22:04:30,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 22:04:30,143 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 22:04:30,144 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 22:04:30,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2020-10-21 22:04:30,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4a7fdf2/1f87530852604e07b78d44a34306b32e/FLAG962ed4d70 [2020-10-21 22:04:30,746 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 22:04:30,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2020-10-21 22:04:30,763 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4a7fdf2/1f87530852604e07b78d44a34306b32e/FLAG962ed4d70 [2020-10-21 22:04:31,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b4a7fdf2/1f87530852604e07b78d44a34306b32e [2020-10-21 22:04:31,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 22:04:31,021 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 22:04:31,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 22:04:31,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 22:04:31,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 22:04:31,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:04:31" (1/1) ... [2020-10-21 22:04:31,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0abd79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:31, skipping insertion in model container [2020-10-21 22:04:31,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:04:31" (1/1) ... [2020-10-21 22:04:31,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 22:04:31,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 22:04:31,664 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:04:31,683 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 22:04:31,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:04:31,868 INFO L208 MainTranslator]: Completed translation [2020-10-21 22:04:31,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:31 WrapperNode [2020-10-21 22:04:31,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 22:04:31,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 22:04:31,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 22:04:31,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 22:04:31,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:31" (1/1) ... [2020-10-21 22:04:31,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:31" (1/1) ... [2020-10-21 22:04:31,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 22:04:31,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 22:04:31,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 22:04:31,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 22:04:31,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:31" (1/1) ... [2020-10-21 22:04:31,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:31" (1/1) ... [2020-10-21 22:04:31,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:31" (1/1) ... [2020-10-21 22:04:31,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:31" (1/1) ... [2020-10-21 22:04:31,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:31" (1/1) ... [2020-10-21 22:04:31,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:31" (1/1) ... [2020-10-21 22:04:31,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:31" (1/1) ... [2020-10-21 22:04:31,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 22:04:31,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 22:04:31,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 22:04:31,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 22:04:31,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:31" (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 [2020-10-21 22:04:32,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 22:04:32,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 22:04:32,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 22:04:32,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 22:04:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 22:04:32,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 22:04:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 22:04:32,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 22:04:32,050 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 22:04:32,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 22:04:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 22:04:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 22:04:32,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 22:04:32,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 22:04:32,053 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 22:04:34,002 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 22:04:34,002 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 22:04:34,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:04:34 BoogieIcfgContainer [2020-10-21 22:04:34,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 22:04:34,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 22:04:34,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 22:04:34,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 22:04:34,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:04:31" (1/3) ... [2020-10-21 22:04:34,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d54ca72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:04:34, skipping insertion in model container [2020-10-21 22:04:34,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:04:31" (2/3) ... [2020-10-21 22:04:34,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d54ca72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:04:34, skipping insertion in model container [2020-10-21 22:04:34,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:04:34" (3/3) ... [2020-10-21 22:04:34,013 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt.i [2020-10-21 22:04:34,025 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 22:04:34,025 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-21 22:04:34,033 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 22:04:34,034 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 22:04:34,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,064 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,064 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,066 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,069 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,069 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,069 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,070 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,077 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,077 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,078 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,086 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,086 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,089 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,090 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:04:34,093 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 22:04:34,107 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 22:04:34,129 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 22:04:34,129 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 22:04:34,129 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-21 22:04:34,129 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 22:04:34,129 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 22:04:34,130 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 22:04:34,130 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 22:04:34,130 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 22:04:34,144 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-21 22:04:34,147 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-21 22:04:34,150 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-21 22:04:34,152 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-10-21 22:04:34,201 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-10-21 22:04:34,201 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 22:04:34,206 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-21 22:04:34,210 INFO L116 LiptonReduction]: Number of co-enabled transitions 1746 [2020-10-21 22:04:34,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:34,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:34,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:34,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:34,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:34,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:34,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:34,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:34,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:34,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:34,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:34,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:34,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:34,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:34,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:34,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:04:34,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:04:34,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:04:34,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:34,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-21 22:04:34,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 22:04:34,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:34,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:34,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:34,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-21 22:04:34,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:34,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:34,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:34,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-21 22:04:34,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:34,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:34,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-21 22:04:34,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-21 22:04:34,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:34,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:34,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:34,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:34,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:34,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:34,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:34,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:04:35,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:35,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-21 22:04:35,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 22:04:35,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:35,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:35,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:35,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:35,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:35,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:35,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:35,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:35,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:35,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:35,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:35,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:35,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:04:35,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:04:35,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:35,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:35,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:35,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:35,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:35,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:35,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:04:35,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:35,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-21 22:04:35,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:35,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:35,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:35,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:35,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:35,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:35,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:35,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:35,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:35,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-21 22:04:35,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 22:04:35,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:35,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:04:35,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 22:04:35,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 22:04:35,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:35,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-21 22:04:35,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 22:04:35,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 22:04:35,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:35,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:35,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:35,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:35,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:35,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 22:04:35,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:36,429 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 22:04:36,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-21 22:04:36,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:36,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:36,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:36,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:36,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:36,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:36,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:36,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:36,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:36,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-21 22:04:36,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:36,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-21 22:04:36,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:36,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 22:04:36,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:36,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:36,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:36,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:36,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:36,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:36,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:36,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:36,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:36,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:36,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:36,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:36,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:36,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:36,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:36,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:36,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:37,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:37,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:37,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:37,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:37,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:37,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:37,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:37,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 22:04:37,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:37,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:37,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:37,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 22:04:37,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 22:04:37,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:37,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 22:04:37,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:37,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:37,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:37,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:37,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:37,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-21 22:04:37,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:37,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:37,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:38,818 WARN L193 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-21 22:04:38,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-21 22:04:38,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:38,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-21 22:04:38,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:04:39,619 WARN L193 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-21 22:04:40,876 WARN L193 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-10-21 22:04:41,150 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-21 22:04:41,744 WARN L193 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-10-21 22:04:42,041 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-21 22:04:43,201 WARN L193 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-21 22:04:43,517 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-21 22:04:43,860 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-10-21 22:04:43,975 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-21 22:04:44,404 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-21 22:04:44,585 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-21 22:04:44,618 INFO L131 LiptonReduction]: Checked pairs total: 4721 [2020-10-21 22:04:44,618 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-10-21 22:04:44,627 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-10-21 22:04:44,689 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-21 22:04:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-21 22:04:44,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 22:04:44,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:44,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:44,703 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:44,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:44,709 INFO L82 PathProgramCache]: Analyzing trace with hash 117480453, now seen corresponding path program 1 times [2020-10-21 22:04:44,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:44,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654181679] [2020-10-21 22:04:44,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:44,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654181679] [2020-10-21 22:04:44,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:44,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:04:44,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333130194] [2020-10-21 22:04:44,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:04:44,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:44,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:04:44,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:44,976 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-21 22:04:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:45,073 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-21 22:04:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:04:45,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 22:04:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:45,097 INFO L225 Difference]: With dead ends: 550 [2020-10-21 22:04:45,097 INFO L226 Difference]: Without dead ends: 450 [2020-10-21 22:04:45,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:45,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-21 22:04:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-21 22:04:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-21 22:04:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-21 22:04:45,180 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-21 22:04:45,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:45,181 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-21 22:04:45,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:04:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-21 22:04:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 22:04:45,183 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:45,183 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:45,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 22:04:45,183 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:45,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1229600893, now seen corresponding path program 1 times [2020-10-21 22:04:45,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:45,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686145609] [2020-10-21 22:04:45,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:45,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686145609] [2020-10-21 22:04:45,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:45,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:04:45,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228483004] [2020-10-21 22:04:45,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:04:45,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:45,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:04:45,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:45,356 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-21 22:04:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:45,399 INFO L93 Difference]: Finished difference Result 445 states and 1339 transitions. [2020-10-21 22:04:45,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:04:45,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 22:04:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:45,406 INFO L225 Difference]: With dead ends: 445 [2020-10-21 22:04:45,407 INFO L226 Difference]: Without dead ends: 445 [2020-10-21 22:04:45,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:45,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-21 22:04:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2020-10-21 22:04:45,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-10-21 22:04:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1339 transitions. [2020-10-21 22:04:45,433 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1339 transitions. Word has length 9 [2020-10-21 22:04:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:45,434 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 1339 transitions. [2020-10-21 22:04:45,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:04:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1339 transitions. [2020-10-21 22:04:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 22:04:45,436 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:45,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:45,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 22:04:45,436 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:45,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:45,437 INFO L82 PathProgramCache]: Analyzing trace with hash -537078437, now seen corresponding path program 1 times [2020-10-21 22:04:45,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:45,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462247795] [2020-10-21 22:04:45,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:45,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462247795] [2020-10-21 22:04:45,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:45,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:04:45,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166492236] [2020-10-21 22:04:45,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:04:45,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:45,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:04:45,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:04:45,562 INFO L87 Difference]: Start difference. First operand 445 states and 1339 transitions. Second operand 4 states. [2020-10-21 22:04:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:45,608 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-21 22:04:45,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:04:45,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-21 22:04:45,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:45,615 INFO L225 Difference]: With dead ends: 440 [2020-10-21 22:04:45,615 INFO L226 Difference]: Without dead ends: 440 [2020-10-21 22:04:45,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:04:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-21 22:04:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-21 22:04:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-21 22:04:45,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-21 22:04:45,639 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 10 [2020-10-21 22:04:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:45,639 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-21 22:04:45,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:04:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-21 22:04:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 22:04:45,641 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:45,641 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:45,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 22:04:45,641 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:45,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:45,642 INFO L82 PathProgramCache]: Analyzing trace with hash -537078871, now seen corresponding path program 1 times [2020-10-21 22:04:45,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:45,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476056603] [2020-10-21 22:04:45,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:45,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476056603] [2020-10-21 22:04:45,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:45,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 22:04:45,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026644249] [2020-10-21 22:04:45,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:04:45,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:45,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:04:45,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:45,758 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-10-21 22:04:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:45,788 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-21 22:04:45,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:04:45,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-21 22:04:45,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:45,793 INFO L225 Difference]: With dead ends: 434 [2020-10-21 22:04:45,794 INFO L226 Difference]: Without dead ends: 434 [2020-10-21 22:04:45,794 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-21 22:04:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-21 22:04:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-21 22:04:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-21 22:04:45,810 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-21 22:04:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:45,811 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-21 22:04:45,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:04:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-21 22:04:45,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:04:45,813 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:45,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:45,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 22:04:45,814 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:45,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:45,814 INFO L82 PathProgramCache]: Analyzing trace with hash 530435755, now seen corresponding path program 1 times [2020-10-21 22:04:45,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:45,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695673127] [2020-10-21 22:04:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:45,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695673127] [2020-10-21 22:04:45,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:45,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:04:45,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660518116] [2020-10-21 22:04:45,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:04:45,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:45,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:04:45,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:45,904 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 6 states. [2020-10-21 22:04:45,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:45,990 INFO L93 Difference]: Finished difference Result 468 states and 1414 transitions. [2020-10-21 22:04:45,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:04:45,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-21 22:04:45,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:46,002 INFO L225 Difference]: With dead ends: 468 [2020-10-21 22:04:46,002 INFO L226 Difference]: Without dead ends: 468 [2020-10-21 22:04:46,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:46,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2020-10-21 22:04:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 450. [2020-10-21 22:04:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-21 22:04:46,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1348 transitions. [2020-10-21 22:04:46,020 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1348 transitions. Word has length 11 [2020-10-21 22:04:46,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:46,021 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1348 transitions. [2020-10-21 22:04:46,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:04:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1348 transitions. [2020-10-21 22:04:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 22:04:46,026 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:46,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:46,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 22:04:46,027 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:46,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:46,027 INFO L82 PathProgramCache]: Analyzing trace with hash 530436747, now seen corresponding path program 1 times [2020-10-21 22:04:46,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:46,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475454836] [2020-10-21 22:04:46,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:46,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475454836] [2020-10-21 22:04:46,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:46,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:04:46,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770958215] [2020-10-21 22:04:46,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:04:46,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:46,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:04:46,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:04:46,196 INFO L87 Difference]: Start difference. First operand 450 states and 1348 transitions. Second operand 5 states. [2020-10-21 22:04:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:46,282 INFO L93 Difference]: Finished difference Result 436 states and 1290 transitions. [2020-10-21 22:04:46,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:04:46,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-21 22:04:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:46,287 INFO L225 Difference]: With dead ends: 436 [2020-10-21 22:04:46,287 INFO L226 Difference]: Without dead ends: 436 [2020-10-21 22:04:46,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:46,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-10-21 22:04:46,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 420. [2020-10-21 22:04:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-10-21 22:04:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1246 transitions. [2020-10-21 22:04:46,303 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1246 transitions. Word has length 11 [2020-10-21 22:04:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:46,304 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1246 transitions. [2020-10-21 22:04:46,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:04:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1246 transitions. [2020-10-21 22:04:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 22:04:46,305 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:46,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:46,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 22:04:46,306 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:46,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash -769299944, now seen corresponding path program 1 times [2020-10-21 22:04:46,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:46,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17513380] [2020-10-21 22:04:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:46,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17513380] [2020-10-21 22:04:46,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:46,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:04:46,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290095520] [2020-10-21 22:04:46,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:04:46,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:46,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:04:46,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:04:46,511 INFO L87 Difference]: Start difference. First operand 420 states and 1246 transitions. Second operand 5 states. [2020-10-21 22:04:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:46,574 INFO L93 Difference]: Finished difference Result 411 states and 1216 transitions. [2020-10-21 22:04:46,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:04:46,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 22:04:46,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:46,579 INFO L225 Difference]: With dead ends: 411 [2020-10-21 22:04:46,579 INFO L226 Difference]: Without dead ends: 411 [2020-10-21 22:04:46,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:04:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-10-21 22:04:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2020-10-21 22:04:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2020-10-21 22:04:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1216 transitions. [2020-10-21 22:04:46,602 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1216 transitions. Word has length 12 [2020-10-21 22:04:46,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:46,602 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 1216 transitions. [2020-10-21 22:04:46,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:04:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1216 transitions. [2020-10-21 22:04:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 22:04:46,603 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:46,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:46,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 22:04:46,604 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:46,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:46,604 INFO L82 PathProgramCache]: Analyzing trace with hash -736362630, now seen corresponding path program 1 times [2020-10-21 22:04:46,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:46,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768955707] [2020-10-21 22:04:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:46,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768955707] [2020-10-21 22:04:46,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:46,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 22:04:46,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674753829] [2020-10-21 22:04:46,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 22:04:46,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:46,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 22:04:46,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:46,663 INFO L87 Difference]: Start difference. First operand 411 states and 1216 transitions. Second operand 3 states. [2020-10-21 22:04:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:46,681 INFO L93 Difference]: Finished difference Result 560 states and 1604 transitions. [2020-10-21 22:04:46,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 22:04:46,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-21 22:04:46,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:46,685 INFO L225 Difference]: With dead ends: 560 [2020-10-21 22:04:46,685 INFO L226 Difference]: Without dead ends: 425 [2020-10-21 22:04:46,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 22:04:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2020-10-21 22:04:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 398. [2020-10-21 22:04:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-10-21 22:04:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1127 transitions. [2020-10-21 22:04:46,701 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1127 transitions. Word has length 12 [2020-10-21 22:04:46,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:46,702 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1127 transitions. [2020-10-21 22:04:46,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 22:04:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1127 transitions. [2020-10-21 22:04:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 22:04:46,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:46,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:46,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 22:04:46,703 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:46,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:46,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1921518076, now seen corresponding path program 1 times [2020-10-21 22:04:46,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:46,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393327720] [2020-10-21 22:04:46,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:46,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393327720] [2020-10-21 22:04:46,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:46,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:04:46,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809610039] [2020-10-21 22:04:46,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:04:46,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:46,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:04:46,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:46,941 INFO L87 Difference]: Start difference. First operand 398 states and 1127 transitions. Second operand 6 states. [2020-10-21 22:04:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:47,054 INFO L93 Difference]: Finished difference Result 440 states and 1227 transitions. [2020-10-21 22:04:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:04:47,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-21 22:04:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:47,058 INFO L225 Difference]: With dead ends: 440 [2020-10-21 22:04:47,058 INFO L226 Difference]: Without dead ends: 392 [2020-10-21 22:04:47,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:04:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-10-21 22:04:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2020-10-21 22:04:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-10-21 22:04:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1086 transitions. [2020-10-21 22:04:47,071 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1086 transitions. Word has length 13 [2020-10-21 22:04:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:47,071 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 1086 transitions. [2020-10-21 22:04:47,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:04:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1086 transitions. [2020-10-21 22:04:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 22:04:47,073 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:47,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:47,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 22:04:47,073 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:47,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:47,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1352377110, now seen corresponding path program 1 times [2020-10-21 22:04:47,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:47,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848054764] [2020-10-21 22:04:47,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:47,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848054764] [2020-10-21 22:04:47,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:47,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:04:47,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530108230] [2020-10-21 22:04:47,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:04:47,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:47,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:04:47,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:04:47,131 INFO L87 Difference]: Start difference. First operand 392 states and 1086 transitions. Second operand 4 states. [2020-10-21 22:04:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:47,164 INFO L93 Difference]: Finished difference Result 384 states and 935 transitions. [2020-10-21 22:04:47,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 22:04:47,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 22:04:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:47,167 INFO L225 Difference]: With dead ends: 384 [2020-10-21 22:04:47,167 INFO L226 Difference]: Without dead ends: 280 [2020-10-21 22:04:47,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:04:47,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-10-21 22:04:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2020-10-21 22:04:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-10-21 22:04:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 662 transitions. [2020-10-21 22:04:47,176 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 662 transitions. Word has length 13 [2020-10-21 22:04:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:47,177 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 662 transitions. [2020-10-21 22:04:47,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:04:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 662 transitions. [2020-10-21 22:04:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 22:04:47,178 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:47,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:47,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 22:04:47,178 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:47,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:47,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1882145435, now seen corresponding path program 1 times [2020-10-21 22:04:47,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:47,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328406064] [2020-10-21 22:04:47,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:47,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328406064] [2020-10-21 22:04:47,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:47,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 22:04:47,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563273810] [2020-10-21 22:04:47,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 22:04:47,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:47,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 22:04:47,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:04:47,243 INFO L87 Difference]: Start difference. First operand 280 states and 662 transitions. Second operand 5 states. [2020-10-21 22:04:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:47,290 INFO L93 Difference]: Finished difference Result 230 states and 495 transitions. [2020-10-21 22:04:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 22:04:47,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-21 22:04:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:47,294 INFO L225 Difference]: With dead ends: 230 [2020-10-21 22:04:47,295 INFO L226 Difference]: Without dead ends: 176 [2020-10-21 22:04:47,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-21 22:04:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-21 22:04:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-21 22:04:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 368 transitions. [2020-10-21 22:04:47,300 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 368 transitions. Word has length 14 [2020-10-21 22:04:47,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:47,301 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 368 transitions. [2020-10-21 22:04:47,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 22:04:47,301 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 368 transitions. [2020-10-21 22:04:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 22:04:47,302 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:47,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:47,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 22:04:47,302 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash 573655817, now seen corresponding path program 1 times [2020-10-21 22:04:47,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:47,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945975700] [2020-10-21 22:04:47,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:47,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945975700] [2020-10-21 22:04:47,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:47,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 22:04:47,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621731919] [2020-10-21 22:04:47,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 22:04:47,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:47,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 22:04:47,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 22:04:47,404 INFO L87 Difference]: Start difference. First operand 176 states and 368 transitions. Second operand 6 states. [2020-10-21 22:04:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:47,481 INFO L93 Difference]: Finished difference Result 157 states and 329 transitions. [2020-10-21 22:04:47,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 22:04:47,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-21 22:04:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:47,484 INFO L225 Difference]: With dead ends: 157 [2020-10-21 22:04:47,484 INFO L226 Difference]: Without dead ends: 97 [2020-10-21 22:04:47,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 22:04:47,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-21 22:04:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2020-10-21 22:04:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-21 22:04:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2020-10-21 22:04:47,493 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 16 [2020-10-21 22:04:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:47,494 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 176 transitions. [2020-10-21 22:04:47,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 22:04:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 176 transitions. [2020-10-21 22:04:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 22:04:47,495 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:47,500 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:47,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 22:04:47,501 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:47,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:47,501 INFO L82 PathProgramCache]: Analyzing trace with hash -2071543388, now seen corresponding path program 1 times [2020-10-21 22:04:47,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:47,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67886324] [2020-10-21 22:04:47,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 22:04:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 22:04:47,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67886324] [2020-10-21 22:04:47,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 22:04:47,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 22:04:47,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121149228] [2020-10-21 22:04:47,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 22:04:47,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 22:04:47,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 22:04:47,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 22:04:47,598 INFO L87 Difference]: Start difference. First operand 87 states and 176 transitions. Second operand 4 states. [2020-10-21 22:04:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 22:04:47,620 INFO L93 Difference]: Finished difference Result 113 states and 224 transitions. [2020-10-21 22:04:47,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 22:04:47,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-21 22:04:47,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 22:04:47,623 INFO L225 Difference]: With dead ends: 113 [2020-10-21 22:04:47,623 INFO L226 Difference]: Without dead ends: 47 [2020-10-21 22:04:47,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 22:04:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-21 22:04:47,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-21 22:04:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-21 22:04:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-10-21 22:04:47,627 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2020-10-21 22:04:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 22:04:47,627 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-10-21 22:04:47,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 22:04:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-10-21 22:04:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 22:04:47,628 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 22:04:47,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 22:04:47,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 22:04:47,629 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 22:04:47,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 22:04:47,630 INFO L82 PathProgramCache]: Analyzing trace with hash -7896946, now seen corresponding path program 2 times [2020-10-21 22:04:47,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 22:04:47,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625797704] [2020-10-21 22:04:47,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 22:04:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:04:47,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:04:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 22:04:47,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 22:04:47,745 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 22:04:47,745 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 22:04:47,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 22:04:47,747 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 22:04:47,762 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L2-->L831: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In-250769803 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In-250769803 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-250769803 256) 0)) (.cse9 (= 0 (mod ~y$r_buff1_thd0~0_In-250769803 256)))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and (= ~y$w_buff1_used~0_Out-250769803 0) .cse0 .cse1) (and (= ~y$w_buff1_used~0_In-250769803 ~y$w_buff1_used~0_Out-250769803) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-250769803 0)) (or (and (or (and (= ~y~0_Out-250769803 ~y$w_buff1~0_In-250769803) .cse0 .cse1) (and (= ~y~0_Out-250769803 ~y~0_In-250769803) .cse2)) .cse3) (and .cse4 .cse5 (= ~y~0_Out-250769803 ~y$w_buff0~0_In-250769803))) (= ~y$r_buff1_thd0~0_Out-250769803 ~y$r_buff1_thd0~0_In-250769803) (= ~y$r_buff0_thd0~0_In-250769803 ~y$r_buff0_thd0~0_Out-250769803) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-250769803 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-250769803|) (or (and (= ~y$w_buff0_used~0_In-250769803 ~y$w_buff0_used~0_Out-250769803) .cse3) (and .cse4 .cse5 (= ~y$w_buff0_used~0_Out-250769803 0)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-250769803|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-250769803, ~y$w_buff1~0=~y$w_buff1~0_In-250769803, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-250769803, ~y$w_buff0~0=~y$w_buff0~0_In-250769803, ~y~0=~y~0_In-250769803, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-250769803, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-250769803} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-250769803, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-250769803|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-250769803|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-250769803|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-250769803|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-250769803|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-250769803|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-250769803|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-250769803, ~y$w_buff1~0=~y$w_buff1~0_In-250769803, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-250769803, ~y$w_buff0~0=~y$w_buff0~0_In-250769803, ~y~0=~y~0_Out-250769803, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-250769803, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-250769803} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-21 22:04:47,769 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,770 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,770 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [777] [2020-10-21 22:04:47,771 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,772 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,772 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,773 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,773 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,774 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,774 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,775 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,775 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,775 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,775 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,776 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,776 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,777 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,777 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,777 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,777 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,777 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,778 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,778 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,779 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,779 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,779 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 22:04:47,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 22:04:47,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:04:47 BasicIcfg [2020-10-21 22:04:47,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 22:04:47,845 INFO L168 Benchmark]: Toolchain (without parser) took 16829.21 ms. Allocated memory was 139.5 MB in the beginning and 433.1 MB in the end (delta: 293.6 MB). Free memory was 100.5 MB in the beginning and 235.4 MB in the end (delta: -134.9 MB). Peak memory consumption was 158.7 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:47,846 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 22:04:47,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 847.12 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 156.2 MB in the end (delta: -56.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:47,848 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.23 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:47,848 INFO L168 Benchmark]: Boogie Preprocessor took 37.83 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:47,849 INFO L168 Benchmark]: RCFGBuilder took 2015.28 ms. Allocated memory was 203.4 MB in the beginning and 249.0 MB in the end (delta: 45.6 MB). Free memory was 150.1 MB in the beginning and 191.7 MB in the end (delta: -41.6 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:47,850 INFO L168 Benchmark]: TraceAbstraction took 13837.79 ms. Allocated memory was 249.0 MB in the beginning and 433.1 MB in the end (delta: 184.0 MB). Free memory was 191.7 MB in the beginning and 235.4 MB in the end (delta: -43.7 MB). Peak memory consumption was 140.4 MB. Max. memory is 7.1 GB. [2020-10-21 22:04:47,854 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 847.12 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 156.2 MB in the end (delta: -56.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.23 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.83 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2015.28 ms. Allocated memory was 203.4 MB in the beginning and 249.0 MB in the end (delta: 45.6 MB). Free memory was 150.1 MB in the beginning and 191.7 MB in the end (delta: -41.6 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13837.79 ms. Allocated memory was 249.0 MB in the beginning and 433.1 MB in the end (delta: 184.0 MB). Free memory was 191.7 MB in the beginning and 235.4 MB in the end (delta: -43.7 MB). Peak memory consumption was 140.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1270 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 109 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.4s, 107 PlacesBefore, 35 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 4721 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2528; [L816] FCALL, FORK 0 pthread_create(&t2528, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L817] 0 pthread_t t2529; [L818] FCALL, FORK 0 pthread_create(&t2529, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L819] 0 pthread_t t2530; [L820] FCALL, FORK 0 pthread_create(&t2530, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "safe031_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0: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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L764] 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) [L764] 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) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 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 [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 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 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 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) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L837] 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) [L837] 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) [L838] 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)) [L838] 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)) [L839] 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)) [L839] EXPR 0 !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) [L839] 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)) [L839] 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)) [L840] 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)) [L840] 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)) [L841] 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)) [L841] EXPR 0 !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) [L841] 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)) [L841] 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)) [L842] 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)) [L842] 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)) [L843] 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)) [L843] 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)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe031_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.5s, HoareTripleCheckerStatistics: 284 SDtfs, 266 SDslu, 386 SDs, 0 SdLazy, 221 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 71 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 12177 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...