/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 06:03:26,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 06:03:26,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 06:03:26,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 06:03:26,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 06:03:26,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 06:03:26,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 06:03:26,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 06:03:26,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 06:03:26,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 06:03:26,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 06:03:26,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 06:03:26,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 06:03:26,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 06:03:26,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 06:03:26,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 06:03:26,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 06:03:26,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 06:03:26,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 06:03:26,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 06:03:26,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 06:03:26,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 06:03:26,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 06:03:26,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 06:03:26,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 06:03:26,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 06:03:26,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 06:03:26,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 06:03:26,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 06:03:26,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 06:03:26,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 06:03:26,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 06:03:26,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 06:03:26,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 06:03:26,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 06:03:26,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 06:03:26,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 06:03:26,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 06:03:26,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 06:03:26,691 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 06:03:26,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 06:03:26,693 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-06-11 06:03:26,714 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 06:03:26,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 06:03:26,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 06:03:26,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 06:03:26,717 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 06:03:26,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 06:03:26,717 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 06:03:26,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 06:03:26,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 06:03:26,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 06:03:26,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 06:03:26,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 06:03:26,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 06:03:26,718 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 06:03:26,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 06:03:26,718 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 06:03:26,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 06:03:26,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 06:03:26,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 06:03:26,718 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 06:03:26,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 06:03:26,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 06:03:26,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 06:03:26,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 06:03:26,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 06:03:26,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 06:03:26,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 06:03:26,719 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 06:03:26,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 06:03:26,719 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-06-11 06:03:26,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 06:03:26,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 06:03:26,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 06:03:26,939 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 06:03:26,939 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 06:03:26,940 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_rmo.opt.i [2021-06-11 06:03:26,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a8ba059/7607701ede824b6fa0e890fedd5bcbf7/FLAGfb3342f13 [2021-06-11 06:03:27,356 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 06:03:27,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_rmo.opt.i [2021-06-11 06:03:27,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a8ba059/7607701ede824b6fa0e890fedd5bcbf7/FLAGfb3342f13 [2021-06-11 06:03:27,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a8ba059/7607701ede824b6fa0e890fedd5bcbf7 [2021-06-11 06:03:27,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 06:03:27,708 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 06:03:27,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 06:03:27,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 06:03:27,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 06:03:27,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:03:27" (1/1) ... [2021-06-11 06:03:27,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5592504c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:03:27, skipping insertion in model container [2021-06-11 06:03:27,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:03:27" (1/1) ... [2021-06-11 06:03:27,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 06:03:27,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 06:03:27,853 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/mix010_rmo.opt.i[948,961] [2021-06-11 06:03:27,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:03:27,987 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 06:03:28,000 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/mix010_rmo.opt.i[948,961] [2021-06-11 06:03:28,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:03:28,094 INFO L208 MainTranslator]: Completed translation [2021-06-11 06:03:28,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:03:28 WrapperNode [2021-06-11 06:03:28,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 06:03:28,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 06:03:28,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 06:03:28,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 06:03:28,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:03:28" (1/1) ... [2021-06-11 06:03:28,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:03:28" (1/1) ... [2021-06-11 06:03:28,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 06:03:28,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 06:03:28,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 06:03:28,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 06:03:28,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:03:28" (1/1) ... [2021-06-11 06:03:28,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:03:28" (1/1) ... [2021-06-11 06:03:28,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:03:28" (1/1) ... [2021-06-11 06:03:28,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:03:28" (1/1) ... [2021-06-11 06:03:28,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:03:28" (1/1) ... [2021-06-11 06:03:28,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:03:28" (1/1) ... [2021-06-11 06:03:28,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:03:28" (1/1) ... [2021-06-11 06:03:28,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 06:03:28,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 06:03:28,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 06:03:28,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 06:03:28,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:03:28" (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-06-11 06:03:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 06:03:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 06:03:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 06:03:28,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 06:03:28,253 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 06:03:28,253 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 06:03:28,253 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 06:03:28,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 06:03:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 06:03:28,254 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 06:03:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 06:03:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 06:03:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 06:03:28,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 06:03:28,255 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 06:03:29,740 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 06:03:29,741 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 06:03:29,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:03:29 BoogieIcfgContainer [2021-06-11 06:03:29,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 06:03:29,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 06:03:29,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 06:03:29,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 06:03:29,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 06:03:27" (1/3) ... [2021-06-11 06:03:29,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcc6114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:03:29, skipping insertion in model container [2021-06-11 06:03:29,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:03:28" (2/3) ... [2021-06-11 06:03:29,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcc6114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:03:29, skipping insertion in model container [2021-06-11 06:03:29,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:03:29" (3/3) ... [2021-06-11 06:03:29,748 INFO L111 eAbstractionObserver]: Analyzing ICFG mix010_rmo.opt.i [2021-06-11 06:03:29,753 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 06:03:29,755 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 06:03:29,756 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 06:03:29,788 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,789 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,789 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,789 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,789 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,789 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,790 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,790 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,790 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,791 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,796 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,808 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,808 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,812 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,814 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,828 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,829 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,832 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,834 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,840 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,842 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,843 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:03:29,843 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 06:03:29,855 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 06:03:29,875 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 06:03:29,875 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 06:03:29,875 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 06:03:29,875 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 06:03:29,875 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 06:03:29,875 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 06:03:29,875 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 06:03:29,875 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 06:03:29,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 221 flow [2021-06-11 06:03:29,920 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-06-11 06:03:29,920 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:03:29,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-06-11 06:03:29,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 103 transitions, 221 flow [2021-06-11 06:03:29,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 100 transitions, 209 flow [2021-06-11 06:03:29,937 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:03:29,945 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 209 flow [2021-06-11 06:03:29,947 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 209 flow [2021-06-11 06:03:29,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 209 flow [2021-06-11 06:03:29,973 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-06-11 06:03:29,973 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:03:29,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-06-11 06:03:29,977 INFO L151 LiptonReduction]: Number of co-enabled transitions 1750 [2021-06-11 06:03:30,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,154 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 06:03:30,155 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:30,196 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,332 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:30,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:03:30,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:03:30,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:30,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:03:30,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:03:30,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,814 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:30,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:03:30,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:03:30,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:30,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:30,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,080 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 06:03:31,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,694 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:31,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:03:31,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:03:31,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:31,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:31,882 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 06:03:32,273 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-11 06:03:32,383 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-11 06:03:32,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,398 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:32,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 06:03:32,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:32,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,405 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 06:03:32,405 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:32,407 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,408 INFO L147 QuantifierPusher]: treesize reduction 50, result has 50.0 percent of original size 50 [2021-06-11 06:03:32,408 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:32,410 INFO L142 QuantifierPusher]: treesize reduction 50, result has 68.8 percent of original size [2021-06-11 06:03:32,410 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2021-06-11 06:03:32,410 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:32,411 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,413 INFO L147 QuantifierPusher]: treesize reduction 76, result has 39.7 percent of original size 50 [2021-06-11 06:03:32,413 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 3, 2, 1] term [2021-06-11 06:03:32,413 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:32,414 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,418 INFO L147 QuantifierPusher]: treesize reduction 141, result has 44.3 percent of original size 112 [2021-06-11 06:03:32,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:32,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,759 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:32,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:03:32,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:03:32,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:32,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:32,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:32,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,955 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:32,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:03:32,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:03:32,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:32,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:33,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:33,050 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 06:03:33,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:33,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:33,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:33,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:33,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:33,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:33,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:33,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:33,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:33,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:33,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:33,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:33,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:33,901 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:33,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:33,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:03:33,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:03:34,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:34,182 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:34,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:34,182 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:34,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:34,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 06:03:34,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:03:34,184 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:34,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:34,184 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:34,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:34,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 06:03:34,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 06:03:34,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:34,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:34,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 06:03:34,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 06:03:34,508 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 06:03:34,642 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 06:03:34,985 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 06:03:35,130 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 06:03:35,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:35,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:35,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:35,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:03:35,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:03:35,146 INFO L163 LiptonReduction]: Checked pairs total: 5038 [2021-06-11 06:03:35,146 INFO L165 LiptonReduction]: Total number of compositions: 95 [2021-06-11 06:03:35,148 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5211 [2021-06-11 06:03:35,154 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-06-11 06:03:35,154 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:03:35,154 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:03:35,155 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:03:35,155 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:03:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:03:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash 198283253, now seen corresponding path program 1 times [2021-06-11 06:03:35,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:03:35,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955894525] [2021-06-11 06:03:35,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:03:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:03:35,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:35,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:03:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:03:35,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955894525] [2021-06-11 06:03:35,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:03:35,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:03:35,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392230934] [2021-06-11 06:03:35,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:03:35,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:03:35,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:03:35,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:03:35,291 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 198 [2021-06-11 06:03:35,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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-06-11 06:03:35,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:03:35,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 198 [2021-06-11 06:03:35,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:03:35,346 INFO L129 PetriNetUnfolder]: 13/61 cut-off events. [2021-06-11 06:03:35,346 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:03:35,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 61 events. 13/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 5 based on Foata normal form. 16/68 useless extension candidates. Maximal degree in co-relation 91. Up to 25 conditions per place. [2021-06-11 06:03:35,347 INFO L132 encePairwiseOnDemand]: 193/198 looper letters, 6 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2021-06-11 06:03:35,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 25 transitions, 75 flow [2021-06-11 06:03:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:03:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:03:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2021-06-11 06:03:35,360 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8602693602693603 [2021-06-11 06:03:35,360 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 511 transitions. [2021-06-11 06:03:35,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions. [2021-06-11 06:03:35,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:03:35,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions. [2021-06-11 06:03:35,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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-06-11 06:03:35,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:03:35,375 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:03:35,377 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 511 transitions. [2021-06-11 06:03:35,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 25 transitions, 75 flow [2021-06-11 06:03:35,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 25 transitions, 72 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 06:03:35,379 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2021-06-11 06:03:35,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-06-11 06:03:35,381 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-06-11 06:03:35,381 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:03:35,381 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 56 flow [2021-06-11 06:03:35,381 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 56 flow [2021-06-11 06:03:35,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 56 flow [2021-06-11 06:03:35,385 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-11 06:03:35,385 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:03:35,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 06:03:35,385 INFO L151 LiptonReduction]: Number of co-enabled transitions 254 [2021-06-11 06:03:35,402 INFO L163 LiptonReduction]: Checked pairs total: 306 [2021-06-11 06:03:35,403 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:03:35,403 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-06-11 06:03:35,403 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-06-11 06:03:35,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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-06-11 06:03:35,404 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:03:35,404 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:03:35,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 06:03:35,404 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:03:35,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:03:35,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1571739396, now seen corresponding path program 1 times [2021-06-11 06:03:35,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:03:35,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408018856] [2021-06-11 06:03:35,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:03:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:03:35,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:35,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:03:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:03:35,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408018856] [2021-06-11 06:03:35,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:03:35,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:03:35,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337175005] [2021-06-11 06:03:35,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:03:35,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:03:35,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:03:35,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:03:35,465 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 198 [2021-06-11 06:03:35,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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-06-11 06:03:35,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:03:35,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 198 [2021-06-11 06:03:35,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:03:35,478 INFO L129 PetriNetUnfolder]: 1/25 cut-off events. [2021-06-11 06:03:35,478 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:03:35,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 25 events. 1/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 33. Up to 5 conditions per place. [2021-06-11 06:03:35,478 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 1 selfloop transitions, 2 changer transitions 3/24 dead transitions. [2021-06-11 06:03:35,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 68 flow [2021-06-11 06:03:35,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:03:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:03:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2021-06-11 06:03:35,479 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8636363636363636 [2021-06-11 06:03:35,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2021-06-11 06:03:35,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2021-06-11 06:03:35,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:03:35,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2021-06-11 06:03:35,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-06-11 06:03:35,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:03:35,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:03:35,482 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 513 transitions. [2021-06-11 06:03:35,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 68 flow [2021-06-11 06:03:35,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 64 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:03:35,483 INFO L241 Difference]: Finished difference. Result has 33 places, 21 transitions, 56 flow [2021-06-11 06:03:35,483 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2021-06-11 06:03:35,483 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2021-06-11 06:03:35,483 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:03:35,484 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 56 flow [2021-06-11 06:03:35,484 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 21 transitions, 56 flow [2021-06-11 06:03:35,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2021-06-11 06:03:35,486 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-06-11 06:03:35,486 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:03:35,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 06:03:35,487 INFO L151 LiptonReduction]: Number of co-enabled transitions 202 [2021-06-11 06:03:35,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:35,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:35,601 INFO L163 LiptonReduction]: Checked pairs total: 421 [2021-06-11 06:03:35,602 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 06:03:35,602 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 119 [2021-06-11 06:03:35,602 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-06-11 06:03:35,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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-06-11 06:03:35,603 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:03:35,603 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:03:35,603 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 06:03:35,603 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:03:35,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:03:35,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1573388515, now seen corresponding path program 1 times [2021-06-11 06:03:35,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:03:35,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388897124] [2021-06-11 06:03:35,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:03:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:03:35,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:35,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:03:35,657 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 06:03:35,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 06:03:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:03:35,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388897124] [2021-06-11 06:03:35,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:03:35,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:03:35,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291346068] [2021-06-11 06:03:35,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:03:35,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:03:35,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:03:35,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:03:35,668 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 199 [2021-06-11 06:03:35,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 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-06-11 06:03:35,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:03:35,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 199 [2021-06-11 06:03:35,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:03:35,693 INFO L129 PetriNetUnfolder]: 28/79 cut-off events. [2021-06-11 06:03:35,693 INFO L130 PetriNetUnfolder]: For 18/21 co-relation queries the response was YES. [2021-06-11 06:03:35,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 79 events. 28/79 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 258 event pairs, 6 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 154. Up to 47 conditions per place. [2021-06-11 06:03:35,694 INFO L132 encePairwiseOnDemand]: 196/199 looper letters, 8 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-06-11 06:03:35,694 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 23 transitions, 83 flow [2021-06-11 06:03:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:03:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:03:35,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2021-06-11 06:03:35,696 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8023450586264657 [2021-06-11 06:03:35,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2021-06-11 06:03:35,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2021-06-11 06:03:35,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:03:35,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2021-06-11 06:03:35,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-06-11 06:03:35,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 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-06-11 06:03:35,698 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 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-06-11 06:03:35,698 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 479 transitions. [2021-06-11 06:03:35,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 23 transitions, 83 flow [2021-06-11 06:03:35,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 23 transitions, 77 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:03:35,699 INFO L241 Difference]: Finished difference. Result has 31 places, 20 transitions, 58 flow [2021-06-11 06:03:35,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2021-06-11 06:03:35,700 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2021-06-11 06:03:35,700 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:03:35,700 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 58 flow [2021-06-11 06:03:35,700 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 58 flow [2021-06-11 06:03:35,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 58 flow [2021-06-11 06:03:35,703 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-06-11 06:03:35,703 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-06-11 06:03:35,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 20 events. 0/20 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 06:03:35,703 INFO L151 LiptonReduction]: Number of co-enabled transitions 174 [2021-06-11 06:03:35,709 INFO L163 LiptonReduction]: Checked pairs total: 171 [2021-06-11 06:03:35,709 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:03:35,709 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 06:03:35,710 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 58 flow [2021-06-11 06:03:35,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 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-06-11 06:03:35,710 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:03:35,710 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:03:35,710 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 06:03:35,710 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:03:35,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:03:35,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1586010885, now seen corresponding path program 1 times [2021-06-11 06:03:35,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:03:35,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401302802] [2021-06-11 06:03:35,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:03:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:03:35,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:35,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:03:35,799 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 06:03:35,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:03:35,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:35,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:03:35,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401302802] [2021-06-11 06:03:35,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:03:35,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:03:35,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651581390] [2021-06-11 06:03:35,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:03:35,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:03:35,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:03:35,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:03:35,807 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 199 [2021-06-11 06:03:35,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 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-06-11 06:03:35,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:03:35,808 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 199 [2021-06-11 06:03:35,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:03:35,834 INFO L129 PetriNetUnfolder]: 28/78 cut-off events. [2021-06-11 06:03:35,834 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-06-11 06:03:35,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 78 events. 28/78 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 288 event pairs, 12 based on Foata normal form. 8/81 useless extension candidates. Maximal degree in co-relation 154. Up to 45 conditions per place. [2021-06-11 06:03:35,835 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 5 selfloop transitions, 4 changer transitions 7/30 dead transitions. [2021-06-11 06:03:35,835 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 110 flow [2021-06-11 06:03:35,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:03:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:03:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 803 transitions. [2021-06-11 06:03:35,836 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.807035175879397 [2021-06-11 06:03:35,836 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 803 transitions. [2021-06-11 06:03:35,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 803 transitions. [2021-06-11 06:03:35,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:03:35,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 803 transitions. [2021-06-11 06:03:35,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.6) internal successors, (803), 5 states have internal predecessors, (803), 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-06-11 06:03:35,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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-06-11 06:03:35,840 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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-06-11 06:03:35,840 INFO L185 Difference]: Start difference. First operand has 31 places, 20 transitions, 58 flow. Second operand 5 states and 803 transitions. [2021-06-11 06:03:35,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 110 flow [2021-06-11 06:03:35,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:03:35,841 INFO L241 Difference]: Finished difference. Result has 36 places, 23 transitions, 90 flow [2021-06-11 06:03:35,841 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=23} [2021-06-11 06:03:35,841 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2021-06-11 06:03:35,841 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:03:35,841 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 90 flow [2021-06-11 06:03:35,842 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 90 flow [2021-06-11 06:03:35,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 23 transitions, 90 flow [2021-06-11 06:03:35,847 INFO L129 PetriNetUnfolder]: 23/63 cut-off events. [2021-06-11 06:03:35,847 INFO L130 PetriNetUnfolder]: For 35/40 co-relation queries the response was YES. [2021-06-11 06:03:35,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 63 events. 23/63 cut-off events. For 35/40 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 203 event pairs, 11 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 158. Up to 38 conditions per place. [2021-06-11 06:03:35,847 INFO L151 LiptonReduction]: Number of co-enabled transitions 196 [2021-06-11 06:03:35,849 INFO L163 LiptonReduction]: Checked pairs total: 162 [2021-06-11 06:03:35,849 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:03:35,849 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-06-11 06:03:35,849 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 90 flow [2021-06-11 06:03:35,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 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-06-11 06:03:35,850 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:03:35,850 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:03:35,850 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 06:03:35,850 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:03:35,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:03:35,850 INFO L82 PathProgramCache]: Analyzing trace with hash -136100745, now seen corresponding path program 1 times [2021-06-11 06:03:35,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:03:35,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691030403] [2021-06-11 06:03:35,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:03:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:03:35,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:35,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:03:35,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:35,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:03:35,938 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 06:03:35,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:03:35,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:35,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:03:35,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691030403] [2021-06-11 06:03:35,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:03:35,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:03:35,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878051605] [2021-06-11 06:03:35,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:03:35,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:03:35,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:03:35,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:03:35,949 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 199 [2021-06-11 06:03:35,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 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-06-11 06:03:35,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:03:35,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 199 [2021-06-11 06:03:35,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:03:35,981 INFO L129 PetriNetUnfolder]: 16/56 cut-off events. [2021-06-11 06:03:35,981 INFO L130 PetriNetUnfolder]: For 52/91 co-relation queries the response was YES. [2021-06-11 06:03:35,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 56 events. 16/56 cut-off events. For 52/91 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 148 event pairs, 2 based on Foata normal form. 14/68 useless extension candidates. Maximal degree in co-relation 175. Up to 35 conditions per place. [2021-06-11 06:03:35,982 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 5 selfloop transitions, 7 changer transitions 7/33 dead transitions. [2021-06-11 06:03:35,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 186 flow [2021-06-11 06:03:35,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 06:03:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 06:03:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 963 transitions. [2021-06-11 06:03:35,984 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8065326633165829 [2021-06-11 06:03:35,984 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 963 transitions. [2021-06-11 06:03:35,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 963 transitions. [2021-06-11 06:03:35,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:03:35,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 963 transitions. [2021-06-11 06:03:35,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 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-06-11 06:03:35,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 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-06-11 06:03:35,988 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 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-06-11 06:03:35,988 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 90 flow. Second operand 6 states and 963 transitions. [2021-06-11 06:03:35,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 186 flow [2021-06-11 06:03:35,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 180 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 06:03:35,989 INFO L241 Difference]: Finished difference. Result has 40 places, 26 transitions, 140 flow [2021-06-11 06:03:35,990 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2021-06-11 06:03:35,990 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2021-06-11 06:03:35,990 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:03:35,990 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 26 transitions, 140 flow [2021-06-11 06:03:35,990 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 26 transitions, 140 flow [2021-06-11 06:03:35,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 140 flow [2021-06-11 06:03:35,994 INFO L129 PetriNetUnfolder]: 11/44 cut-off events. [2021-06-11 06:03:35,994 INFO L130 PetriNetUnfolder]: For 72/78 co-relation queries the response was YES. [2021-06-11 06:03:35,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 44 events. 11/44 cut-off events. For 72/78 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 99 event pairs, 2 based on Foata normal form. 3/46 useless extension candidates. Maximal degree in co-relation 142. Up to 23 conditions per place. [2021-06-11 06:03:35,995 INFO L151 LiptonReduction]: Number of co-enabled transitions 196 [2021-06-11 06:03:35,996 INFO L163 LiptonReduction]: Checked pairs total: 205 [2021-06-11 06:03:35,996 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:03:35,996 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-06-11 06:03:35,997 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 140 flow [2021-06-11 06:03:35,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 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-06-11 06:03:35,997 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:03:35,997 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:03:35,997 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 06:03:35,997 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:03:35,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:03:35,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1947550455, now seen corresponding path program 1 times [2021-06-11 06:03:35,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:03:35,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889902811] [2021-06-11 06:03:35,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:03:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:03:36,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:36,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:36,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:36,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:03:36,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:36,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:03:36,051 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 06:03:36,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 06:03:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:03:36,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889902811] [2021-06-11 06:03:36,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:03:36,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:03:36,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666243036] [2021-06-11 06:03:36,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:03:36,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:03:36,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:03:36,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:03:36,061 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 199 [2021-06-11 06:03:36,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 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-06-11 06:03:36,062 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:03:36,062 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 199 [2021-06-11 06:03:36,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:03:36,102 INFO L129 PetriNetUnfolder]: 46/145 cut-off events. [2021-06-11 06:03:36,102 INFO L130 PetriNetUnfolder]: For 240/250 co-relation queries the response was YES. [2021-06-11 06:03:36,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 145 events. 46/145 cut-off events. For 240/250 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 629 event pairs, 7 based on Foata normal form. 15/157 useless extension candidates. Maximal degree in co-relation 487. Up to 72 conditions per place. [2021-06-11 06:03:36,103 INFO L132 encePairwiseOnDemand]: 194/199 looper letters, 10 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2021-06-11 06:03:36,103 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 194 flow [2021-06-11 06:03:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:03:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:03:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 757 transitions. [2021-06-11 06:03:36,105 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7608040201005025 [2021-06-11 06:03:36,105 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 757 transitions. [2021-06-11 06:03:36,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 757 transitions. [2021-06-11 06:03:36,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:03:36,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 757 transitions. [2021-06-11 06:03:36,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 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-06-11 06:03:36,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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-06-11 06:03:36,108 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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-06-11 06:03:36,108 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 140 flow. Second operand 5 states and 757 transitions. [2021-06-11 06:03:36,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 194 flow [2021-06-11 06:03:36,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 164 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-06-11 06:03:36,110 INFO L241 Difference]: Finished difference. Result has 40 places, 30 transitions, 143 flow [2021-06-11 06:03:36,110 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=5, PETRI_FLOW=143, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2021-06-11 06:03:36,110 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2021-06-11 06:03:36,110 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:03:36,110 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 143 flow [2021-06-11 06:03:36,110 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 143 flow [2021-06-11 06:03:36,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 143 flow [2021-06-11 06:03:36,118 INFO L129 PetriNetUnfolder]: 26/95 cut-off events. [2021-06-11 06:03:36,118 INFO L130 PetriNetUnfolder]: For 90/96 co-relation queries the response was YES. [2021-06-11 06:03:36,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 95 events. 26/95 cut-off events. For 90/96 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 346 event pairs, 4 based on Foata normal form. 5/97 useless extension candidates. Maximal degree in co-relation 255. Up to 46 conditions per place. [2021-06-11 06:03:36,118 INFO L151 LiptonReduction]: Number of co-enabled transitions 214 [2021-06-11 06:03:36,156 INFO L163 LiptonReduction]: Checked pairs total: 186 [2021-06-11 06:03:36,157 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:03:36,157 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 47 [2021-06-11 06:03:36,157 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 143 flow [2021-06-11 06:03:36,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 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-06-11 06:03:36,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:03:36,158 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:03:36,158 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 06:03:36,158 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:03:36,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:03:36,158 INFO L82 PathProgramCache]: Analyzing trace with hash -365859871, now seen corresponding path program 2 times [2021-06-11 06:03:36,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:03:36,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456867515] [2021-06-11 06:03:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:03:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:03:36,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:36,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:03:36,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:36,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:03:36,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:36,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:03:36,228 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 06:03:36,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:03:36,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:36,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:03:36,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456867515] [2021-06-11 06:03:36,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:03:36,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 06:03:36,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138389086] [2021-06-11 06:03:36,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 06:03:36,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:03:36,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 06:03:36,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 06:03:36,236 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 199 [2021-06-11 06:03:36,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 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-06-11 06:03:36,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:03:36,237 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 199 [2021-06-11 06:03:36,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:03:36,273 INFO L129 PetriNetUnfolder]: 16/67 cut-off events. [2021-06-11 06:03:36,273 INFO L130 PetriNetUnfolder]: For 85/131 co-relation queries the response was YES. [2021-06-11 06:03:36,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 67 events. 16/67 cut-off events. For 85/131 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 26/90 useless extension candidates. Maximal degree in co-relation 211. Up to 33 conditions per place. [2021-06-11 06:03:36,273 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 2 selfloop transitions, 10 changer transitions 6/34 dead transitions. [2021-06-11 06:03:36,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 205 flow [2021-06-11 06:03:36,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 06:03:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 06:03:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1117 transitions. [2021-06-11 06:03:36,275 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8018664752333095 [2021-06-11 06:03:36,276 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1117 transitions. [2021-06-11 06:03:36,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1117 transitions. [2021-06-11 06:03:36,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:03:36,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1117 transitions. [2021-06-11 06:03:36,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.57142857142858) internal successors, (1117), 7 states have internal predecessors, (1117), 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-06-11 06:03:36,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 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-06-11 06:03:36,279 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 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-06-11 06:03:36,279 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 143 flow. Second operand 7 states and 1117 transitions. [2021-06-11 06:03:36,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 205 flow [2021-06-11 06:03:36,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 183 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-06-11 06:03:36,281 INFO L241 Difference]: Finished difference. Result has 47 places, 28 transitions, 149 flow [2021-06-11 06:03:36,281 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2021-06-11 06:03:36,281 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2021-06-11 06:03:36,281 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:03:36,281 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 28 transitions, 149 flow [2021-06-11 06:03:36,282 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 28 transitions, 149 flow [2021-06-11 06:03:36,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 28 transitions, 149 flow [2021-06-11 06:03:36,287 INFO L129 PetriNetUnfolder]: 8/42 cut-off events. [2021-06-11 06:03:36,287 INFO L130 PetriNetUnfolder]: For 44/47 co-relation queries the response was YES. [2021-06-11 06:03:36,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 42 events. 8/42 cut-off events. For 44/47 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 86 event pairs, 0 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 115. Up to 15 conditions per place. [2021-06-11 06:03:36,288 INFO L151 LiptonReduction]: Number of co-enabled transitions 136 [2021-06-11 06:03:36,957 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 182 [2021-06-11 06:03:37,226 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-06-11 06:03:38,531 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 306 DAG size of output: 262 [2021-06-11 06:03:39,066 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 259 [2021-06-11 06:03:39,081 INFO L142 QuantifierPusher]: treesize reduction 84, result has 90.8 percent of original size [2021-06-11 06:03:39,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:39,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 06:03:39,090 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:39,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 06:03:39,094 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:39,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 06:03:39,097 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:39,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,100 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 06:03:39,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:39,102 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 06:03:39,102 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 06:03:39,102 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:39,103 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,103 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 06:03:39,104 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:39,104 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,105 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 06:03:39,105 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:39,105 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,108 INFO L147 QuantifierPusher]: treesize reduction 185, result has 40.1 percent of original size 124 [2021-06-11 06:03:39,108 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:39,110 INFO L142 QuantifierPusher]: treesize reduction 185, result has 55.3 percent of original size [2021-06-11 06:03:39,111 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 4, 3, 2, 1] term [2021-06-11 06:03:39,111 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:39,111 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,112 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 2, 1] term [2021-06-11 06:03:39,112 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:39,113 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,113 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 2, 1] term [2021-06-11 06:03:39,113 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:39,114 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,124 INFO L147 QuantifierPusher]: treesize reduction 378, result has 29.3 percent of original size 157 [2021-06-11 06:03:39,125 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 06:03:39,125 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:39,127 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,128 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 06:03:39,128 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:39,129 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,129 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 06:03:39,129 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:39,131 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:39,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 06:03:39,140 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:39,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:39,141 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:39,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,143 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 06:03:39,149 INFO L147 QuantifierPusher]: treesize reduction 1561, result has 18.1 percent of original size 344 [2021-06-11 06:03:39,267 INFO L163 LiptonReduction]: Checked pairs total: 236 [2021-06-11 06:03:39,268 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 06:03:39,268 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2987 [2021-06-11 06:03:39,268 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 147 flow [2021-06-11 06:03:39,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 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-06-11 06:03:39,268 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:03:39,268 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:03:39,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 06:03:39,269 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:03:39,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:03:39,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2030944711, now seen corresponding path program 1 times [2021-06-11 06:03:39,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:03:39,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058501753] [2021-06-11 06:03:39,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:03:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:03:39,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:39,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:03:39,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:39,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:03:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:03:39,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058501753] [2021-06-11 06:03:39,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:03:39,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:03:39,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468000970] [2021-06-11 06:03:39,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:03:39,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:03:39,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:03:39,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:03:39,333 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 200 [2021-06-11 06:03:39,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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-06-11 06:03:39,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:03:39,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 200 [2021-06-11 06:03:39,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:03:39,350 INFO L129 PetriNetUnfolder]: 13/58 cut-off events. [2021-06-11 06:03:39,351 INFO L130 PetriNetUnfolder]: For 76/84 co-relation queries the response was YES. [2021-06-11 06:03:39,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 58 events. 13/58 cut-off events. For 76/84 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 149 event pairs, 0 based on Foata normal form. 2/58 useless extension candidates. Maximal degree in co-relation 174. Up to 25 conditions per place. [2021-06-11 06:03:39,351 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 3 selfloop transitions, 1 changer transitions 3/28 dead transitions. [2021-06-11 06:03:39,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 28 transitions, 159 flow [2021-06-11 06:03:39,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:03:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:03:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 658 transitions. [2021-06-11 06:03:39,352 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8225 [2021-06-11 06:03:39,352 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 658 transitions. [2021-06-11 06:03:39,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 658 transitions. [2021-06-11 06:03:39,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:03:39,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 658 transitions. [2021-06-11 06:03:39,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.5) internal successors, (658), 4 states have internal predecessors, (658), 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-06-11 06:03:39,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 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-06-11 06:03:39,355 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 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-06-11 06:03:39,355 INFO L185 Difference]: Start difference. First operand has 43 places, 27 transitions, 147 flow. Second operand 4 states and 658 transitions. [2021-06-11 06:03:39,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 28 transitions, 159 flow [2021-06-11 06:03:39,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 125 flow, removed 10 selfloop flow, removed 7 redundant places. [2021-06-11 06:03:39,357 INFO L241 Difference]: Finished difference. Result has 41 places, 25 transitions, 111 flow [2021-06-11 06:03:39,357 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2021-06-11 06:03:39,357 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2021-06-11 06:03:39,357 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:03:39,357 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 25 transitions, 111 flow [2021-06-11 06:03:39,357 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 25 transitions, 111 flow [2021-06-11 06:03:39,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 25 transitions, 111 flow [2021-06-11 06:03:39,388 INFO L129 PetriNetUnfolder]: 7/39 cut-off events. [2021-06-11 06:03:39,389 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-11 06:03:39,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 39 events. 7/39 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 76 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 94. Up to 12 conditions per place. [2021-06-11 06:03:39,389 INFO L151 LiptonReduction]: Number of co-enabled transitions 50 [2021-06-11 06:03:39,814 WARN L205 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 161 [2021-06-11 06:03:39,921 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-06-11 06:03:40,790 WARN L205 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 226 [2021-06-11 06:03:41,082 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-06-11 06:03:41,106 INFO L142 QuantifierPusher]: treesize reduction 84, result has 90.8 percent of original size [2021-06-11 06:03:41,119 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:41,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 06:03:41,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:41,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:41,129 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:41,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,133 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 06:03:41,135 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:41,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 06:03:41,139 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:41,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 06:03:41,143 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:41,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 06:03:41,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:41,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,151 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 06:03:41,152 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:41,153 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 06:03:41,153 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 06:03:41,154 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:41,155 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,155 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 06:03:41,156 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:41,156 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,157 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 06:03:41,157 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:41,160 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,163 INFO L147 QuantifierPusher]: treesize reduction 185, result has 40.1 percent of original size 124 [2021-06-11 06:03:41,163 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:41,164 INFO L142 QuantifierPusher]: treesize reduction 185, result has 55.3 percent of original size [2021-06-11 06:03:41,170 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 4, 3, 2, 1] term [2021-06-11 06:03:41,170 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:41,171 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,172 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 2, 1] term [2021-06-11 06:03:41,172 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:41,173 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,173 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 2, 1] term [2021-06-11 06:03:41,174 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:41,174 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,177 INFO L147 QuantifierPusher]: treesize reduction 341, result has 36.3 percent of original size 194 [2021-06-11 06:03:41,178 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 06:03:41,178 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:41,178 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,179 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 06:03:41,179 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:41,180 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,181 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 06:03:41,181 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:41,181 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,186 INFO L147 QuantifierPusher]: treesize reduction 1551, result has 15.3 percent of original size 280 [2021-06-11 06:03:41,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:41,495 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-11 06:03:41,636 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-06-11 06:03:41,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 06:03:41,648 INFO L163 LiptonReduction]: Checked pairs total: 94 [2021-06-11 06:03:41,648 INFO L165 LiptonReduction]: Total number of compositions: 3 [2021-06-11 06:03:41,648 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2291 [2021-06-11 06:03:41,648 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 105 flow [2021-06-11 06:03:41,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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-06-11 06:03:41,649 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:03:41,649 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-06-11 06:03:41,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 06:03:41,649 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:03:41,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:03:41,649 INFO L82 PathProgramCache]: Analyzing trace with hash 411518612, now seen corresponding path program 1 times [2021-06-11 06:03:41,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:03:41,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213803557] [2021-06-11 06:03:41,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:03:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:03:41,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:03:41,711 INFO L142 QuantifierPusher]: treesize reduction 10, result has 86.1 percent of original size [2021-06-11 06:03:41,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-06-11 06:03:41,745 INFO L142 QuantifierPusher]: treesize reduction 76, result has 73.6 percent of original size [2021-06-11 06:03:41,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 212 [2021-06-11 06:03:41,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 06:03:41,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:41,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 06:03:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:03:41,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213803557] [2021-06-11 06:03:41,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:03:41,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 06:03:41,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592488712] [2021-06-11 06:03:41,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 06:03:41,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:03:41,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 06:03:41,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-11 06:03:41,881 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 203 [2021-06-11 06:03:41,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 105 flow. Second operand has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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-06-11 06:03:41,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:03:41,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 203 [2021-06-11 06:03:41,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:03:41,953 INFO L129 PetriNetUnfolder]: 13/55 cut-off events. [2021-06-11 06:03:41,953 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2021-06-11 06:03:41,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 55 events. 13/55 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 170 event pairs, 0 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 152. Up to 21 conditions per place. [2021-06-11 06:03:41,954 INFO L132 encePairwiseOnDemand]: 198/203 looper letters, 1 selfloop transitions, 4 changer transitions 1/23 dead transitions. [2021-06-11 06:03:41,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 23 transitions, 121 flow [2021-06-11 06:03:41,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 06:03:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 06:03:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 823 transitions. [2021-06-11 06:03:41,956 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6756978653530378 [2021-06-11 06:03:41,956 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 823 transitions. [2021-06-11 06:03:41,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 823 transitions. [2021-06-11 06:03:41,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:03:41,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 823 transitions. [2021-06-11 06:03:41,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 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-06-11 06:03:41,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 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-06-11 06:03:41,959 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 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-06-11 06:03:41,959 INFO L185 Difference]: Start difference. First operand has 37 places, 22 transitions, 105 flow. Second operand 6 states and 823 transitions. [2021-06-11 06:03:41,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 23 transitions, 121 flow [2021-06-11 06:03:41,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 23 transitions, 114 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-06-11 06:03:41,961 INFO L241 Difference]: Finished difference. Result has 39 places, 22 transitions, 110 flow [2021-06-11 06:03:41,961 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2021-06-11 06:03:41,961 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2021-06-11 06:03:41,961 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:03:41,961 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 22 transitions, 110 flow [2021-06-11 06:03:41,961 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 22 transitions, 110 flow [2021-06-11 06:03:41,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 22 transitions, 110 flow [2021-06-11 06:03:41,965 INFO L129 PetriNetUnfolder]: 8/41 cut-off events. [2021-06-11 06:03:41,965 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-06-11 06:03:41,965 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 41 events. 8/41 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 103 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 107. Up to 14 conditions per place. [2021-06-11 06:03:41,965 INFO L151 LiptonReduction]: Number of co-enabled transitions 18 [2021-06-11 06:03:42,102 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-06-11 06:03:42,457 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-06-11 06:03:42,568 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-11 06:03:42,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:42,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:42,774 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-06-11 06:03:43,119 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2021-06-11 06:03:43,246 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-06-11 06:03:43,406 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-06-11 06:03:43,765 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-06-11 06:03:43,872 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-06-11 06:03:43,874 INFO L163 LiptonReduction]: Checked pairs total: 15 [2021-06-11 06:03:43,874 INFO L165 LiptonReduction]: Total number of compositions: 3 [2021-06-11 06:03:43,875 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1914 [2021-06-11 06:03:43,875 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 114 flow [2021-06-11 06:03:43,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 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-06-11 06:03:43,875 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:03:43,875 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:03:43,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-11 06:03:43,875 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:03:43,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:03:43,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1326521937, now seen corresponding path program 1 times [2021-06-11 06:03:43,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:03:43,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221596335] [2021-06-11 06:03:43,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:03:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:03:43,897 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:03:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:03:43,923 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:03:43,942 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 06:03:43,942 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 06:03:43,942 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-11 06:03:43,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 06:03:43 BasicIcfg [2021-06-11 06:03:43,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 06:03:43,987 INFO L168 Benchmark]: Toolchain (without parser) took 16279.26 ms. Allocated memory was 375.4 MB in the beginning and 690.0 MB in the end (delta: 314.6 MB). Free memory was 338.6 MB in the beginning and 405.5 MB in the end (delta: -66.9 MB). Peak memory consumption was 249.2 MB. Max. memory is 16.0 GB. [2021-06-11 06:03:43,987 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 375.4 MB. Free memory was 356.6 MB in the beginning and 356.5 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 06:03:43,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.17 ms. Allocated memory is still 375.4 MB. Free memory was 338.4 MB in the beginning and 337.3 MB in the end (delta: 1.0 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.0 GB. [2021-06-11 06:03:43,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.15 ms. Allocated memory is still 375.4 MB. Free memory was 336.3 MB in the beginning and 334.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:03:43,988 INFO L168 Benchmark]: Boogie Preprocessor took 20.99 ms. Allocated memory is still 375.4 MB. Free memory was 334.2 MB in the beginning and 331.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 06:03:43,988 INFO L168 Benchmark]: RCFGBuilder took 1560.96 ms. Allocated memory is still 375.4 MB. Free memory was 331.0 MB in the beginning and 231.7 MB in the end (delta: 99.3 MB). Peak memory consumption was 157.3 MB. Max. memory is 16.0 GB. [2021-06-11 06:03:43,988 INFO L168 Benchmark]: TraceAbstraction took 14242.41 ms. Allocated memory was 375.4 MB in the beginning and 690.0 MB in the end (delta: 314.6 MB). Free memory was 231.7 MB in the beginning and 405.5 MB in the end (delta: -173.8 MB). Peak memory consumption was 139.8 MB. Max. memory is 16.0 GB. [2021-06-11 06:03:43,997 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.10 ms. Allocated memory is still 375.4 MB. Free memory was 356.6 MB in the beginning and 356.5 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 385.17 ms. Allocated memory is still 375.4 MB. Free memory was 338.4 MB in the beginning and 337.3 MB in the end (delta: 1.0 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 64.15 ms. Allocated memory is still 375.4 MB. Free memory was 336.3 MB in the beginning and 334.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 20.99 ms. Allocated memory is still 375.4 MB. Free memory was 334.2 MB in the beginning and 331.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1560.96 ms. Allocated memory is still 375.4 MB. Free memory was 331.0 MB in the beginning and 231.7 MB in the end (delta: 99.3 MB). Peak memory consumption was 157.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 14242.41 ms. Allocated memory was 375.4 MB in the beginning and 690.0 MB in the end (delta: 314.6 MB). Free memory was 231.7 MB in the beginning and 405.5 MB in the end (delta: -173.8 MB). Peak memory consumption was 139.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5199.8ms, 108 PlacesBefore, 35 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1750 CoEnabledTransitionPairs, 8 FixpointIterations, 40 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 5038 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2234, positive: 2067, positive conditional: 0, positive unconditional: 2067, negative: 167, negative conditional: 0, negative unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1263, positive: 1211, positive conditional: 0, positive unconditional: 1211, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1263, positive: 1211, positive conditional: 0, positive unconditional: 1211, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1263, positive: 1202, positive conditional: 0, positive unconditional: 1202, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 539, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 512, negative conditional: 0, negative unconditional: 512, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2234, positive: 856, positive conditional: 0, positive unconditional: 856, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 1263, unknown conditional: 0, unknown unconditional: 1263] , Statistics on independence cache: Total cache size (in pairs): 2264, Positive cache size: 2212, Positive conditional cache size: 0, Positive unconditional cache size: 2212, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.4ms, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 306 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 127, positive: 105, positive conditional: 0, positive unconditional: 105, 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: 17, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 127, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 2281, Positive cache size: 2226, Positive conditional cache size: 0, Positive unconditional cache size: 2226, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 118.0ms, 33 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 421 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 186, positive: 151, positive conditional: 0, positive unconditional: 151, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 81, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 186, positive: 140, positive conditional: 0, positive unconditional: 140, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 2360, Positive cache size: 2299, Positive conditional cache size: 0, Positive unconditional cache size: 2299, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6ms, 31 PlacesBefore, 31 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 171 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 2366, Positive cache size: 2303, Positive conditional cache size: 0, Positive unconditional cache size: 2303, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1ms, 36 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 162 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 90, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 12, negative conditional: 0, negative unconditional: 12, 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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 2373, Positive cache size: 2310, Positive conditional cache size: 0, Positive unconditional cache size: 2310, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1ms, 40 PlacesBefore, 38 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 205 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2375, Positive cache size: 2312, Positive conditional cache size: 0, Positive unconditional cache size: 2312, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.1ms, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 186 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 113, positive: 100, positive conditional: 0, positive unconditional: 100, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, positive: 100, positive conditional: 0, positive unconditional: 100, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2376, Positive cache size: 2312, Positive conditional cache size: 0, Positive unconditional cache size: 2312, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2985.9ms, 47 PlacesBefore, 43 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 149, positive: 125, positive conditional: 0, positive unconditional: 125, 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: 12, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 187, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 187, negative conditional: 0, negative unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 149, positive: 120, positive conditional: 0, positive unconditional: 120, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 2439, Positive cache size: 2368, Positive conditional cache size: 0, Positive unconditional cache size: 2368, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2290.6ms, 41 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 22 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 94 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 73, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 73, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2586, Positive cache size: 2515, Positive conditional cache size: 0, Positive unconditional cache size: 2515, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1913.3ms, 39 PlacesBefore, 37 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 18 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 15 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2775, Positive cache size: 2704, Positive conditional cache size: 0, Positive unconditional cache size: 2704, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - 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; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t272; [L854] FCALL, FORK 0 pthread_create(&t272, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t273; [L856] FCALL, FORK 0 pthread_create(&t273, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t274; [L858] FCALL, FORK 0 pthread_create(&t274, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L831] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L864] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 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=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 14071.2ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 423.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5276.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 43 SDtfs, 23 SDslu, 26 SDs, 0 SdLazy, 150 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 125.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 252.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=7, InterpolantAutomatonStates: 42, 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: 21.2ms SsaConstructionTime, 243.5ms SatisfiabilityAnalysisTime, 541.0ms InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 795 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...