/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix013_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:19:24,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:19:24,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:19:24,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:19:24,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:19:24,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:19:24,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:19:24,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:19:24,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:19:24,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:19:24,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:19:24,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:19:24,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:19:24,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:19:24,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:19:24,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:19:24,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:19:24,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:19:24,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:19:24,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:19:24,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:19:24,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:19:24,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:19:24,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:19:24,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:19:24,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:19:24,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:19:24,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:19:24,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:19:24,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:19:24,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:19:24,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:19:24,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:19:24,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:19:24,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:19:24,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:19:24,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:19:24,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:19:24,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:19:24,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:19:24,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:19:24,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:19:24,610 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:19:24,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:19:24,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:19:24,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:19:24,614 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:19:24,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:19:24,615 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:19:24,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:19:24,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:19:24,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:19:24,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:19:24,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:19:24,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:19:24,616 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:19:24,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:19:24,617 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:19:24,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:19:24,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:19:24,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:19:24,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:19:24,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:19:24,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:19:24,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:19:24,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:19:24,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:19:24,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:19:24,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:19:24,618 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:19:24,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:19:24,619 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:19:24,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:19:24,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:19:24,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:19:24,916 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:19:24,916 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:19:24,917 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013_power.oepc.i [2021-03-25 14:19:24,971 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73471c2a/2c55299a5f5d45f1babe9f071ba5224e/FLAGc267c68ff [2021-03-25 14:19:25,496 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:19:25,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013_power.oepc.i [2021-03-25 14:19:25,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73471c2a/2c55299a5f5d45f1babe9f071ba5224e/FLAGc267c68ff [2021-03-25 14:19:25,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73471c2a/2c55299a5f5d45f1babe9f071ba5224e [2021-03-25 14:19:25,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:19:25,959 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:19:25,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:19:25,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:19:25,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:19:25,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:19:25" (1/1) ... [2021-03-25 14:19:25,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ceee96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:19:25, skipping insertion in model container [2021-03-25 14:19:25,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:19:25" (1/1) ... [2021-03-25 14:19:25,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:19:26,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:19:26,119 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013_power.oepc.i[951,964] [2021-03-25 14:19:26,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:19:26,383 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:19:26,392 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013_power.oepc.i[951,964] [2021-03-25 14:19:26,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:19:26,532 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:19:26,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:19:26 WrapperNode [2021-03-25 14:19:26,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:19:26,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:19:26,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:19:26,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:19:26,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:19:26" (1/1) ... [2021-03-25 14:19:26,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:19:26" (1/1) ... [2021-03-25 14:19:26,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:19:26,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:19:26,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:19:26,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:19:26,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:19:26" (1/1) ... [2021-03-25 14:19:26,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:19:26" (1/1) ... [2021-03-25 14:19:26,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:19:26" (1/1) ... [2021-03-25 14:19:26,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:19:26" (1/1) ... [2021-03-25 14:19:26,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:19:26" (1/1) ... [2021-03-25 14:19:26,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:19:26" (1/1) ... [2021-03-25 14:19:26,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:19:26" (1/1) ... [2021-03-25 14:19:26,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:19:26,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:19:26,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:19:26,669 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:19:26,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:19:26" (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 [2021-03-25 14:19:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:19:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:19:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:19:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:19:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:19:26,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:19:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:19:26,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:19:26,746 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:19:26,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:19:26,746 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:19:26,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:19:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:19:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:19:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:19:26,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:19:26,748 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:19:28,743 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:19:28,743 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:19:28,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:19:28 BoogieIcfgContainer [2021-03-25 14:19:28,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:19:28,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:19:28,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:19:28,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:19:28,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:19:25" (1/3) ... [2021-03-25 14:19:28,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c8c06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:19:28, skipping insertion in model container [2021-03-25 14:19:28,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:19:26" (2/3) ... [2021-03-25 14:19:28,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c8c06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:19:28, skipping insertion in model container [2021-03-25 14:19:28,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:19:28" (3/3) ... [2021-03-25 14:19:28,753 INFO L111 eAbstractionObserver]: Analyzing ICFG mix013_power.oepc.i [2021-03-25 14:19:28,759 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:19:28,763 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:19:28,764 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:19:28,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,809 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,810 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,810 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,810 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,810 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,811 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,811 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,811 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,816 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,821 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,821 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,834 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,834 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,835 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,835 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,836 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,852 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,853 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,854 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,856 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,857 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,858 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,859 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,859 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,861 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,861 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,862 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,862 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,862 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,862 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,862 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,862 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,862 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,862 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,863 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,864 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,865 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,865 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,878 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,879 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,879 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,880 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,881 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,881 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,882 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,884 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,884 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:19:28,886 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:19:28,903 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:19:28,929 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:19:28,930 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:19:28,930 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:19:28,930 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:19:28,930 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:19:28,930 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:19:28,930 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:19:28,930 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:19:28,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 121 transitions, 262 flow [2021-03-25 14:19:28,988 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-25 14:19:28,988 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:19:28,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 14:19:28,997 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 121 transitions, 262 flow [2021-03-25 14:19:29,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 117 transitions, 246 flow [2021-03-25 14:19:29,003 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:19:29,021 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-25 14:19:29,023 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-25 14:19:29,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 246 flow [2021-03-25 14:19:29,065 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-25 14:19:29,065 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:19:29,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 14:19:29,069 INFO L142 LiptonReduction]: Number of co-enabled transitions 2894 [2021-03-25 14:19:30,567 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:19:30,991 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:19:31,107 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:19:32,461 INFO L154 LiptonReduction]: Checked pairs total: 5923 [2021-03-25 14:19:32,461 INFO L156 LiptonReduction]: Total number of compositions: 77 [2021-03-25 14:19:32,463 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3461 [2021-03-25 14:19:32,471 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 14:19:32,471 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:19:32,471 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:19:32,472 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:19:32,472 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:19:32,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:19:32,476 INFO L82 PathProgramCache]: Analyzing trace with hash -554722087, now seen corresponding path program 1 times [2021-03-25 14:19:32,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:19:32,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416587532] [2021-03-25 14:19:32,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:19:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:19:32,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:32,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:19:32,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:32,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:32,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:19:32,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416587532] [2021-03-25 14:19:32,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:19:32,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:19:32,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239380705] [2021-03-25 14:19:32,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:19:32,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:19:32,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:19:32,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:19:32,759 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 198 [2021-03-25 14:19:32,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:32,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:19:32,766 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 198 [2021-03-25 14:19:32,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:19:32,912 INFO L129 PetriNetUnfolder]: 133/372 cut-off events. [2021-03-25 14:19:32,912 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:19:32,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 372 events. 133/372 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2107 event pairs, 110 based on Foata normal form. 32/377 useless extension candidates. Maximal degree in co-relation 568. Up to 153 conditions per place. [2021-03-25 14:19:32,921 INFO L132 encePairwiseOnDemand]: 194/198 looper letters, 11 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2021-03-25 14:19:32,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 52 transitions, 142 flow [2021-03-25 14:19:32,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:19:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:19:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2021-03-25 14:19:32,939 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9158249158249159 [2021-03-25 14:19:32,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 544 transitions. [2021-03-25 14:19:32,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 544 transitions. [2021-03-25 14:19:32,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:19:32,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 544 transitions. [2021-03-25 14:19:32,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:32,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:32,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:32,969 INFO L185 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 3 states and 544 transitions. [2021-03-25 14:19:32,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 52 transitions, 142 flow [2021-03-25 14:19:32,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:19:32,977 INFO L241 Difference]: Finished difference. Result has 58 places, 47 transitions, 106 flow [2021-03-25 14:19:32,978 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2021-03-25 14:19:32,979 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2021-03-25 14:19:32,979 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:19:32,980 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-25 14:19:32,981 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 106 flow [2021-03-25 14:19:32,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 106 flow [2021-03-25 14:19:32,987 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-03-25 14:19:32,987 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:19:32,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:19:32,989 INFO L142 LiptonReduction]: Number of co-enabled transitions 670 [2021-03-25 14:19:34,640 INFO L154 LiptonReduction]: Checked pairs total: 2974 [2021-03-25 14:19:34,640 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-25 14:19:34,640 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1661 [2021-03-25 14:19:34,642 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 78 flow [2021-03-25 14:19:34,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:34,642 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:19:34,642 INFO L263 CegarLoopForPetriNet]: 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] [2021-03-25 14:19:34,643 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:19:34,643 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:19:34,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:19:34,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1604568838, now seen corresponding path program 1 times [2021-03-25 14:19:34,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:19:34,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150696367] [2021-03-25 14:19:34,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:19:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:19:34,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:34,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:19:34,805 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 14:19:34,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:19:34,818 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:19:34,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:19:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:19:34,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150696367] [2021-03-25 14:19:34,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:19:34,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:19:34,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372882140] [2021-03-25 14:19:34,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:19:34,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:19:34,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:19:34,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:19:34,827 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 212 [2021-03-25 14:19:34,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:34,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:19:34,828 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 212 [2021-03-25 14:19:34,828 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:19:34,940 INFO L129 PetriNetUnfolder]: 258/538 cut-off events. [2021-03-25 14:19:34,940 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:19:34,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 538 events. 258/538 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3035 event pairs, 81 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 940. Up to 200 conditions per place. [2021-03-25 14:19:34,944 INFO L132 encePairwiseOnDemand]: 203/212 looper letters, 7 selfloop transitions, 5 changer transitions 14/50 dead transitions. [2021-03-25 14:19:34,945 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 164 flow [2021-03-25 14:19:34,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:19:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:19:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 897 transitions. [2021-03-25 14:19:34,948 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8462264150943396 [2021-03-25 14:19:34,948 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 897 transitions. [2021-03-25 14:19:34,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 897 transitions. [2021-03-25 14:19:34,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:19:34,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 897 transitions. [2021-03-25 14:19:34,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 179.4) internal successors, (897), 5 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:34,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:34,954 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:34,954 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 78 flow. Second operand 5 states and 897 transitions. [2021-03-25 14:19:34,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 164 flow [2021-03-25 14:19:34,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:19:34,956 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 117 flow [2021-03-25 14:19:34,956 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2021-03-25 14:19:34,957 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -14 predicate places. [2021-03-25 14:19:34,957 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:19:34,957 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 117 flow [2021-03-25 14:19:34,957 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 117 flow [2021-03-25 14:19:34,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 117 flow [2021-03-25 14:19:34,986 INFO L129 PetriNetUnfolder]: 115/302 cut-off events. [2021-03-25 14:19:34,986 INFO L130 PetriNetUnfolder]: For 80/94 co-relation queries the response was YES. [2021-03-25 14:19:34,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 302 events. 115/302 cut-off events. For 80/94 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1633 event pairs, 83 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 608. Up to 161 conditions per place. [2021-03-25 14:19:34,991 INFO L142 LiptonReduction]: Number of co-enabled transitions 524 [2021-03-25 14:19:35,781 WARN L205 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-25 14:19:35,940 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-25 14:19:36,275 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-25 14:19:36,443 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-25 14:19:36,457 INFO L154 LiptonReduction]: Checked pairs total: 1029 [2021-03-25 14:19:36,457 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:19:36,457 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1500 [2021-03-25 14:19:36,458 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 113 flow [2021-03-25 14:19:36,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,459 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:19:36,459 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:19:36,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:19:36,459 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:19:36,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:19:36,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1421724642, now seen corresponding path program 1 times [2021-03-25 14:19:36,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:19:36,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845790005] [2021-03-25 14:19:36,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:19:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:19:36,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:36,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:19:36,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845790005] [2021-03-25 14:19:36,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:19:36,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:19:36,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138403374] [2021-03-25 14:19:36,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:19:36,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:19:36,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:19:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:19:36,506 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 214 [2021-03-25 14:19:36,507 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,507 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:19:36,507 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 214 [2021-03-25 14:19:36,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:19:36,540 INFO L129 PetriNetUnfolder]: 86/239 cut-off events. [2021-03-25 14:19:36,540 INFO L130 PetriNetUnfolder]: For 101/126 co-relation queries the response was YES. [2021-03-25 14:19:36,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 239 events. 86/239 cut-off events. For 101/126 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1237 event pairs, 48 based on Foata normal form. 4/224 useless extension candidates. Maximal degree in co-relation 507. Up to 131 conditions per place. [2021-03-25 14:19:36,542 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 1 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2021-03-25 14:19:36,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 121 flow [2021-03-25 14:19:36,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:19:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:19:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2021-03-25 14:19:36,544 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8987538940809969 [2021-03-25 14:19:36,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 577 transitions. [2021-03-25 14:19:36,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions. [2021-03-25 14:19:36,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:19:36,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions. [2021-03-25 14:19:36,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,548 INFO L185 Difference]: Start difference. First operand has 43 places, 34 transitions, 113 flow. Second operand 3 states and 577 transitions. [2021-03-25 14:19:36,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 121 flow [2021-03-25 14:19:36,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:19:36,549 INFO L241 Difference]: Finished difference. Result has 45 places, 34 transitions, 119 flow [2021-03-25 14:19:36,550 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2021-03-25 14:19:36,550 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -17 predicate places. [2021-03-25 14:19:36,550 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:19:36,550 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 119 flow [2021-03-25 14:19:36,550 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 34 transitions, 119 flow [2021-03-25 14:19:36,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 119 flow [2021-03-25 14:19:36,573 INFO L129 PetriNetUnfolder]: 85/240 cut-off events. [2021-03-25 14:19:36,573 INFO L130 PetriNetUnfolder]: For 92/113 co-relation queries the response was YES. [2021-03-25 14:19:36,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 240 events. 85/240 cut-off events. For 92/113 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1253 event pairs, 48 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 513. Up to 132 conditions per place. [2021-03-25 14:19:36,576 INFO L142 LiptonReduction]: Number of co-enabled transitions 522 [2021-03-25 14:19:36,582 INFO L154 LiptonReduction]: Checked pairs total: 376 [2021-03-25 14:19:36,582 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:19:36,582 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-25 14:19:36,583 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 119 flow [2021-03-25 14:19:36,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,584 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:19:36,584 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:19:36,584 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:19:36,584 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:19:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:19:36,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1527721324, now seen corresponding path program 1 times [2021-03-25 14:19:36,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:19:36,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824921687] [2021-03-25 14:19:36,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:19:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:19:36,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:36,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:36,655 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 14:19:36,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:19:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:19:36,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824921687] [2021-03-25 14:19:36,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:19:36,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:19:36,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266777961] [2021-03-25 14:19:36,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:19:36,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:19:36,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:19:36,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:19:36,673 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 214 [2021-03-25 14:19:36,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:19:36,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 214 [2021-03-25 14:19:36,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:19:36,711 INFO L129 PetriNetUnfolder]: 81/185 cut-off events. [2021-03-25 14:19:36,711 INFO L130 PetriNetUnfolder]: For 168/282 co-relation queries the response was YES. [2021-03-25 14:19:36,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 185 events. 81/185 cut-off events. For 168/282 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 772 event pairs, 10 based on Foata normal form. 5/182 useless extension candidates. Maximal degree in co-relation 565. Up to 113 conditions per place. [2021-03-25 14:19:36,713 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 13 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2021-03-25 14:19:36,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 38 transitions, 176 flow [2021-03-25 14:19:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:19:36,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:19:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2021-03-25 14:19:36,716 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8520249221183801 [2021-03-25 14:19:36,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2021-03-25 14:19:36,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2021-03-25 14:19:36,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:19:36,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2021-03-25 14:19:36,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,719 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 119 flow. Second operand 3 states and 547 transitions. [2021-03-25 14:19:36,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 38 transitions, 176 flow [2021-03-25 14:19:36,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:19:36,722 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 124 flow [2021-03-25 14:19:36,722 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2021-03-25 14:19:36,722 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -16 predicate places. [2021-03-25 14:19:36,722 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:19:36,723 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 124 flow [2021-03-25 14:19:36,723 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 124 flow [2021-03-25 14:19:36,723 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 34 transitions, 124 flow [2021-03-25 14:19:36,742 INFO L129 PetriNetUnfolder]: 68/203 cut-off events. [2021-03-25 14:19:36,742 INFO L130 PetriNetUnfolder]: For 93/105 co-relation queries the response was YES. [2021-03-25 14:19:36,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 203 events. 68/203 cut-off events. For 93/105 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 999 event pairs, 34 based on Foata normal form. 1/185 useless extension candidates. Maximal degree in co-relation 445. Up to 109 conditions per place. [2021-03-25 14:19:36,745 INFO L142 LiptonReduction]: Number of co-enabled transitions 520 [2021-03-25 14:19:36,750 INFO L154 LiptonReduction]: Checked pairs total: 375 [2021-03-25 14:19:36,750 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:19:36,750 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-25 14:19:36,753 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 124 flow [2021-03-25 14:19:36,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,753 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:19:36,754 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:19:36,754 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:19:36,754 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:19:36,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:19:36,754 INFO L82 PathProgramCache]: Analyzing trace with hash -804876771, now seen corresponding path program 1 times [2021-03-25 14:19:36,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:19:36,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135188520] [2021-03-25 14:19:36,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:19:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:19:36,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:36,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:36,797 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:19:36,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:19:36,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:36,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:19:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:19:36,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135188520] [2021-03-25 14:19:36,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:19:36,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:19:36,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199040529] [2021-03-25 14:19:36,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:19:36,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:19:36,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:19:36,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:19:36,806 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 214 [2021-03-25 14:19:36,807 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:19:36,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 214 [2021-03-25 14:19:36,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:19:36,933 INFO L129 PetriNetUnfolder]: 478/936 cut-off events. [2021-03-25 14:19:36,934 INFO L130 PetriNetUnfolder]: For 211/229 co-relation queries the response was YES. [2021-03-25 14:19:36,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 936 events. 478/936 cut-off events. For 211/229 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 6242 event pairs, 224 based on Foata normal form. 65/831 useless extension candidates. Maximal degree in co-relation 2026. Up to 615 conditions per place. [2021-03-25 14:19:36,942 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 12 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2021-03-25 14:19:36,943 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 196 flow [2021-03-25 14:19:36,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:19:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:19:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 904 transitions. [2021-03-25 14:19:36,945 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8448598130841122 [2021-03-25 14:19:36,945 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 904 transitions. [2021-03-25 14:19:36,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 904 transitions. [2021-03-25 14:19:36,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:19:36,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 904 transitions. [2021-03-25 14:19:36,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,950 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:36,950 INFO L185 Difference]: Start difference. First operand has 46 places, 34 transitions, 124 flow. Second operand 5 states and 904 transitions. [2021-03-25 14:19:36,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 196 flow [2021-03-25 14:19:36,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:19:36,954 INFO L241 Difference]: Finished difference. Result has 51 places, 43 transitions, 193 flow [2021-03-25 14:19:36,954 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2021-03-25 14:19:36,954 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -11 predicate places. [2021-03-25 14:19:36,954 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:19:36,954 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 43 transitions, 193 flow [2021-03-25 14:19:36,955 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 43 transitions, 193 flow [2021-03-25 14:19:36,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 193 flow [2021-03-25 14:19:37,018 INFO L129 PetriNetUnfolder]: 355/750 cut-off events. [2021-03-25 14:19:37,018 INFO L130 PetriNetUnfolder]: For 578/735 co-relation queries the response was YES. [2021-03-25 14:19:37,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2139 conditions, 750 events. 355/750 cut-off events. For 578/735 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5109 event pairs, 160 based on Foata normal form. 8/682 useless extension candidates. Maximal degree in co-relation 2124. Up to 442 conditions per place. [2021-03-25 14:19:37,030 INFO L142 LiptonReduction]: Number of co-enabled transitions 708 [2021-03-25 14:19:37,114 INFO L154 LiptonReduction]: Checked pairs total: 875 [2021-03-25 14:19:37,114 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:19:37,114 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 160 [2021-03-25 14:19:37,116 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 187 flow [2021-03-25 14:19:37,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:37,117 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:19:37,117 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:19:37,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:19:37,117 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:19:37,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:19:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2059341961, now seen corresponding path program 1 times [2021-03-25 14:19:37,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:19:37,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712406411] [2021-03-25 14:19:37,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:19:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:19:37,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:37,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:37,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:37,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:37,199 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:19:37,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:19:37,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:37,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:19:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:19:37,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712406411] [2021-03-25 14:19:37,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:19:37,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:19:37,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158050061] [2021-03-25 14:19:37,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:19:37,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:19:37,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:19:37,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:19:37,210 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 214 [2021-03-25 14:19:37,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:37,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:19:37,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 214 [2021-03-25 14:19:37,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:19:37,335 INFO L129 PetriNetUnfolder]: 336/704 cut-off events. [2021-03-25 14:19:37,335 INFO L130 PetriNetUnfolder]: For 651/1010 co-relation queries the response was YES. [2021-03-25 14:19:37,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 704 events. 336/704 cut-off events. For 651/1010 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4210 event pairs, 60 based on Foata normal form. 115/756 useless extension candidates. Maximal degree in co-relation 2398. Up to 443 conditions per place. [2021-03-25 14:19:37,343 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 13 selfloop transitions, 14 changer transitions 0/53 dead transitions. [2021-03-25 14:19:37,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 297 flow [2021-03-25 14:19:37,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:19:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:19:37,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1085 transitions. [2021-03-25 14:19:37,346 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8450155763239875 [2021-03-25 14:19:37,346 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1085 transitions. [2021-03-25 14:19:37,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1085 transitions. [2021-03-25 14:19:37,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:19:37,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1085 transitions. [2021-03-25 14:19:37,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:37,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:37,351 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:37,351 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 187 flow. Second operand 6 states and 1085 transitions. [2021-03-25 14:19:37,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 297 flow [2021-03-25 14:19:37,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 290 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:19:37,357 INFO L241 Difference]: Finished difference. Result has 55 places, 47 transitions, 276 flow [2021-03-25 14:19:37,357 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=276, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2021-03-25 14:19:37,358 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2021-03-25 14:19:37,358 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:19:37,358 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 276 flow [2021-03-25 14:19:37,358 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 47 transitions, 276 flow [2021-03-25 14:19:37,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 276 flow [2021-03-25 14:19:37,406 INFO L129 PetriNetUnfolder]: 219/522 cut-off events. [2021-03-25 14:19:37,406 INFO L130 PetriNetUnfolder]: For 1123/1329 co-relation queries the response was YES. [2021-03-25 14:19:37,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2050 conditions, 522 events. 219/522 cut-off events. For 1123/1329 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3238 event pairs, 57 based on Foata normal form. 16/511 useless extension candidates. Maximal degree in co-relation 2032. Up to 322 conditions per place. [2021-03-25 14:19:37,415 INFO L142 LiptonReduction]: Number of co-enabled transitions 804 [2021-03-25 14:19:37,462 INFO L154 LiptonReduction]: Checked pairs total: 969 [2021-03-25 14:19:37,463 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:19:37,463 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 105 [2021-03-25 14:19:37,465 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 268 flow [2021-03-25 14:19:37,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:37,466 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:19:37,466 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:19:37,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:19:37,466 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:19:37,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:19:37,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1305254441, now seen corresponding path program 1 times [2021-03-25 14:19:37,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:19:37,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025336623] [2021-03-25 14:19:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:19:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:19:37,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:37,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:37,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:37,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:37,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:37,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:37,646 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:19:37,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:19:37,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:37,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:19:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:19:37,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025336623] [2021-03-25 14:19:37,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:19:37,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:19:37,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469933707] [2021-03-25 14:19:37,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:19:37,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:19:37,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:19:37,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:19:37,657 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 214 [2021-03-25 14:19:37,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:37,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:19:37,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 214 [2021-03-25 14:19:37,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:19:37,781 INFO L129 PetriNetUnfolder]: 240/507 cut-off events. [2021-03-25 14:19:37,781 INFO L130 PetriNetUnfolder]: For 1138/1639 co-relation queries the response was YES. [2021-03-25 14:19:37,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2143 conditions, 507 events. 240/507 cut-off events. For 1138/1639 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2698 event pairs, 28 based on Foata normal form. 113/565 useless extension candidates. Maximal degree in co-relation 2123. Up to 301 conditions per place. [2021-03-25 14:19:37,788 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 10 selfloop transitions, 18 changer transitions 4/58 dead transitions. [2021-03-25 14:19:37,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 424 flow [2021-03-25 14:19:37,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:19:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:19:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1266 transitions. [2021-03-25 14:19:37,791 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8451268357810414 [2021-03-25 14:19:37,791 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1266 transitions. [2021-03-25 14:19:37,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1266 transitions. [2021-03-25 14:19:37,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:19:37,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1266 transitions. [2021-03-25 14:19:37,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 180.85714285714286) internal successors, (1266), 7 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:37,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:37,797 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:37,797 INFO L185 Difference]: Start difference. First operand has 55 places, 46 transitions, 268 flow. Second operand 7 states and 1266 transitions. [2021-03-25 14:19:37,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 424 flow [2021-03-25 14:19:37,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 362 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-25 14:19:37,809 INFO L241 Difference]: Finished difference. Result has 58 places, 51 transitions, 328 flow [2021-03-25 14:19:37,809 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=328, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2021-03-25 14:19:37,810 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2021-03-25 14:19:37,810 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:19:37,810 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 51 transitions, 328 flow [2021-03-25 14:19:37,810 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 51 transitions, 328 flow [2021-03-25 14:19:37,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 51 transitions, 328 flow [2021-03-25 14:19:37,842 INFO L129 PetriNetUnfolder]: 126/341 cut-off events. [2021-03-25 14:19:37,842 INFO L130 PetriNetUnfolder]: For 586/607 co-relation queries the response was YES. [2021-03-25 14:19:37,844 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 341 events. 126/341 cut-off events. For 586/607 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1865 event pairs, 38 based on Foata normal form. 1/329 useless extension candidates. Maximal degree in co-relation 1235. Up to 161 conditions per place. [2021-03-25 14:19:37,848 INFO L142 LiptonReduction]: Number of co-enabled transitions 812 [2021-03-25 14:19:37,872 INFO L154 LiptonReduction]: Checked pairs total: 1063 [2021-03-25 14:19:37,872 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:19:37,873 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 63 [2021-03-25 14:19:37,873 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 318 flow [2021-03-25 14:19:37,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:37,874 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:19:37,874 INFO L263 CegarLoopForPetriNet]: 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] [2021-03-25 14:19:37,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:19:37,874 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:19:37,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:19:37,874 INFO L82 PathProgramCache]: Analyzing trace with hash 134492760, now seen corresponding path program 1 times [2021-03-25 14:19:37,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:19:37,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95712387] [2021-03-25 14:19:37,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:19:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:19:37,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:37,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:37,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:37,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:37,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:37,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:38,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:38,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:38,008 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:19:38,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:19:38,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:38,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:19:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:19:38,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95712387] [2021-03-25 14:19:38,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:19:38,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:19:38,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044096444] [2021-03-25 14:19:38,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:19:38,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:19:38,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:19:38,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:19:38,021 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 214 [2021-03-25 14:19:38,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 318 flow. Second operand has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:38,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:19:38,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 214 [2021-03-25 14:19:38,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:19:38,149 INFO L129 PetriNetUnfolder]: 212/428 cut-off events. [2021-03-25 14:19:38,149 INFO L130 PetriNetUnfolder]: For 936/1221 co-relation queries the response was YES. [2021-03-25 14:19:38,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 428 events. 212/428 cut-off events. For 936/1221 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2127 event pairs, 25 based on Foata normal form. 52/426 useless extension candidates. Maximal degree in co-relation 1632. Up to 185 conditions per place. [2021-03-25 14:19:38,154 INFO L132 encePairwiseOnDemand]: 207/214 looper letters, 6 selfloop transitions, 18 changer transitions 5/55 dead transitions. [2021-03-25 14:19:38,154 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 384 flow [2021-03-25 14:19:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:19:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:19:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1439 transitions. [2021-03-25 14:19:38,158 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8405373831775701 [2021-03-25 14:19:38,158 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1439 transitions. [2021-03-25 14:19:38,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1439 transitions. [2021-03-25 14:19:38,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:19:38,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1439 transitions. [2021-03-25 14:19:38,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 179.875) internal successors, (1439), 8 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:38,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:38,165 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 214.0) internal successors, (1926), 9 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:38,165 INFO L185 Difference]: Start difference. First operand has 58 places, 50 transitions, 318 flow. Second operand 8 states and 1439 transitions. [2021-03-25 14:19:38,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 384 flow [2021-03-25 14:19:38,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 331 flow, removed 17 selfloop flow, removed 6 redundant places. [2021-03-25 14:19:38,172 INFO L241 Difference]: Finished difference. Result has 60 places, 47 transitions, 277 flow [2021-03-25 14:19:38,173 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=277, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2021-03-25 14:19:38,173 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -2 predicate places. [2021-03-25 14:19:38,173 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:19:38,173 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 47 transitions, 277 flow [2021-03-25 14:19:38,173 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 47 transitions, 277 flow [2021-03-25 14:19:38,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 47 transitions, 277 flow [2021-03-25 14:19:38,194 INFO L129 PetriNetUnfolder]: 90/224 cut-off events. [2021-03-25 14:19:38,194 INFO L130 PetriNetUnfolder]: For 314/342 co-relation queries the response was YES. [2021-03-25 14:19:38,195 INFO L84 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 224 events. 90/224 cut-off events. For 314/342 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1067 event pairs, 26 based on Foata normal form. 1/212 useless extension candidates. Maximal degree in co-relation 711. Up to 81 conditions per place. [2021-03-25 14:19:38,197 INFO L142 LiptonReduction]: Number of co-enabled transitions 648 [2021-03-25 14:19:38,525 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:19:38,653 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:19:39,008 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-25 14:19:39,149 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-25 14:19:39,158 INFO L154 LiptonReduction]: Checked pairs total: 1145 [2021-03-25 14:19:39,158 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:19:39,158 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 985 [2021-03-25 14:19:39,159 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 261 flow [2021-03-25 14:19:39,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:39,159 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:19:39,159 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:19:39,160 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:19:39,160 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:19:39,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:19:39,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1279226662, now seen corresponding path program 1 times [2021-03-25 14:19:39,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:19:39,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630327913] [2021-03-25 14:19:39,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:19:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:19:39,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:39,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:19:39,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:39,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:39,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:39,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:19:39,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630327913] [2021-03-25 14:19:39,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:19:39,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:19:39,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581134666] [2021-03-25 14:19:39,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:19:39,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:19:39,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:19:39,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:19:39,216 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 216 [2021-03-25 14:19:39,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:39,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:19:39,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 216 [2021-03-25 14:19:39,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:19:39,275 INFO L129 PetriNetUnfolder]: 155/369 cut-off events. [2021-03-25 14:19:39,275 INFO L130 PetriNetUnfolder]: For 1010/1088 co-relation queries the response was YES. [2021-03-25 14:19:39,277 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 369 events. 155/369 cut-off events. For 1010/1088 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2025 event pairs, 29 based on Foata normal form. 15/355 useless extension candidates. Maximal degree in co-relation 1223. Up to 119 conditions per place. [2021-03-25 14:19:39,278 INFO L132 encePairwiseOnDemand]: 213/216 looper letters, 7 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2021-03-25 14:19:39,278 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 47 transitions, 297 flow [2021-03-25 14:19:39,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:19:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:19:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 740 transitions. [2021-03-25 14:19:39,281 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8564814814814815 [2021-03-25 14:19:39,281 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 740 transitions. [2021-03-25 14:19:39,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 740 transitions. [2021-03-25 14:19:39,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:19:39,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 740 transitions. [2021-03-25 14:19:39,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:39,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:39,284 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:39,284 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 261 flow. Second operand 4 states and 740 transitions. [2021-03-25 14:19:39,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 47 transitions, 297 flow [2021-03-25 14:19:39,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 47 transitions, 228 flow, removed 19 selfloop flow, removed 8 redundant places. [2021-03-25 14:19:39,289 INFO L241 Difference]: Finished difference. Result has 53 places, 46 transitions, 219 flow [2021-03-25 14:19:39,289 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2021-03-25 14:19:39,289 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2021-03-25 14:19:39,289 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:19:39,290 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 46 transitions, 219 flow [2021-03-25 14:19:39,290 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 46 transitions, 219 flow [2021-03-25 14:19:39,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 46 transitions, 219 flow [2021-03-25 14:19:39,319 INFO L129 PetriNetUnfolder]: 142/326 cut-off events. [2021-03-25 14:19:39,319 INFO L130 PetriNetUnfolder]: For 319/345 co-relation queries the response was YES. [2021-03-25 14:19:39,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 326 events. 142/326 cut-off events. For 319/345 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1754 event pairs, 36 based on Foata normal form. 1/300 useless extension candidates. Maximal degree in co-relation 889. Up to 119 conditions per place. [2021-03-25 14:19:39,323 INFO L142 LiptonReduction]: Number of co-enabled transitions 640 [2021-03-25 14:19:39,368 INFO L154 LiptonReduction]: Checked pairs total: 946 [2021-03-25 14:19:39,368 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:19:39,368 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 79 [2021-03-25 14:19:39,368 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 222 flow [2021-03-25 14:19:39,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:39,369 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:19:39,369 INFO L263 CegarLoopForPetriNet]: 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] [2021-03-25 14:19:39,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:19:39,369 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:19:39,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:19:39,370 INFO L82 PathProgramCache]: Analyzing trace with hash -776706045, now seen corresponding path program 1 times [2021-03-25 14:19:39,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:19:39,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696783013] [2021-03-25 14:19:39,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:19:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:19:39,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:39,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:19:39,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:39,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:39,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:19:39,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:19:39,472 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-25 14:19:39,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:19:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:19:39,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696783013] [2021-03-25 14:19:39,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:19:39,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:19:39,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751160046] [2021-03-25 14:19:39,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:19:39,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:19:39,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:19:39,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:19:39,488 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 217 [2021-03-25 14:19:39,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:39,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:19:39,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 217 [2021-03-25 14:19:39,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:19:39,595 INFO L129 PetriNetUnfolder]: 255/589 cut-off events. [2021-03-25 14:19:39,595 INFO L130 PetriNetUnfolder]: For 1319/1521 co-relation queries the response was YES. [2021-03-25 14:19:39,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 589 events. 255/589 cut-off events. For 1319/1521 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3762 event pairs, 9 based on Foata normal form. 51/612 useless extension candidates. Maximal degree in co-relation 1771. Up to 178 conditions per place. [2021-03-25 14:19:39,599 INFO L132 encePairwiseOnDemand]: 209/217 looper letters, 10 selfloop transitions, 4 changer transitions 15/60 dead transitions. [2021-03-25 14:19:39,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 357 flow [2021-03-25 14:19:39,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:19:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:19:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1053 transitions. [2021-03-25 14:19:39,602 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8087557603686636 [2021-03-25 14:19:39,602 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1053 transitions. [2021-03-25 14:19:39,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1053 transitions. [2021-03-25 14:19:39,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:19:39,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1053 transitions. [2021-03-25 14:19:39,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:39,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:39,607 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:39,608 INFO L185 Difference]: Start difference. First operand has 53 places, 46 transitions, 222 flow. Second operand 6 states and 1053 transitions. [2021-03-25 14:19:39,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 357 flow [2021-03-25 14:19:39,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:19:39,615 INFO L241 Difference]: Finished difference. Result has 59 places, 43 transitions, 213 flow [2021-03-25 14:19:39,615 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2021-03-25 14:19:39,616 INFO L343 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2021-03-25 14:19:39,616 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:19:39,616 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 43 transitions, 213 flow [2021-03-25 14:19:39,616 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 43 transitions, 213 flow [2021-03-25 14:19:39,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 43 transitions, 213 flow [2021-03-25 14:19:39,642 INFO L129 PetriNetUnfolder]: 107/280 cut-off events. [2021-03-25 14:19:39,642 INFO L130 PetriNetUnfolder]: For 294/324 co-relation queries the response was YES. [2021-03-25 14:19:39,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 280 events. 107/280 cut-off events. For 294/324 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1580 event pairs, 22 based on Foata normal form. 1/259 useless extension candidates. Maximal degree in co-relation 771. Up to 84 conditions per place. [2021-03-25 14:19:39,646 INFO L142 LiptonReduction]: Number of co-enabled transitions 594 [2021-03-25 14:19:39,654 INFO L154 LiptonReduction]: Checked pairs total: 325 [2021-03-25 14:19:39,654 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:19:39,654 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-25 14:19:39,655 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 213 flow [2021-03-25 14:19:39,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:19:39,655 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:19:39,656 INFO L263 CegarLoopForPetriNet]: 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] [2021-03-25 14:19:39,656 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:19:39,656 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:19:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:19:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1855941675, now seen corresponding path program 2 times [2021-03-25 14:19:39,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:19:39,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33330337] [2021-03-25 14:19:39,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:19:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:19:39,741 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:19:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:19:39,822 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:19:39,866 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:19:39,867 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:19:39,867 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:19:40,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:19:40 BasicIcfg [2021-03-25 14:19:40,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:19:40,017 INFO L168 Benchmark]: Toolchain (without parser) took 14058.77 ms. Allocated memory was 255.9 MB in the beginning and 583.0 MB in the end (delta: 327.2 MB). Free memory was 233.1 MB in the beginning and 538.8 MB in the end (delta: -305.7 MB). Peak memory consumption was 279.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:19:40,018 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:19:40,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 571.48 ms. Allocated memory was 255.9 MB in the beginning and 333.4 MB in the end (delta: 77.6 MB). Free memory was 232.6 MB in the beginning and 292.6 MB in the end (delta: -60.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:19:40,018 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.59 ms. Allocated memory is still 333.4 MB. Free memory was 292.6 MB in the beginning and 290.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:19:40,019 INFO L168 Benchmark]: Boogie Preprocessor took 58.50 ms. Allocated memory is still 333.4 MB. Free memory was 290.0 MB in the beginning and 287.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:19:40,019 INFO L168 Benchmark]: RCFGBuilder took 2076.91 ms. Allocated memory is still 333.4 MB. Free memory was 287.5 MB in the beginning and 157.6 MB in the end (delta: 129.9 MB). Peak memory consumption was 132.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:19:40,020 INFO L168 Benchmark]: TraceAbstraction took 11269.02 ms. Allocated memory was 333.4 MB in the beginning and 583.0 MB in the end (delta: 249.6 MB). Free memory was 157.6 MB in the beginning and 538.8 MB in the end (delta: -381.2 MB). Peak memory consumption was 127.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:19:40,024 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 571.48 ms. Allocated memory was 255.9 MB in the beginning and 333.4 MB in the end (delta: 77.6 MB). Free memory was 232.6 MB in the beginning and 292.6 MB in the end (delta: -60.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 72.59 ms. Allocated memory is still 333.4 MB. Free memory was 292.6 MB in the beginning and 290.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 58.50 ms. Allocated memory is still 333.4 MB. Free memory was 290.0 MB in the beginning and 287.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2076.91 ms. Allocated memory is still 333.4 MB. Free memory was 287.5 MB in the beginning and 157.6 MB in the end (delta: 129.9 MB). Peak memory consumption was 132.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 11269.02 ms. Allocated memory was 333.4 MB in the beginning and 583.0 MB in the end (delta: 249.6 MB). Free memory was 157.6 MB in the beginning and 538.8 MB in the end (delta: -381.2 MB). Peak memory consumption was 127.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3438.6ms, 128 PlacesBefore, 62 PlacesAfterwards, 117 TransitionsBefore, 50 TransitionsAfterwards, 2894 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5923 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2834, positive: 2708, positive conditional: 0, positive unconditional: 2708, negative: 126, negative conditional: 0, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1834, positive: 1784, positive conditional: 0, positive unconditional: 1784, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1834, positive: 1784, positive conditional: 0, positive unconditional: 1784, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1834, positive: 1776, positive conditional: 0, positive unconditional: 1776, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 636, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 592, negative conditional: 0, negative unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2834, positive: 924, positive conditional: 0, positive unconditional: 924, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 1834, unknown conditional: 0, unknown unconditional: 1834] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 278, Positive conditional cache size: 0, Positive unconditional cache size: 278, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1659.3ms, 58 PlacesBefore, 44 PlacesAfterwards, 47 TransitionsBefore, 33 TransitionsAfterwards, 670 CoEnabledTransitionPairs, 4 FixpointIterations, 10 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 2974 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 801, positive: 668, positive conditional: 0, positive unconditional: 668, negative: 133, negative conditional: 0, negative unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 117, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 117, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 470, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 801, positive: 582, positive conditional: 0, positive unconditional: 582, negative: 102, negative conditional: 0, negative unconditional: 102, unknown: 117, unknown conditional: 0, unknown unconditional: 117] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 261, Positive conditional cache size: 0, Positive unconditional cache size: 261, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1499.9ms, 48 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 34 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1029 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 277, positive: 229, positive conditional: 0, positive unconditional: 229, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 277, positive: 216, positive conditional: 0, positive unconditional: 216, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 274, Positive conditional cache size: 0, Positive unconditional cache size: 274, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.7ms, 45 PlacesBefore, 45 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 376 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 317, Positive cache size: 276, Positive conditional cache size: 0, Positive unconditional cache size: 276, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.2ms, 46 PlacesBefore, 46 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 375 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 118, positive: 101, positive conditional: 0, positive unconditional: 101, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, positive: 98, positive conditional: 0, positive unconditional: 98, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 279, Positive conditional cache size: 0, Positive unconditional cache size: 279, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 159.6ms, 51 PlacesBefore, 51 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 708 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 875 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 206, positive: 176, positive conditional: 0, positive unconditional: 176, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 206, positive: 172, positive conditional: 0, positive unconditional: 172, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 257, Positive conditional cache size: 0, Positive unconditional cache size: 257, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 104.6ms, 55 PlacesBefore, 55 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 804 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 969 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 223, positive: 193, positive conditional: 0, positive unconditional: 193, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 223, positive: 177, positive conditional: 0, positive unconditional: 177, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 259, Positive conditional cache size: 0, Positive unconditional cache size: 259, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 62.4ms, 58 PlacesBefore, 58 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 812 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1063 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 249, positive: 215, positive conditional: 0, positive unconditional: 215, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 249, positive: 187, positive conditional: 0, positive unconditional: 187, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 266, Positive conditional cache size: 0, Positive unconditional cache size: 266, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 984.9ms, 60 PlacesBefore, 56 PlacesAfterwards, 47 TransitionsBefore, 44 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1145 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 335, positive: 290, positive conditional: 0, positive unconditional: 290, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 335, positive: 276, positive conditional: 0, positive unconditional: 276, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 271, Positive cache size: 238, Positive conditional cache size: 0, Positive unconditional cache size: 238, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 78.0ms, 53 PlacesBefore, 53 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 946 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 290, positive: 254, positive conditional: 0, positive unconditional: 254, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 290, positive: 246, positive conditional: 0, positive unconditional: 246, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 232, Positive conditional cache size: 0, Positive unconditional cache size: 232, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.1ms, 59 PlacesBefore, 57 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 594 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 325 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 233, Positive conditional cache size: 0, Positive unconditional cache size: 233, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t321; [L874] FCALL, FORK 0 pthread_create(&t321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t322; [L876] FCALL, FORK 0 pthread_create(&t322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t323; [L878] FCALL, FORK 0 pthread_create(&t323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L792] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L809] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L879] 0 pthread_t t324; [L880] FCALL, FORK 0 pthread_create(&t324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L840] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L841] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L842] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L844] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L844] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L845] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L851] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L796] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L797] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L798] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L798] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L799] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L799] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L886] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 10943.2ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1259.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3537.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 69 SDtfs, 56 SDslu, 49 SDs, 0 SdLazy, 238 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 232.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 215.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=328occurred in iteration=7, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 45.1ms SsaConstructionTime, 462.7ms SatisfiabilityAnalysisTime, 663.5ms InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...