/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/mix043_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 22:43:06,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 22:43:06,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 22:43:06,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 22:43:06,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 22:43:06,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 22:43:06,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 22:43:06,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 22:43:06,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 22:43:06,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 22:43:06,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 22:43:06,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 22:43:06,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 22:43:06,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 22:43:06,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 22:43:06,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 22:43:06,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 22:43:06,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 22:43:06,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 22:43:06,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 22:43:06,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 22:43:06,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 22:43:06,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 22:43:06,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 22:43:06,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 22:43:06,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 22:43:06,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 22:43:06,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 22:43:06,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 22:43:06,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 22:43:06,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 22:43:06,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 22:43:06,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 22:43:06,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 22:43:06,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 22:43:06,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 22:43:06,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 22:43:06,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 22:43:06,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 22:43:06,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 22:43:06,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 22:43:06,674 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-05 22:43:06,727 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 22:43:06,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 22:43:06,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 22:43:06,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 22:43:06,729 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 22:43:06,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 22:43:06,729 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 22:43:06,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 22:43:06,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 22:43:06,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 22:43:06,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 22:43:06,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 22:43:06,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 22:43:06,731 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 22:43:06,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 22:43:06,731 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 22:43:06,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 22:43:06,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 22:43:06,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 22:43:06,732 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 22:43:06,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 22:43:06,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:43:06,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 22:43:06,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 22:43:06,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 22:43:06,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 22:43:06,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 22:43:06,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 22:43:06,734 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 22:43:06,734 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 22:43:07,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 22:43:07,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 22:43:07,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 22:43:07,039 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 22:43:07,042 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 22:43:07,043 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i [2020-10-05 22:43:07,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73c3b4fd/15d9105098b846e18a85428925d80a1b/FLAGbb2ab6410 [2020-10-05 22:43:07,700 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 22:43:07,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i [2020-10-05 22:43:07,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73c3b4fd/15d9105098b846e18a85428925d80a1b/FLAGbb2ab6410 [2020-10-05 22:43:07,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73c3b4fd/15d9105098b846e18a85428925d80a1b [2020-10-05 22:43:07,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 22:43:07,975 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 22:43:07,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 22:43:07,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 22:43:07,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 22:43:07,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:43:07" (1/1) ... [2020-10-05 22:43:07,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c253b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:43:07, skipping insertion in model container [2020-10-05 22:43:07,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:43:07" (1/1) ... [2020-10-05 22:43:07,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 22:43:08,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 22:43:08,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:43:08,552 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 22:43:08,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:43:08,735 INFO L208 MainTranslator]: Completed translation [2020-10-05 22:43:08,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:43:08 WrapperNode [2020-10-05 22:43:08,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 22:43:08,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 22:43:08,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 22:43:08,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 22:43:08,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:43:08" (1/1) ... [2020-10-05 22:43:08,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:43:08" (1/1) ... [2020-10-05 22:43:08,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 22:43:08,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 22:43:08,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 22:43:08,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 22:43:08,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:43:08" (1/1) ... [2020-10-05 22:43:08,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:43:08" (1/1) ... [2020-10-05 22:43:08,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:43:08" (1/1) ... [2020-10-05 22:43:08,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:43:08" (1/1) ... [2020-10-05 22:43:08,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:43:08" (1/1) ... [2020-10-05 22:43:08,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:43:08" (1/1) ... [2020-10-05 22:43:08,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:43:08" (1/1) ... [2020-10-05 22:43:08,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 22:43:08,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 22:43:08,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 22:43:08,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 22:43:08,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:43:08" (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-05 22:43:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 22:43:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 22:43:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 22:43:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 22:43:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 22:43:08,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 22:43:08,936 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 22:43:08,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 22:43:08,937 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 22:43:08,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 22:43:08,937 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 22:43:08,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 22:43:08,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 22:43:08,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 22:43:08,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 22:43:08,940 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 22:43:11,019 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 22:43:11,019 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 22:43:11,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:43:11 BoogieIcfgContainer [2020-10-05 22:43:11,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 22:43:11,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 22:43:11,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 22:43:11,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 22:43:11,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:43:07" (1/3) ... [2020-10-05 22:43:11,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f85867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:43:11, skipping insertion in model container [2020-10-05 22:43:11,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:43:08" (2/3) ... [2020-10-05 22:43:11,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f85867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:43:11, skipping insertion in model container [2020-10-05 22:43:11,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:43:11" (3/3) ... [2020-10-05 22:43:11,031 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_tso.opt.i [2020-10-05 22:43:11,042 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 22:43:11,043 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 22:43:11,052 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 22:43:11,053 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 22:43:11,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,085 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,086 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,087 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,087 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,087 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,088 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,089 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,089 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,089 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,092 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,092 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,092 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,093 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,100 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,100 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,109 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,109 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,111 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,112 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,113 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,115 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,116 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:43:11,131 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 22:43:11,152 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 22:43:11,152 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 22:43:11,152 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 22:43:11,153 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 22:43:11,153 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 22:43:11,153 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 22:43:11,153 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 22:43:11,153 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 22:43:11,171 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 246 flow [2020-10-05 22:43:11,173 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-10-05 22:43:11,229 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-05 22:43:11,230 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:43:11,235 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-05 22:43:11,240 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-10-05 22:43:11,269 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-05 22:43:11,270 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:43:11,271 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-05 22:43:11,274 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2540 [2020-10-05 22:43:11,275 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 22:43:11,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:11,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:11,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:11,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:11,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:11,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:43:11,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:43:11,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:43:11,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:11,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:11,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:11,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:11,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:11,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:43:11,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:43:11,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:43:11,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-05 22:43:11,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:11,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-05 22:43:11,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:11,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-05 22:43:11,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:11,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-05 22:43:11,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:11,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-05 22:43:11,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:11,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-05 22:43:11,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:11,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-05 22:43:11,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:11,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-05 22:43:11,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:13,512 WARN L193 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-05 22:43:13,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-05 22:43:13,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:13,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-05 22:43:13,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:14,923 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-05 22:43:14,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:14,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:14,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:14,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:14,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:14,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:43:14,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:43:14,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:43:14,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:43:14,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:14,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:14,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:14,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:14,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:43:14,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:43:14,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:43:15,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:43:15,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:15,541 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-05 22:43:15,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:15,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:15,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:15,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:15,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:15,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:43:15,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:43:15,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:43:15,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:43:15,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:15,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:15,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:15,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:15,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:43:15,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:43:15,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:43:16,335 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 22:43:16,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:16,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:16,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-05 22:43:16,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:16,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:16,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:16,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:16,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:16,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:16,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:16,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:16,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:16,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:16,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:16,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:16,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:16,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:16,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:16,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:16,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:43:16,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:16,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:16,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:16,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:43:16,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:16,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:16,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:16,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:16,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-05 22:43:16,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:16,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:16,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:16,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:16,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:16,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:16,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:16,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:16,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:16,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:16,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:16,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:16,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:16,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:16,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:17,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:17,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:17,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-05 22:43:17,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:17,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:17,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:17,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:17,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:17,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:17,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:17,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:17,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:17,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:17,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:17,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:17,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:17,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:17,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:17,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:17,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:43:17,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:17,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:17,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:17,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:43:17,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:17,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:17,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:17,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:17,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term [2020-10-05 22:43:17,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:17,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:17,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:17,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:43:17,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:43:17,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:17,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:17,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:17,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:17,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-05 22:43:17,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:17,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:17,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:17,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-05 22:43:17,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:43:18,488 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-05 22:43:18,655 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-05 22:43:18,674 INFO L206 etLargeBlockEncoding]: Checked pairs total: 6248 [2020-10-05 22:43:18,674 INFO L214 etLargeBlockEncoding]: Total number of compositions: 91 [2020-10-05 22:43:18,677 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-10-05 22:43:18,907 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-10-05 22:43:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-10-05 22:43:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 22:43:18,919 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:18,920 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:43:18,921 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:18,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1444069344, now seen corresponding path program 1 times [2020-10-05 22:43:18,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:18,939 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694929137] [2020-10-05 22:43:18,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:19,240 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-05 22:43:19,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694929137] [2020-10-05 22:43:19,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:19,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:43:19,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599607821] [2020-10-05 22:43:19,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:43:19,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:19,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:43:19,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:43:19,265 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-10-05 22:43:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:19,393 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-10-05 22:43:19,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:43:19,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 22:43:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:19,441 INFO L225 Difference]: With dead ends: 3082 [2020-10-05 22:43:19,442 INFO L226 Difference]: Without dead ends: 2602 [2020-10-05 22:43:19,443 INFO L675 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-05 22:43:19,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-10-05 22:43:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-10-05 22:43:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-10-05 22:43:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-10-05 22:43:19,649 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-10-05 22:43:19,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:19,650 INFO L479 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-10-05 22:43:19,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:43:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-10-05 22:43:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 22:43:19,654 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:19,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:43:19,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 22:43:19,655 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:19,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:19,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1875609894, now seen corresponding path program 1 times [2020-10-05 22:43:19,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:19,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023761513] [2020-10-05 22:43:19,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:19,828 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-05 22:43:19,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023761513] [2020-10-05 22:43:19,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:19,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:43:19,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116248128] [2020-10-05 22:43:19,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:43:19,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:19,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:43:19,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:43:19,832 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-10-05 22:43:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:19,974 INFO L93 Difference]: Finished difference Result 2922 states and 10960 transitions. [2020-10-05 22:43:19,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:43:19,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-05 22:43:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:19,997 INFO L225 Difference]: With dead ends: 2922 [2020-10-05 22:43:19,997 INFO L226 Difference]: Without dead ends: 2442 [2020-10-05 22:43:19,999 INFO L675 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-05 22:43:20,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2020-10-05 22:43:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2020-10-05 22:43:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-10-05 22:43:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9376 transitions. [2020-10-05 22:43:20,107 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9376 transitions. Word has length 12 [2020-10-05 22:43:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:20,108 INFO L479 AbstractCegarLoop]: Abstraction has 2442 states and 9376 transitions. [2020-10-05 22:43:20,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:43:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9376 transitions. [2020-10-05 22:43:20,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 22:43:20,117 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:20,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:43:20,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 22:43:20,118 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:20,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:20,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1985667225, now seen corresponding path program 1 times [2020-10-05 22:43:20,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:20,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649898189] [2020-10-05 22:43:20,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:20,297 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-05 22:43:20,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649898189] [2020-10-05 22:43:20,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:20,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:43:20,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97393866] [2020-10-05 22:43:20,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:43:20,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:20,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:43:20,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:43:20,300 INFO L87 Difference]: Start difference. First operand 2442 states and 9376 transitions. Second operand 5 states. [2020-10-05 22:43:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:20,465 INFO L93 Difference]: Finished difference Result 2682 states and 10008 transitions. [2020-10-05 22:43:20,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:43:20,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 22:43:20,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:20,487 INFO L225 Difference]: With dead ends: 2682 [2020-10-05 22:43:20,487 INFO L226 Difference]: Without dead ends: 2282 [2020-10-05 22:43:20,488 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-05 22:43:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2020-10-05 22:43:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2282. [2020-10-05 22:43:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-10-05 22:43:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2020-10-05 22:43:20,578 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 13 [2020-10-05 22:43:20,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:20,579 INFO L479 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2020-10-05 22:43:20,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:43:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2020-10-05 22:43:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 22:43:20,581 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:20,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:43:20,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 22:43:20,582 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:20,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:20,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1426112122, now seen corresponding path program 1 times [2020-10-05 22:43:20,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:20,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661065887] [2020-10-05 22:43:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:20,724 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-05 22:43:20,724 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661065887] [2020-10-05 22:43:20,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:20,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:43:20,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381885291] [2020-10-05 22:43:20,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:43:20,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:20,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:43:20,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:43:20,726 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 6 states. [2020-10-05 22:43:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:20,842 INFO L93 Difference]: Finished difference Result 2474 states and 9152 transitions. [2020-10-05 22:43:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:43:20,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-05 22:43:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:20,861 INFO L225 Difference]: With dead ends: 2474 [2020-10-05 22:43:20,861 INFO L226 Difference]: Without dead ends: 2154 [2020-10-05 22:43:20,861 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:43:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-10-05 22:43:20,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-10-05 22:43:20,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-10-05 22:43:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions. [2020-10-05 22:43:20,938 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 14 [2020-10-05 22:43:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:20,938 INFO L479 AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions. [2020-10-05 22:43:20,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:43:20,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions. [2020-10-05 22:43:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 22:43:20,942 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:20,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:43:20,943 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 22:43:20,943 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash 398262843, now seen corresponding path program 1 times [2020-10-05 22:43:20,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:20,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262251225] [2020-10-05 22:43:20,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:21,011 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-05 22:43:21,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262251225] [2020-10-05 22:43:21,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:21,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:43:21,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095831057] [2020-10-05 22:43:21,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:43:21,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:21,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:43:21,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:43:21,014 INFO L87 Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 4 states. [2020-10-05 22:43:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:21,064 INFO L93 Difference]: Finished difference Result 2130 states and 7276 transitions. [2020-10-05 22:43:21,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:43:21,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-05 22:43:21,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:21,078 INFO L225 Difference]: With dead ends: 2130 [2020-10-05 22:43:21,078 INFO L226 Difference]: Without dead ends: 1650 [2020-10-05 22:43:21,078 INFO L675 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-05 22:43:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2020-10-05 22:43:21,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1650. [2020-10-05 22:43:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2020-10-05 22:43:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 5592 transitions. [2020-10-05 22:43:21,132 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 5592 transitions. Word has length 16 [2020-10-05 22:43:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:21,133 INFO L479 AbstractCegarLoop]: Abstraction has 1650 states and 5592 transitions. [2020-10-05 22:43:21,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:43:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 5592 transitions. [2020-10-05 22:43:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 22:43:21,136 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:21,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:43:21,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 22:43:21,137 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:21,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:21,137 INFO L82 PathProgramCache]: Analyzing trace with hash 921334377, now seen corresponding path program 1 times [2020-10-05 22:43:21,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:21,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964725299] [2020-10-05 22:43:21,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:21,260 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-05 22:43:21,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964725299] [2020-10-05 22:43:21,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:21,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:43:21,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842989685] [2020-10-05 22:43:21,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:43:21,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:21,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:43:21,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:43:21,263 INFO L87 Difference]: Start difference. First operand 1650 states and 5592 transitions. Second operand 5 states. [2020-10-05 22:43:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:21,337 INFO L93 Difference]: Finished difference Result 1326 states and 4081 transitions. [2020-10-05 22:43:21,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:43:21,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 22:43:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:21,345 INFO L225 Difference]: With dead ends: 1326 [2020-10-05 22:43:21,345 INFO L226 Difference]: Without dead ends: 1026 [2020-10-05 22:43:21,346 INFO L675 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-05 22:43:21,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2020-10-05 22:43:21,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2020-10-05 22:43:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2020-10-05 22:43:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 3096 transitions. [2020-10-05 22:43:21,375 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 3096 transitions. Word has length 17 [2020-10-05 22:43:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:21,375 INFO L479 AbstractCegarLoop]: Abstraction has 1026 states and 3096 transitions. [2020-10-05 22:43:21,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:43:21,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 3096 transitions. [2020-10-05 22:43:21,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 22:43:21,378 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:21,379 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-05 22:43:21,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 22:43:21,379 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:21,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:21,380 INFO L82 PathProgramCache]: Analyzing trace with hash -587833028, now seen corresponding path program 1 times [2020-10-05 22:43:21,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:21,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370545836] [2020-10-05 22:43:21,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:21,533 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-05 22:43:21,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370545836] [2020-10-05 22:43:21,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:21,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:43:21,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805762623] [2020-10-05 22:43:21,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:43:21,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:21,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:43:21,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:43:21,535 INFO L87 Difference]: Start difference. First operand 1026 states and 3096 transitions. Second operand 7 states. [2020-10-05 22:43:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:21,825 INFO L93 Difference]: Finished difference Result 1548 states and 4606 transitions. [2020-10-05 22:43:21,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:43:21,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-05 22:43:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:21,835 INFO L225 Difference]: With dead ends: 1548 [2020-10-05 22:43:21,835 INFO L226 Difference]: Without dead ends: 1259 [2020-10-05 22:43:21,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:43:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2020-10-05 22:43:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1259. [2020-10-05 22:43:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1259 states. [2020-10-05 22:43:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 3764 transitions. [2020-10-05 22:43:21,872 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 3764 transitions. Word has length 20 [2020-10-05 22:43:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:21,872 INFO L479 AbstractCegarLoop]: Abstraction has 1259 states and 3764 transitions. [2020-10-05 22:43:21,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:43:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 3764 transitions. [2020-10-05 22:43:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 22:43:21,876 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:21,876 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-05 22:43:21,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 22:43:21,876 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:21,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:21,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1993543260, now seen corresponding path program 2 times [2020-10-05 22:43:21,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:21,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040144445] [2020-10-05 22:43:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:22,011 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-05 22:43:22,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040144445] [2020-10-05 22:43:22,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:22,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:43:22,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091336379] [2020-10-05 22:43:22,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:43:22,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:22,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:43:22,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:43:22,014 INFO L87 Difference]: Start difference. First operand 1259 states and 3764 transitions. Second operand 7 states. [2020-10-05 22:43:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:22,206 INFO L93 Difference]: Finished difference Result 1731 states and 5130 transitions. [2020-10-05 22:43:22,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:43:22,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-05 22:43:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:22,214 INFO L225 Difference]: With dead ends: 1731 [2020-10-05 22:43:22,215 INFO L226 Difference]: Without dead ends: 1461 [2020-10-05 22:43:22,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:43:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-10-05 22:43:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1201. [2020-10-05 22:43:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1201 states. [2020-10-05 22:43:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 3559 transitions. [2020-10-05 22:43:22,248 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 3559 transitions. Word has length 20 [2020-10-05 22:43:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:22,248 INFO L479 AbstractCegarLoop]: Abstraction has 1201 states and 3559 transitions. [2020-10-05 22:43:22,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:43:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 3559 transitions. [2020-10-05 22:43:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 22:43:22,252 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:22,252 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-05 22:43:22,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 22:43:22,253 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:22,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2002224188, now seen corresponding path program 3 times [2020-10-05 22:43:22,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:22,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269861436] [2020-10-05 22:43:22,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:22,327 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-05 22:43:22,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269861436] [2020-10-05 22:43:22,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:22,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:43:22,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807308538] [2020-10-05 22:43:22,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:43:22,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:22,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:43:22,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:43:22,329 INFO L87 Difference]: Start difference. First operand 1201 states and 3559 transitions. Second operand 6 states. [2020-10-05 22:43:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:22,407 INFO L93 Difference]: Finished difference Result 996 states and 2905 transitions. [2020-10-05 22:43:22,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:43:22,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-05 22:43:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:22,417 INFO L225 Difference]: With dead ends: 996 [2020-10-05 22:43:22,417 INFO L226 Difference]: Without dead ends: 871 [2020-10-05 22:43:22,418 INFO L675 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-05 22:43:22,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2020-10-05 22:43:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2020-10-05 22:43:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2020-10-05 22:43:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2579 transitions. [2020-10-05 22:43:22,439 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2579 transitions. Word has length 20 [2020-10-05 22:43:22,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:22,439 INFO L479 AbstractCegarLoop]: Abstraction has 871 states and 2579 transitions. [2020-10-05 22:43:22,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:43:22,439 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2579 transitions. [2020-10-05 22:43:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:43:22,442 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:22,442 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, 1, 1, 1] [2020-10-05 22:43:22,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 22:43:22,442 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:22,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:22,443 INFO L82 PathProgramCache]: Analyzing trace with hash 749727232, now seen corresponding path program 1 times [2020-10-05 22:43:22,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:22,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455168041] [2020-10-05 22:43:22,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:22,516 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-05 22:43:22,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455168041] [2020-10-05 22:43:22,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:22,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:43:22,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594330110] [2020-10-05 22:43:22,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:43:22,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:22,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:43:22,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:43:22,518 INFO L87 Difference]: Start difference. First operand 871 states and 2579 transitions. Second operand 7 states. [2020-10-05 22:43:22,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:22,588 INFO L93 Difference]: Finished difference Result 829 states and 2492 transitions. [2020-10-05 22:43:22,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:43:22,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 22:43:22,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:22,591 INFO L225 Difference]: With dead ends: 829 [2020-10-05 22:43:22,592 INFO L226 Difference]: Without dead ends: 666 [2020-10-05 22:43:22,592 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:43:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2020-10-05 22:43:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2020-10-05 22:43:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2020-10-05 22:43:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1985 transitions. [2020-10-05 22:43:22,608 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1985 transitions. Word has length 23 [2020-10-05 22:43:22,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:22,609 INFO L479 AbstractCegarLoop]: Abstraction has 666 states and 1985 transitions. [2020-10-05 22:43:22,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:43:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1985 transitions. [2020-10-05 22:43:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 22:43:22,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:22,611 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:43:22,612 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 22:43:22,612 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:22,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:22,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2095605853, now seen corresponding path program 1 times [2020-10-05 22:43:22,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:22,613 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730203265] [2020-10-05 22:43:22,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:22,720 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-05 22:43:22,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730203265] [2020-10-05 22:43:22,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:22,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:43:22,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189596148] [2020-10-05 22:43:22,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:43:22,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:22,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:43:22,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:43:22,723 INFO L87 Difference]: Start difference. First operand 666 states and 1985 transitions. Second operand 7 states. [2020-10-05 22:43:22,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:22,792 INFO L93 Difference]: Finished difference Result 897 states and 2647 transitions. [2020-10-05 22:43:22,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:43:22,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-05 22:43:22,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:22,794 INFO L225 Difference]: With dead ends: 897 [2020-10-05 22:43:22,795 INFO L226 Difference]: Without dead ends: 528 [2020-10-05 22:43:22,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:43:22,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2020-10-05 22:43:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2020-10-05 22:43:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2020-10-05 22:43:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1538 transitions. [2020-10-05 22:43:22,808 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1538 transitions. Word has length 27 [2020-10-05 22:43:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:22,808 INFO L479 AbstractCegarLoop]: Abstraction has 528 states and 1538 transitions. [2020-10-05 22:43:22,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:43:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1538 transitions. [2020-10-05 22:43:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 22:43:22,810 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:22,811 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:43:22,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 22:43:22,811 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:22,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:22,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1428602309, now seen corresponding path program 2 times [2020-10-05 22:43:22,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:22,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532737337] [2020-10-05 22:43:22,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:22,923 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-05 22:43:22,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532737337] [2020-10-05 22:43:22,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:22,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:43:22,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485444707] [2020-10-05 22:43:22,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:43:22,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:22,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:43:22,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:43:22,925 INFO L87 Difference]: Start difference. First operand 528 states and 1538 transitions. Second operand 7 states. [2020-10-05 22:43:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:23,004 INFO L93 Difference]: Finished difference Result 603 states and 1727 transitions. [2020-10-05 22:43:23,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:43:23,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-05 22:43:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:23,008 INFO L225 Difference]: With dead ends: 603 [2020-10-05 22:43:23,008 INFO L226 Difference]: Without dead ends: 372 [2020-10-05 22:43:23,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:43:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2020-10-05 22:43:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 356. [2020-10-05 22:43:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2020-10-05 22:43:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 989 transitions. [2020-10-05 22:43:23,019 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 989 transitions. Word has length 27 [2020-10-05 22:43:23,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:23,020 INFO L479 AbstractCegarLoop]: Abstraction has 356 states and 989 transitions. [2020-10-05 22:43:23,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:43:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 989 transitions. [2020-10-05 22:43:23,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 22:43:23,022 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:23,022 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:43:23,022 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 22:43:23,023 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:23,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1185672165, now seen corresponding path program 3 times [2020-10-05 22:43:23,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:23,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804908589] [2020-10-05 22:43:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:23,158 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-05 22:43:23,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804908589] [2020-10-05 22:43:23,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:23,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:43:23,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393878299] [2020-10-05 22:43:23,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:43:23,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:23,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:43:23,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:43:23,162 INFO L87 Difference]: Start difference. First operand 356 states and 989 transitions. Second operand 7 states. [2020-10-05 22:43:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:23,246 INFO L93 Difference]: Finished difference Result 495 states and 1338 transitions. [2020-10-05 22:43:23,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:43:23,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-05 22:43:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:23,248 INFO L225 Difference]: With dead ends: 495 [2020-10-05 22:43:23,248 INFO L226 Difference]: Without dead ends: 220 [2020-10-05 22:43:23,248 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:43:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-10-05 22:43:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2020-10-05 22:43:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-10-05 22:43:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 541 transitions. [2020-10-05 22:43:23,256 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 541 transitions. Word has length 27 [2020-10-05 22:43:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:23,257 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 541 transitions. [2020-10-05 22:43:23,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:43:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 541 transitions. [2020-10-05 22:43:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 22:43:23,258 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:23,258 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:43:23,258 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 22:43:23,259 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:23,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:23,259 INFO L82 PathProgramCache]: Analyzing trace with hash -208247163, now seen corresponding path program 4 times [2020-10-05 22:43:23,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:23,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668015085] [2020-10-05 22:43:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:43:23,607 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-05 22:43:23,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668015085] [2020-10-05 22:43:23,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:43:23,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:43:23,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639815947] [2020-10-05 22:43:23,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:43:23,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:43:23,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:43:23,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:43:23,609 INFO L87 Difference]: Start difference. First operand 220 states and 541 transitions. Second operand 9 states. [2020-10-05 22:43:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:43:23,812 INFO L93 Difference]: Finished difference Result 271 states and 660 transitions. [2020-10-05 22:43:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:43:23,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-05 22:43:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:43:23,813 INFO L225 Difference]: With dead ends: 271 [2020-10-05 22:43:23,814 INFO L226 Difference]: Without dead ends: 172 [2020-10-05 22:43:23,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-05 22:43:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-10-05 22:43:23,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-10-05 22:43:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-10-05 22:43:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 393 transitions. [2020-10-05 22:43:23,820 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 393 transitions. Word has length 27 [2020-10-05 22:43:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:43:23,820 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 393 transitions. [2020-10-05 22:43:23,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:43:23,820 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 393 transitions. [2020-10-05 22:43:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 22:43:23,821 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:43:23,821 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, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:43:23,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 22:43:23,822 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:43:23,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:43:23,822 INFO L82 PathProgramCache]: Analyzing trace with hash 886281791, now seen corresponding path program 5 times [2020-10-05 22:43:23,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:43:23,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505612599] [2020-10-05 22:43:23,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:43:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:43:23,859 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:43:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:43:23,896 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:43:23,934 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 22:43:23,934 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 22:43:23,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 22:43:23,957 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-05 22:43:23,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,960 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-05 22:43:23,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,960 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-05 22:43:23,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,960 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-05 22:43:23,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,961 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-05 22:43:23,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,961 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-05 22:43:23,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,961 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-05 22:43:23,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,962 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-05 22:43:23,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,962 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-05 22:43:23,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,963 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-05 22:43:23,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,963 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-05 22:43:23,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,963 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-05 22:43:23,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,964 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-05 22:43:23,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,965 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-05 22:43:23,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,965 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-05 22:43:23,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,965 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-05 22:43:23,965 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,965 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-05 22:43:23,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,966 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-05 22:43:23,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,966 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-05 22:43:23,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,967 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-05 22:43:23,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,967 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-05 22:43:23,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,967 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-05 22:43:23,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,968 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-05 22:43:23,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,968 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-05 22:43:23,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,968 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-05 22:43:23,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,969 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-05 22:43:23,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,969 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-05 22:43:23,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,969 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-05 22:43:23,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,970 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-05 22:43:23,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,970 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-05 22:43:23,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:23,971 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-05 22:43:23,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:43:24,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:43:24 BasicIcfg [2020-10-05 22:43:24,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 22:43:24,052 INFO L168 Benchmark]: Toolchain (without parser) took 16076.43 ms. Allocated memory was 144.7 MB in the beginning and 419.4 MB in the end (delta: 274.7 MB). Free memory was 101.2 MB in the beginning and 245.9 MB in the end (delta: -144.7 MB). Peak memory consumption was 130.0 MB. Max. memory is 7.1 GB. [2020-10-05 22:43:24,055 INFO L168 Benchmark]: CDTParser took 1.42 ms. Allocated memory is still 144.7 MB. Free memory was 121.9 MB in the beginning and 121.5 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-05 22:43:24,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.42 ms. Allocated memory was 144.7 MB in the beginning and 204.5 MB in the end (delta: 59.8 MB). Free memory was 101.2 MB in the beginning and 155.1 MB in the end (delta: -53.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2020-10-05 22:43:24,057 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.71 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 152.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-05 22:43:24,057 INFO L168 Benchmark]: Boogie Preprocessor took 47.30 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 149.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-05 22:43:24,062 INFO L168 Benchmark]: RCFGBuilder took 2163.85 ms. Allocated memory was 204.5 MB in the beginning and 246.4 MB in the end (delta: 41.9 MB). Free memory was 149.3 MB in the beginning and 178.4 MB in the end (delta: -29.1 MB). Peak memory consumption was 97.7 MB. Max. memory is 7.1 GB. [2020-10-05 22:43:24,063 INFO L168 Benchmark]: TraceAbstraction took 13026.73 ms. Allocated memory was 246.4 MB in the beginning and 419.4 MB in the end (delta: 173.0 MB). Free memory was 176.5 MB in the beginning and 245.9 MB in the end (delta: -69.4 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. [2020-10-05 22:43:24,070 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.42 ms. Allocated memory is still 144.7 MB. Free memory was 121.9 MB in the beginning and 121.5 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.42 ms. Allocated memory was 144.7 MB in the beginning and 204.5 MB in the end (delta: 59.8 MB). Free memory was 101.2 MB in the beginning and 155.1 MB in the end (delta: -53.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.71 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 152.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.30 ms. Allocated memory is still 204.5 MB. Free memory was 152.2 MB in the beginning and 149.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2163.85 ms. Allocated memory was 204.5 MB in the beginning and 246.4 MB in the end (delta: 41.9 MB). Free memory was 149.3 MB in the beginning and 178.4 MB in the end (delta: -29.1 MB). Peak memory consumption was 97.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13026.73 ms. Allocated memory was 246.4 MB in the beginning and 419.4 MB in the end (delta: 173.0 MB). Free memory was 176.5 MB in the beginning and 245.9 MB in the end (delta: -69.4 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.5s, 124 ProgramPointsBefore, 46 ProgramPointsAfterwards, 113 TransitionsBefore, 34 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 1353 VarBasedMoverChecksPositive, 57 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 48 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 6248 CheckedPairsTotal, 91 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L711] 0 int b = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff0_thd4; [L727] 0 _Bool z$r_buff1_thd0; [L728] 0 _Bool z$r_buff1_thd1; [L729] 0 _Bool z$r_buff1_thd2; [L730] 0 _Bool z$r_buff1_thd3; [L731] 0 _Bool z$r_buff1_thd4; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1157; [L838] FCALL, FORK 0 pthread_create(&t1157, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1158; [L840] FCALL, FORK 0 pthread_create(&t1158, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 pthread_t t1159; [L842] FCALL, FORK 0 pthread_create(&t1159, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 pthread_t t1160; [L844] FCALL, FORK 0 pthread_create(&t1160, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 4 z$w_buff1 = z$w_buff0 [L794] 4 z$w_buff0 = 2 [L795] 4 z$w_buff1_used = z$w_buff0_used [L796] 4 z$w_buff0_used = (_Bool)1 [L7] COND FALSE 4 !(!expression) [L798] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L799] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L800] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L801] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L802] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L803] 4 z$r_buff0_thd4 = (_Bool)1 [L806] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L773] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L779] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L779] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L780] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L780] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L781] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L781] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L782] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L783] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 3 return 0; [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L819] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L819] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L822] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 4 return 0; [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L857] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L858] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L859] 0 z$flush_delayed = weak$$choice2 [L860] 0 z$mem_tmp = z [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L862] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L863] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1 [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L863] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L864] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L864] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L865] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L865] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L867] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L869] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L869] 0 z = z$flush_delayed ? z$mem_tmp : z [L870] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 604 SDtfs, 789 SDslu, 1427 SDs, 0 SdLazy, 476 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred 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.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 276 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 39619 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...