/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 05:11:31,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 05:11:31,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 05:11:31,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 05:11:31,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 05:11:31,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 05:11:31,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 05:11:31,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 05:11:31,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 05:11:31,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 05:11:31,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 05:11:31,359 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 05:11:31,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 05:11:31,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 05:11:31,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 05:11:31,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 05:11:31,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 05:11:31,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 05:11:31,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 05:11:31,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 05:11:31,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 05:11:31,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 05:11:31,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 05:11:31,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 05:11:31,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 05:11:31,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 05:11:31,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 05:11:31,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 05:11:31,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 05:11:31,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 05:11:31,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 05:11:31,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 05:11:31,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 05:11:31,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 05:11:31,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 05:11:31,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 05:11:31,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 05:11:31,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 05:11:31,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 05:11:31,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 05:11:31,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 05:11:31,389 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-RepeatedVariableLbe.epf [2021-03-25 05:11:31,411 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 05:11:31,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 05:11:31,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 05:11:31,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 05:11:31,412 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 05:11:31,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 05:11:31,412 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 05:11:31,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 05:11:31,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 05:11:31,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 05:11:31,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 05:11:31,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 05:11:31,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 05:11:31,413 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 05:11:31,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 05:11:31,413 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 05:11:31,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 05:11:31,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 05:11:31,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 05:11:31,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 05:11:31,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 05:11:31,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 05:11:31,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 05:11:31,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 05:11:31,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 05:11:31,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 05:11:31,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 05:11:31,414 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 05:11:31,414 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 05:11:31,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 05:11:31,414 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 05:11:31,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 05:11:31,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 05:11:31,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 05:11:31,655 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 05:11:31,655 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 05:11:31,656 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_pso.oepc.i [2021-03-25 05:11:31,703 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a0548f18/9bd400be6b3541159042733dc5dd325f/FLAG71499697a [2021-03-25 05:11:32,129 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 05:11:32,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_pso.oepc.i [2021-03-25 05:11:32,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a0548f18/9bd400be6b3541159042733dc5dd325f/FLAG71499697a [2021-03-25 05:11:32,163 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a0548f18/9bd400be6b3541159042733dc5dd325f [2021-03-25 05:11:32,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 05:11:32,167 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 05:11:32,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 05:11:32,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 05:11:32,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 05:11:32,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:11:32" (1/1) ... [2021-03-25 05:11:32,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681ec50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:11:32, skipping insertion in model container [2021-03-25 05:11:32,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:11:32" (1/1) ... [2021-03-25 05:11:32,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 05:11:32,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 05:11:32,393 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/safe034_pso.oepc.i[950,963] [2021-03-25 05:11:32,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:11:32,514 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 05:11:32,524 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/safe034_pso.oepc.i[950,963] [2021-03-25 05:11:32,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:11:32,622 INFO L208 MainTranslator]: Completed translation [2021-03-25 05:11:32,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:11:32 WrapperNode [2021-03-25 05:11:32,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 05:11:32,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 05:11:32,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 05:11:32,625 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 05:11:32,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:11:32" (1/1) ... [2021-03-25 05:11:32,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:11:32" (1/1) ... [2021-03-25 05:11:32,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 05:11:32,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 05:11:32,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 05:11:32,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 05:11:32,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:11:32" (1/1) ... [2021-03-25 05:11:32,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:11:32" (1/1) ... [2021-03-25 05:11:32,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:11:32" (1/1) ... [2021-03-25 05:11:32,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:11:32" (1/1) ... [2021-03-25 05:11:32,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:11:32" (1/1) ... [2021-03-25 05:11:32,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:11:32" (1/1) ... [2021-03-25 05:11:32,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:11:32" (1/1) ... [2021-03-25 05:11:32,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 05:11:32,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 05:11:32,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 05:11:32,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 05:11:32,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:11:32" (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 05:11:32,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 05:11:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 05:11:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 05:11:32,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 05:11:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 05:11:32,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 05:11:32,743 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 05:11:32,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 05:11:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 05:11:32,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 05:11:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 05:11:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 05:11:32,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 05:11:32,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 05:11:32,745 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 05:11:33,768 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 05:11:33,768 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 05:11:33,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:11:33 BoogieIcfgContainer [2021-03-25 05:11:33,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 05:11:33,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 05:11:33,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 05:11:33,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 05:11:33,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 05:11:32" (1/3) ... [2021-03-25 05:11:33,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed5a974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:11:33, skipping insertion in model container [2021-03-25 05:11:33,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:11:32" (2/3) ... [2021-03-25 05:11:33,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed5a974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:11:33, skipping insertion in model container [2021-03-25 05:11:33,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:11:33" (3/3) ... [2021-03-25 05:11:33,774 INFO L111 eAbstractionObserver]: Analyzing ICFG safe034_pso.oepc.i [2021-03-25 05:11:33,778 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 05:11:33,781 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 05:11:33,781 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 05:11:33,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,802 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,802 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,802 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,802 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,803 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,803 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,803 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,803 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,810 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,813 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,816 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,818 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,819 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:11:33,821 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 05:11:33,833 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 05:11:33,845 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 05:11:33,845 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 05:11:33,845 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 05:11:33,845 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 05:11:33,845 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 05:11:33,845 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 05:11:33,845 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 05:11:33,845 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 05:11:33,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2021-03-25 05:11:33,872 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-25 05:11:33,872 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:11:33,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2021-03-25 05:11:33,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2021-03-25 05:11:33,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2021-03-25 05:11:33,878 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:11:33,883 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-25 05:11:33,885 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-25 05:11:33,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2021-03-25 05:11:33,897 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-25 05:11:33,897 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:11:33,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2021-03-25 05:11:33,900 INFO L142 LiptonReduction]: Number of co-enabled transitions 1488 [2021-03-25 05:11:34,683 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 05:11:35,035 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 05:11:35,756 INFO L154 LiptonReduction]: Checked pairs total: 2240 [2021-03-25 05:11:35,757 INFO L156 LiptonReduction]: Total number of compositions: 65 [2021-03-25 05:11:35,758 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1881 [2021-03-25 05:11:35,766 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-25 05:11:35,766 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:11:35,766 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:11:35,767 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:11:35,767 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:11:35,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:11:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash -85203967, now seen corresponding path program 1 times [2021-03-25 05:11:35,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:11:35,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804820677] [2021-03-25 05:11:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:11:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:11:35,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:35,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:11:35,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:35,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:11:35,954 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 05:11:35,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804820677] [2021-03-25 05:11:35,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:11:35,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:11:35,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058406806] [2021-03-25 05:11:35,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:11:35,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:11:35,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:11:35,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:11:35,972 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2021-03-25 05:11:35,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 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 05:11:35,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:11:35,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2021-03-25 05:11:35,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:11:36,028 INFO L129 PetriNetUnfolder]: 9/77 cut-off events. [2021-03-25 05:11:36,028 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:11:36,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 77 events. 9/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 229 event pairs, 3 based on Foata normal form. 5/74 useless extension candidates. Maximal degree in co-relation 90. Up to 17 conditions per place. [2021-03-25 05:11:36,030 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 5 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2021-03-25 05:11:36,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 95 flow [2021-03-25 05:11:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:11:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:11:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2021-03-25 05:11:36,043 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9026915113871635 [2021-03-25 05:11:36,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2021-03-25 05:11:36,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2021-03-25 05:11:36,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:11:36,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2021-03-25 05:11:36,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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 05:11:36,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 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 05:11:36,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 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 05:11:36,058 INFO L185 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 436 transitions. [2021-03-25 05:11:36,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 95 flow [2021-03-25 05:11:36,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 92 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 05:11:36,061 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 78 flow [2021-03-25 05:11:36,062 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2021-03-25 05:11:36,063 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2021-03-25 05:11:36,063 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:11:36,063 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 78 flow [2021-03-25 05:11:36,064 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 78 flow [2021-03-25 05:11:36,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2021-03-25 05:11:36,069 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-25 05:11:36,069 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:11:36,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 05:11:36,070 INFO L142 LiptonReduction]: Number of co-enabled transitions 282 [2021-03-25 05:11:36,740 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-03-25 05:11:36,781 INFO L154 LiptonReduction]: Checked pairs total: 838 [2021-03-25 05:11:36,781 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 05:11:36,781 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 718 [2021-03-25 05:11:36,781 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-25 05:11:36,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 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 05:11:36,782 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:11:36,782 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:11:36,782 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 05:11:36,782 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:11:36,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:11:36,783 INFO L82 PathProgramCache]: Analyzing trace with hash 15953787, now seen corresponding path program 1 times [2021-03-25 05:11:36,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:11:36,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639887496] [2021-03-25 05:11:36,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:11:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:11:36,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:36,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:11:36,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:36,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:11:36,844 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 05:11:36,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 05:11:36,846 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 05:11:36,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639887496] [2021-03-25 05:11:36,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:11:36,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:11:36,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215592304] [2021-03-25 05:11:36,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:11:36,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:11:36,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:11:36,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:11:36,849 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172 [2021-03-25 05:11:36,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 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 05:11:36,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:11:36,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172 [2021-03-25 05:11:36,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:11:36,873 INFO L129 PetriNetUnfolder]: 7/40 cut-off events. [2021-03-25 05:11:36,873 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:11:36,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 40 events. 7/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 86 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2021-03-25 05:11:36,874 INFO L132 encePairwiseOnDemand]: 167/172 looper letters, 3 selfloop transitions, 3 changer transitions 6/30 dead transitions. [2021-03-25 05:11:36,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 94 flow [2021-03-25 05:11:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:11:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:11:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 753 transitions. [2021-03-25 05:11:36,876 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8755813953488372 [2021-03-25 05:11:36,876 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 753 transitions. [2021-03-25 05:11:36,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 753 transitions. [2021-03-25 05:11:36,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:11:36,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 753 transitions. [2021-03-25 05:11:36,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.6) internal successors, (753), 5 states have internal predecessors, (753), 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 05:11:36,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 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 05:11:36,879 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 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 05:11:36,879 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 753 transitions. [2021-03-25 05:11:36,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 94 flow [2021-03-25 05:11:36,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 05:11:36,880 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 73 flow [2021-03-25 05:11:36,881 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2021-03-25 05:11:36,881 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -10 predicate places. [2021-03-25 05:11:36,881 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:11:36,881 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 73 flow [2021-03-25 05:11:36,881 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 73 flow [2021-03-25 05:11:36,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 73 flow [2021-03-25 05:11:36,884 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-25 05:11:36,885 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-25 05:11:36,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 32 events. 3/32 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-25 05:11:36,885 INFO L142 LiptonReduction]: Number of co-enabled transitions 200 [2021-03-25 05:11:37,282 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-25 05:11:37,395 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 05:11:37,648 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-25 05:11:37,770 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 05:11:37,773 INFO L154 LiptonReduction]: Checked pairs total: 522 [2021-03-25 05:11:37,773 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 05:11:37,774 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 893 [2021-03-25 05:11:37,775 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 69 flow [2021-03-25 05:11:37,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 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 05:11:37,776 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:11:37,776 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:11:37,776 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 05:11:37,776 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:11:37,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:11:37,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1774128755, now seen corresponding path program 1 times [2021-03-25 05:11:37,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:11:37,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303057693] [2021-03-25 05:11:37,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:11:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:11:37,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:37,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:11:37,870 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:11:37,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:11:37,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:37,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:11:37,875 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 05:11:37,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303057693] [2021-03-25 05:11:37,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:11:37,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:11:37,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783579290] [2021-03-25 05:11:37,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:11:37,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:11:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:11:37,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:11:37,878 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 174 [2021-03-25 05:11:37,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 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 05:11:37,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:11:37,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 174 [2021-03-25 05:11:37,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:11:37,915 INFO L129 PetriNetUnfolder]: 59/137 cut-off events. [2021-03-25 05:11:37,915 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-03-25 05:11:37,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 137 events. 59/137 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 620 event pairs, 25 based on Foata normal form. 10/123 useless extension candidates. Maximal degree in co-relation 271. Up to 83 conditions per place. [2021-03-25 05:11:37,918 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 9 selfloop transitions, 7 changer transitions 2/33 dead transitions. [2021-03-25 05:11:37,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 127 flow [2021-03-25 05:11:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:11:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:11:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 735 transitions. [2021-03-25 05:11:37,921 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8448275862068966 [2021-03-25 05:11:37,921 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 735 transitions. [2021-03-25 05:11:37,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 735 transitions. [2021-03-25 05:11:37,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:11:37,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 735 transitions. [2021-03-25 05:11:37,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.0) internal successors, (735), 5 states have internal predecessors, (735), 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 05:11:37,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 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 05:11:37,924 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 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 05:11:37,924 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 69 flow. Second operand 5 states and 735 transitions. [2021-03-25 05:11:37,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 127 flow [2021-03-25 05:11:37,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 120 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 05:11:37,926 INFO L241 Difference]: Finished difference. Result has 36 places, 28 transitions, 116 flow [2021-03-25 05:11:37,926 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2021-03-25 05:11:37,926 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -10 predicate places. [2021-03-25 05:11:37,927 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:11:37,927 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 28 transitions, 116 flow [2021-03-25 05:11:37,927 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 116 flow [2021-03-25 05:11:37,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 116 flow [2021-03-25 05:11:37,939 INFO L129 PetriNetUnfolder]: 42/109 cut-off events. [2021-03-25 05:11:37,939 INFO L130 PetriNetUnfolder]: For 50/52 co-relation queries the response was YES. [2021-03-25 05:11:37,940 INFO L84 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 109 events. 42/109 cut-off events. For 50/52 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 452 event pairs, 20 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 265. Up to 60 conditions per place. [2021-03-25 05:11:37,942 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-25 05:11:37,946 INFO L154 LiptonReduction]: Checked pairs total: 358 [2021-03-25 05:11:37,946 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:11:37,946 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-25 05:11:37,950 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 110 flow [2021-03-25 05:11:37,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 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 05:11:37,950 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:11:37,950 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:11:37,950 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 05:11:37,950 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:11:37,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:11:37,951 INFO L82 PathProgramCache]: Analyzing trace with hash 863838643, now seen corresponding path program 1 times [2021-03-25 05:11:37,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:11:37,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2983522] [2021-03-25 05:11:37,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:11:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:11:38,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:38,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:11:38,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:38,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:11:38,025 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:11:38,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:11:38,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:38,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:11:38,030 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 05:11:38,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2983522] [2021-03-25 05:11:38,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:11:38,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:11:38,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851144247] [2021-03-25 05:11:38,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:11:38,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:11:38,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:11:38,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:11:38,032 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 174 [2021-03-25 05:11:38,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 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 05:11:38,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:11:38,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 174 [2021-03-25 05:11:38,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:11:38,073 INFO L129 PetriNetUnfolder]: 37/97 cut-off events. [2021-03-25 05:11:38,073 INFO L130 PetriNetUnfolder]: For 76/124 co-relation queries the response was YES. [2021-03-25 05:11:38,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 97 events. 37/97 cut-off events. For 76/124 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 354 event pairs, 4 based on Foata normal form. 18/108 useless extension candidates. Maximal degree in co-relation 298. Up to 58 conditions per place. [2021-03-25 05:11:38,074 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 8 selfloop transitions, 10 changer transitions 4/37 dead transitions. [2021-03-25 05:11:38,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 204 flow [2021-03-25 05:11:38,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 05:11:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 05:11:38,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 882 transitions. [2021-03-25 05:11:38,076 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8448275862068966 [2021-03-25 05:11:38,076 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 882 transitions. [2021-03-25 05:11:38,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 882 transitions. [2021-03-25 05:11:38,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:11:38,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 882 transitions. [2021-03-25 05:11:38,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.0) internal successors, (882), 6 states have internal predecessors, (882), 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 05:11:38,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 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 05:11:38,080 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 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 05:11:38,080 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 110 flow. Second operand 6 states and 882 transitions. [2021-03-25 05:11:38,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 204 flow [2021-03-25 05:11:38,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 198 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 05:11:38,082 INFO L241 Difference]: Finished difference. Result has 40 places, 31 transitions, 172 flow [2021-03-25 05:11:38,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2021-03-25 05:11:38,082 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2021-03-25 05:11:38,082 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:11:38,082 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 172 flow [2021-03-25 05:11:38,083 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 172 flow [2021-03-25 05:11:38,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 172 flow [2021-03-25 05:11:38,089 INFO L129 PetriNetUnfolder]: 17/68 cut-off events. [2021-03-25 05:11:38,089 INFO L130 PetriNetUnfolder]: For 93/99 co-relation queries the response was YES. [2021-03-25 05:11:38,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 68 events. 17/68 cut-off events. For 93/99 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 224 event pairs, 3 based on Foata normal form. 2/69 useless extension candidates. Maximal degree in co-relation 217. Up to 38 conditions per place. [2021-03-25 05:11:38,090 INFO L142 LiptonReduction]: Number of co-enabled transitions 258 [2021-03-25 05:11:38,095 INFO L154 LiptonReduction]: Checked pairs total: 399 [2021-03-25 05:11:38,095 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:11:38,095 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-25 05:11:38,096 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 164 flow [2021-03-25 05:11:38,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 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 05:11:38,097 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:11:38,097 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:11:38,097 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 05:11:38,097 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:11:38,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:11:38,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2054526727, now seen corresponding path program 1 times [2021-03-25 05:11:38,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:11:38,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973148015] [2021-03-25 05:11:38,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:11:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:11:38,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:38,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:11:38,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:38,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:11:38,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:38,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:11:38,202 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:11:38,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:11:38,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:38,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:11:38,209 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 05:11:38,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973148015] [2021-03-25 05:11:38,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:11:38,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:11:38,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601128538] [2021-03-25 05:11:38,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:11:38,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:11:38,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:11:38,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:11:38,211 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 174 [2021-03-25 05:11:38,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 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 05:11:38,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:11:38,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 174 [2021-03-25 05:11:38,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:11:38,259 INFO L129 PetriNetUnfolder]: 24/66 cut-off events. [2021-03-25 05:11:38,259 INFO L130 PetriNetUnfolder]: For 126/175 co-relation queries the response was YES. [2021-03-25 05:11:38,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 66 events. 24/66 cut-off events. For 126/175 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 184 event pairs, 0 based on Foata normal form. 17/78 useless extension candidates. Maximal degree in co-relation 246. Up to 39 conditions per place. [2021-03-25 05:11:38,260 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 5 selfloop transitions, 11 changer transitions 4/35 dead transitions. [2021-03-25 05:11:38,260 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 222 flow [2021-03-25 05:11:38,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 05:11:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 05:11:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1023 transitions. [2021-03-25 05:11:38,262 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8399014778325123 [2021-03-25 05:11:38,263 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1023 transitions. [2021-03-25 05:11:38,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1023 transitions. [2021-03-25 05:11:38,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:11:38,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1023 transitions. [2021-03-25 05:11:38,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.14285714285714) internal successors, (1023), 7 states have internal predecessors, (1023), 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 05:11:38,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 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 05:11:38,267 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 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 05:11:38,267 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 164 flow. Second operand 7 states and 1023 transitions. [2021-03-25 05:11:38,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 222 flow [2021-03-25 05:11:38,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 196 flow, removed 11 selfloop flow, removed 3 redundant places. [2021-03-25 05:11:38,273 INFO L241 Difference]: Finished difference. Result has 44 places, 29 transitions, 162 flow [2021-03-25 05:11:38,274 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2021-03-25 05:11:38,274 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2021-03-25 05:11:38,274 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:11:38,274 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 29 transitions, 162 flow [2021-03-25 05:11:38,274 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 29 transitions, 162 flow [2021-03-25 05:11:38,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 29 transitions, 162 flow [2021-03-25 05:11:38,281 INFO L129 PetriNetUnfolder]: 7/39 cut-off events. [2021-03-25 05:11:38,281 INFO L130 PetriNetUnfolder]: For 51/52 co-relation queries the response was YES. [2021-03-25 05:11:38,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 39 events. 7/39 cut-off events. For 51/52 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 120. Up to 15 conditions per place. [2021-03-25 05:11:38,281 INFO L142 LiptonReduction]: Number of co-enabled transitions 192 [2021-03-25 05:11:38,854 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 05:11:38,969 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 05:11:38,973 INFO L154 LiptonReduction]: Checked pairs total: 476 [2021-03-25 05:11:38,973 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 05:11:38,973 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 699 [2021-03-25 05:11:38,973 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 148 flow [2021-03-25 05:11:38,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 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 05:11:38,974 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:11:38,974 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:11:38,974 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 05:11:38,974 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:11:38,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:11:38,974 INFO L82 PathProgramCache]: Analyzing trace with hash 647396349, now seen corresponding path program 1 times [2021-03-25 05:11:38,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:11:38,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048284099] [2021-03-25 05:11:38,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:11:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:11:39,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:39,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:11:39,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:11:39,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:11:39,041 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-25 05:11:39,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:11:39,046 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 05:11:39,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048284099] [2021-03-25 05:11:39,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:11:39,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:11:39,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235854001] [2021-03-25 05:11:39,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:11:39,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:11:39,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:11:39,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:11:39,047 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 176 [2021-03-25 05:11:39,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 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 05:11:39,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:11:39,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 176 [2021-03-25 05:11:39,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:11:39,071 INFO L129 PetriNetUnfolder]: 23/79 cut-off events. [2021-03-25 05:11:39,071 INFO L130 PetriNetUnfolder]: For 294/318 co-relation queries the response was YES. [2021-03-25 05:11:39,072 INFO L84 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 79 events. 23/79 cut-off events. For 294/318 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 288 event pairs, 2 based on Foata normal form. 10/84 useless extension candidates. Maximal degree in co-relation 251. Up to 25 conditions per place. [2021-03-25 05:11:39,072 INFO L132 encePairwiseOnDemand]: 171/176 looper letters, 4 selfloop transitions, 5 changer transitions 4/31 dead transitions. [2021-03-25 05:11:39,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 188 flow [2021-03-25 05:11:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:11:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:11:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 585 transitions. [2021-03-25 05:11:39,073 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8309659090909091 [2021-03-25 05:11:39,074 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 585 transitions. [2021-03-25 05:11:39,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 585 transitions. [2021-03-25 05:11:39,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:11:39,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 585 transitions. [2021-03-25 05:11:39,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 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 05:11:39,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 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 05:11:39,076 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 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 05:11:39,076 INFO L185 Difference]: Start difference. First operand has 40 places, 26 transitions, 148 flow. Second operand 4 states and 585 transitions. [2021-03-25 05:11:39,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 188 flow [2021-03-25 05:11:39,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 146 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-25 05:11:39,078 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 124 flow [2021-03-25 05:11:39,078 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2021-03-25 05:11:39,078 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -8 predicate places. [2021-03-25 05:11:39,078 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:11:39,078 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 26 transitions, 124 flow [2021-03-25 05:11:39,079 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 26 transitions, 124 flow [2021-03-25 05:11:39,079 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 124 flow [2021-03-25 05:11:39,083 INFO L129 PetriNetUnfolder]: 6/30 cut-off events. [2021-03-25 05:11:39,083 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-03-25 05:11:39,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 30 events. 6/30 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 70. Up to 8 conditions per place. [2021-03-25 05:11:39,084 INFO L142 LiptonReduction]: Number of co-enabled transitions 114 [2021-03-25 05:11:39,102 INFO L154 LiptonReduction]: Checked pairs total: 139 [2021-03-25 05:11:39,102 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 05:11:39,103 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-25 05:11:39,104 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 122 flow [2021-03-25 05:11:39,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 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 05:11:39,104 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:11:39,105 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:11:39,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 05:11:39,105 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:11:39,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:11:39,105 INFO L82 PathProgramCache]: Analyzing trace with hash -161694545, now seen corresponding path program 1 times [2021-03-25 05:11:39,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:11:39,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819517532] [2021-03-25 05:11:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:11:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:11:39,178 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:11:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:11:39,204 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:11:39,222 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 05:11:39,223 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 05:11:39,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 05:11:39,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 05:11:39 BasicIcfg [2021-03-25 05:11:39,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 05:11:39,292 INFO L168 Benchmark]: Toolchain (without parser) took 7125.06 ms. Allocated memory was 339.7 MB in the beginning and 578.8 MB in the end (delta: 239.1 MB). Free memory was 303.0 MB in the beginning and 521.8 MB in the end (delta: -218.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 16.0 GB. [2021-03-25 05:11:39,293 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 339.7 MB. Free memory was 321.2 MB in the beginning and 321.2 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 05:11:39,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 454.23 ms. Allocated memory is still 339.7 MB. Free memory was 302.8 MB in the beginning and 299.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB. [2021-03-25 05:11:39,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.59 ms. Allocated memory is still 339.7 MB. Free memory was 299.7 MB in the beginning and 296.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 05:11:39,297 INFO L168 Benchmark]: Boogie Preprocessor took 19.69 ms. Allocated memory is still 339.7 MB. Free memory was 296.6 MB in the beginning and 295.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 05:11:39,297 INFO L168 Benchmark]: RCFGBuilder took 1088.82 ms. Allocated memory is still 339.7 MB. Free memory was 294.5 MB in the beginning and 307.9 MB in the end (delta: -13.4 MB). Peak memory consumption was 172.2 MB. Max. memory is 16.0 GB. [2021-03-25 05:11:39,298 INFO L168 Benchmark]: TraceAbstraction took 5520.76 ms. Allocated memory was 339.7 MB in the beginning and 578.8 MB in the end (delta: 239.1 MB). Free memory was 307.9 MB in the beginning and 521.8 MB in the end (delta: -213.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 16.0 GB. [2021-03-25 05:11:39,299 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.12 ms. Allocated memory is still 339.7 MB. Free memory was 321.2 MB in the beginning and 321.2 MB in the end (delta: 69.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 454.23 ms. Allocated memory is still 339.7 MB. Free memory was 302.8 MB in the beginning and 299.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 35.59 ms. Allocated memory is still 339.7 MB. Free memory was 299.7 MB in the beginning and 296.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.69 ms. Allocated memory is still 339.7 MB. Free memory was 296.6 MB in the beginning and 295.5 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 1088.82 ms. Allocated memory is still 339.7 MB. Free memory was 294.5 MB in the beginning and 307.9 MB in the end (delta: -13.4 MB). Peak memory consumption was 172.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 5520.76 ms. Allocated memory was 339.7 MB in the beginning and 578.8 MB in the end (delta: 239.1 MB). Free memory was 307.9 MB in the beginning and 521.8 MB in the end (delta: -213.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1871.7ms, 101 PlacesBefore, 46 PlacesAfterwards, 93 TransitionsBefore, 37 TransitionsAfterwards, 1488 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 2240 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1149, positive: 1086, positive conditional: 0, positive unconditional: 1086, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 693, positive: 672, positive conditional: 0, positive unconditional: 672, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 693, positive: 672, positive conditional: 0, positive unconditional: 672, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1149, positive: 414, positive conditional: 0, positive unconditional: 414, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 693, unknown conditional: 0, unknown unconditional: 693] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 716.7ms, 43 PlacesBefore, 32 PlacesAfterwards, 34 TransitionsBefore, 23 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 838 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 264, positive: 205, positive conditional: 0, positive unconditional: 205, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 71, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 264, positive: 152, positive conditional: 0, positive unconditional: 152, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 71, unknown conditional: 0, unknown unconditional: 71] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 892.1ms, 36 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 22 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 522 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 198, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 42, negative conditional: 0, negative unconditional: 42, 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: 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] , Cache Queries: [ total: 198, positive: 153, positive conditional: 0, positive unconditional: 153, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.2ms, 36 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 358 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 226, positive: 204, positive conditional: 0, positive unconditional: 204, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 226, positive: 192, positive conditional: 0, positive unconditional: 192, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.2ms, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 399 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 177, positive: 153, positive conditional: 0, positive unconditional: 153, negative: 24, negative conditional: 0, negative unconditional: 24, 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: 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] , Cache Queries: [ total: 177, positive: 151, positive conditional: 0, positive unconditional: 151, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 698.7ms, 44 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 26 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 476 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 188, positive: 149, positive conditional: 0, positive unconditional: 149, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 188, positive: 142, positive conditional: 0, positive unconditional: 142, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.8ms, 38 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 139 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 89, positive: 72, positive conditional: 0, positive unconditional: 72, 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: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 89, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 36, Positive conditional cache size: 0, Positive unconditional cache size: 36, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2583; [L828] FCALL, FORK 0 pthread_create(&t2583, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t2584; [L830] FCALL, FORK 0 pthread_create(&t2584, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L831] 0 pthread_t t2585; [L832] FCALL, FORK 0 pthread_create(&t2585, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L770] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L770] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L771] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L771] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L772] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L773] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L774] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L775] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 3 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L838] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L838] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L840] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L842] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 5380.9ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 325.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1917.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 32 SDtfs, 22 SDslu, 18 SDs, 0 SdLazy, 131 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 76.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 55.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=4, InterpolantAutomatonStates: 30, 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: 46.6ms SsaConstructionTime, 205.0ms SatisfiabilityAnalysisTime, 313.7ms InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 290 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...