/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-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix004.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:39:48,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:39:48,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:39:48,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:39:48,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:39:48,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:39:48,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:39:48,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:39:48,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:39:48,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:39:48,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:39:48,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:39:48,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:39:48,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:39:48,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:39:48,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:39:48,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:39:48,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:39:48,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:39:48,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:39:48,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:39:48,816 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:39:48,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:39:48,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:39:48,822 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:39:48,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:39:48,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:39:48,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:39:48,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:39:48,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:39:48,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:39:48,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:39:48,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:39:48,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:39:48,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:39:48,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:39:48,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:39:48,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:39:48,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:39:48,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:39:48,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:39:48,829 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-NoLbe-Before.epf [2022-01-19 04:39:48,850 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:39:48,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:39:48,851 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:39:48,851 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:39:48,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:39:48,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:39:48,851 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:39:48,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:39:48,852 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:39:48,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:39:48,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:39:48,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:39:48,852 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:39:48,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:39:48,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:39:48,853 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:39:48,853 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:39:48,853 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:39:48,853 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:39:48,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:39:48,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:39:48,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:39:48,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:39:48,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:39:48,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:39:48,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:39:48,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:39:48,854 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:39:48,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:39:48,854 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:39:48,854 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:39:48,854 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:39:48,854 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-01-19 04:39:48,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:39:49,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:39:49,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:39:49,010 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:39:49,010 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:39:49,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004.opt.i [2022-01-19 04:39:49,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e9047b8/f5a65f4c0e714fbba53fcae82c200bfe/FLAG41bd52df5 [2022-01-19 04:39:49,451 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:39:49,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004.opt.i [2022-01-19 04:39:49,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e9047b8/f5a65f4c0e714fbba53fcae82c200bfe/FLAG41bd52df5 [2022-01-19 04:39:49,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e9047b8/f5a65f4c0e714fbba53fcae82c200bfe [2022-01-19 04:39:49,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:39:49,471 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:39:49,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:39:49,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:39:49,474 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:39:49,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:39:49" (1/1) ... [2022-01-19 04:39:49,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345ab378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:49, skipping insertion in model container [2022-01-19 04:39:49,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:39:49" (1/1) ... [2022-01-19 04:39:49,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:39:49,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:39:49,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004.opt.i[944,957] [2022-01-19 04:39:49,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:39:49,813 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:39:49,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004.opt.i[944,957] [2022-01-19 04:39:49,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:39:49,881 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:39:49,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:49 WrapperNode [2022-01-19 04:39:49,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:39:49,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:39:49,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:39:49,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:39:49,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:49" (1/1) ... [2022-01-19 04:39:49,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:49" (1/1) ... [2022-01-19 04:39:49,920 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 297 [2022-01-19 04:39:49,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:39:49,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:39:49,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:39:49,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:39:49,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:49" (1/1) ... [2022-01-19 04:39:49,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:49" (1/1) ... [2022-01-19 04:39:49,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:49" (1/1) ... [2022-01-19 04:39:49,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:49" (1/1) ... [2022-01-19 04:39:49,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:49" (1/1) ... [2022-01-19 04:39:49,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:49" (1/1) ... [2022-01-19 04:39:49,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:49" (1/1) ... [2022-01-19 04:39:49,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:39:49,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:39:49,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:39:49,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:39:49,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:49" (1/1) ... [2022-01-19 04:39:49,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:39:49,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:39:49,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 04:39:49,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 04:39:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:39:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:39:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:39:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:39:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:39:49,999 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 04:39:50,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 04:39:50,000 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 04:39:50,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 04:39:50,000 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 04:39:50,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 04:39:50,000 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-19 04:39:50,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-19 04:39:50,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:39:50,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:39:50,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:39:50,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:39:50,001 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 04:39:50,102 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:39:50,103 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:39:50,481 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:39:50,723 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:39:50,724 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 04:39:50,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:39:50 BoogieIcfgContainer [2022-01-19 04:39:50,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:39:50,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:39:50,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:39:50,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:39:50,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:39:49" (1/3) ... [2022-01-19 04:39:50,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba57ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:39:50, skipping insertion in model container [2022-01-19 04:39:50,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:49" (2/3) ... [2022-01-19 04:39:50,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba57ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:39:50, skipping insertion in model container [2022-01-19 04:39:50,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:39:50" (3/3) ... [2022-01-19 04:39:50,731 INFO L111 eAbstractionObserver]: Analyzing ICFG mix004.opt.i [2022-01-19 04:39:50,735 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:39:50,735 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 04:39:50,736 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:39:50,777 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,777 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,777 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,777 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,778 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,778 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,778 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,778 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,778 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,778 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,779 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,779 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,779 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,779 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,779 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,779 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,780 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,780 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,780 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,780 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,780 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,780 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,781 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,781 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,781 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,781 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,782 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,782 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,782 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,782 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,782 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,782 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,782 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,782 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,783 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,783 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,783 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,783 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,783 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,783 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,783 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,783 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,783 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,783 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,783 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,783 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,783 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,784 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,784 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,784 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,784 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,784 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,784 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,784 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,784 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,784 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,784 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,786 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,787 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,787 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,787 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,788 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,788 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,788 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,788 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,788 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,788 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,788 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,788 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,788 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,788 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,789 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,789 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,789 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,789 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,789 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,790 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,791 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,794 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,795 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,796 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,798 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,798 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,799 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,799 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,799 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,799 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,799 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,799 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,799 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,799 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,799 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,799 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,800 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,800 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,800 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,800 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,800 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,800 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,800 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,800 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,801 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,802 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,803 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,804 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,804 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,804 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,804 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,804 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,804 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,804 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,804 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,804 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,804 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,804 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,804 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,806 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,806 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,806 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,806 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,806 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,806 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,806 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,807 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,808 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,810 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,810 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,810 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,810 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,810 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,811 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,811 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,811 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,811 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,811 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,811 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,812 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,814 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,815 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,815 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,816 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,816 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,816 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,818 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,818 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,818 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,818 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,818 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,818 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,818 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,818 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,819 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,819 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,819 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,819 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,819 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,823 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,824 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,824 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,825 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,825 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,826 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,826 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,826 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,826 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,826 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,826 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,826 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,827 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,827 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,827 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,827 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,827 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,827 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,827 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,827 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,827 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,827 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,827 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,827 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,827 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,828 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,829 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,829 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,829 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,829 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,829 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,829 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,829 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,829 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,829 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,830 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:50,830 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:39:50,870 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:39:50,878 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 04:39:50,878 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 04:39:50,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2022-01-19 04:39:50,939 INFO L129 PetriNetUnfolder]: 2/134 cut-off events. [2022-01-19 04:39:50,939 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:39:50,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-01-19 04:39:50,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 138 transitions, 296 flow [2022-01-19 04:39:50,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 134 transitions, 280 flow [2022-01-19 04:39:50,972 INFO L129 PetriNetUnfolder]: 0/93 cut-off events. [2022-01-19 04:39:50,972 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:39:50,972 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:50,973 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:50,973 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:39:50,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:50,977 INFO L85 PathProgramCache]: Analyzing trace with hash -587444826, now seen corresponding path program 1 times [2022-01-19 04:39:50,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:50,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146290603] [2022-01-19 04:39:50,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:50,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:51,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:51,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146290603] [2022-01-19 04:39:51,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146290603] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:51,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:51,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 04:39:51,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469080239] [2022-01-19 04:39:51,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:51,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:39:51,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:51,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:39:51,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:39:51,290 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 138 [2022-01-19 04:39:51,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 134 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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) [2022-01-19 04:39:51,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:51,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 138 [2022-01-19 04:39:51,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:51,381 INFO L129 PetriNetUnfolder]: 14/173 cut-off events. [2022-01-19 04:39:51,381 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-01-19 04:39:51,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 173 events. 14/173 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 297 event pairs, 2 based on Foata normal form. 7/171 useless extension candidates. Maximal degree in co-relation 164. Up to 25 conditions per place. [2022-01-19 04:39:51,384 INFO L132 encePairwiseOnDemand]: 133/138 looper letters, 10 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2022-01-19 04:39:51,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 132 transitions, 300 flow [2022-01-19 04:39:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:39:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:39:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-01-19 04:39:51,399 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9396135265700483 [2022-01-19 04:39:51,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2022-01-19 04:39:51,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2022-01-19 04:39:51,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:51,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2022-01-19 04:39:51,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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) [2022-01-19 04:39:51,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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) [2022-01-19 04:39:51,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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) [2022-01-19 04:39:51,412 INFO L186 Difference]: Start difference. First operand has 145 places, 134 transitions, 280 flow. Second operand 3 states and 389 transitions. [2022-01-19 04:39:51,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 132 transitions, 300 flow [2022-01-19 04:39:51,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 132 transitions, 296 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 04:39:51,417 INFO L242 Difference]: Finished difference. Result has 141 places, 130 transitions, 272 flow [2022-01-19 04:39:51,418 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=141, PETRI_TRANSITIONS=130} [2022-01-19 04:39:51,420 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, -4 predicate places. [2022-01-19 04:39:51,421 INFO L470 AbstractCegarLoop]: Abstraction has has 141 places, 130 transitions, 272 flow [2022-01-19 04:39:51,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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) [2022-01-19 04:39:51,421 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:51,421 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:51,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:39:51,424 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:39:51,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash -928006882, now seen corresponding path program 1 times [2022-01-19 04:39:51,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:51,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952908072] [2022-01-19 04:39:51,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:51,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:51,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:51,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952908072] [2022-01-19 04:39:51,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952908072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:51,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:51,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:39:51,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130409729] [2022-01-19 04:39:51,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:51,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:39:51,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:51,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:39:51,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:39:51,694 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 138 [2022-01-19 04:39:51,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 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) [2022-01-19 04:39:51,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:51,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 138 [2022-01-19 04:39:51,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:52,319 INFO L129 PetriNetUnfolder]: 1470/3441 cut-off events. [2022-01-19 04:39:52,319 INFO L130 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-01-19 04:39:52,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5698 conditions, 3441 events. 1470/3441 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 26150 event pairs, 274 based on Foata normal form. 0/3356 useless extension candidates. Maximal degree in co-relation 5634. Up to 952 conditions per place. [2022-01-19 04:39:52,341 INFO L132 encePairwiseOnDemand]: 130/138 looper letters, 26 selfloop transitions, 4 changer transitions 59/180 dead transitions. [2022-01-19 04:39:52,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 180 transitions, 530 flow [2022-01-19 04:39:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:39:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:39:52,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1158 transitions. [2022-01-19 04:39:52,344 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8391304347826087 [2022-01-19 04:39:52,345 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1158 transitions. [2022-01-19 04:39:52,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1158 transitions. [2022-01-19 04:39:52,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:52,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1158 transitions. [2022-01-19 04:39:52,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.8) internal successors, (1158), 10 states have internal predecessors, (1158), 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) [2022-01-19 04:39:52,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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) [2022-01-19 04:39:52,351 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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) [2022-01-19 04:39:52,351 INFO L186 Difference]: Start difference. First operand has 141 places, 130 transitions, 272 flow. Second operand 10 states and 1158 transitions. [2022-01-19 04:39:52,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 180 transitions, 530 flow [2022-01-19 04:39:52,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 180 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:39:52,356 INFO L242 Difference]: Finished difference. Result has 155 places, 116 transitions, 264 flow [2022-01-19 04:39:52,356 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=264, PETRI_PLACES=155, PETRI_TRANSITIONS=116} [2022-01-19 04:39:52,357 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 10 predicate places. [2022-01-19 04:39:52,357 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 116 transitions, 264 flow [2022-01-19 04:39:52,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 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) [2022-01-19 04:39:52,357 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:52,357 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:52,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:39:52,358 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:39:52,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash -734730120, now seen corresponding path program 1 times [2022-01-19 04:39:52,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:52,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137977554] [2022-01-19 04:39:52,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:52,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:52,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:52,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137977554] [2022-01-19 04:39:52,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137977554] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:52,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:52,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 04:39:52,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668073027] [2022-01-19 04:39:52,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:52,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 04:39:52,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:52,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 04:39:52,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 04:39:52,609 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 138 [2022-01-19 04:39:52,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 116 transitions, 264 flow. Second operand has 9 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 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) [2022-01-19 04:39:52,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:52,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 138 [2022-01-19 04:39:52,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:52,993 INFO L129 PetriNetUnfolder]: 842/1631 cut-off events. [2022-01-19 04:39:52,993 INFO L130 PetriNetUnfolder]: For 332/332 co-relation queries the response was YES. [2022-01-19 04:39:52,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3321 conditions, 1631 events. 842/1631 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9135 event pairs, 234 based on Foata normal form. 36/1597 useless extension candidates. Maximal degree in co-relation 3244. Up to 675 conditions per place. [2022-01-19 04:39:53,003 INFO L132 encePairwiseOnDemand]: 128/138 looper letters, 38 selfloop transitions, 8 changer transitions 37/170 dead transitions. [2022-01-19 04:39:53,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 170 transitions, 564 flow [2022-01-19 04:39:53,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 04:39:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 04:39:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1229 transitions. [2022-01-19 04:39:53,005 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8096179183135704 [2022-01-19 04:39:53,005 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1229 transitions. [2022-01-19 04:39:53,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1229 transitions. [2022-01-19 04:39:53,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:53,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1229 transitions. [2022-01-19 04:39:53,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 111.72727272727273) internal successors, (1229), 11 states have internal predecessors, (1229), 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) [2022-01-19 04:39:53,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 138.0) internal successors, (1656), 12 states have internal predecessors, (1656), 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) [2022-01-19 04:39:53,011 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 138.0) internal successors, (1656), 12 states have internal predecessors, (1656), 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) [2022-01-19 04:39:53,011 INFO L186 Difference]: Start difference. First operand has 155 places, 116 transitions, 264 flow. Second operand 11 states and 1229 transitions. [2022-01-19 04:39:53,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 170 transitions, 564 flow [2022-01-19 04:39:53,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 170 transitions, 524 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-01-19 04:39:53,022 INFO L242 Difference]: Finished difference. Result has 145 places, 121 transitions, 303 flow [2022-01-19 04:39:53,022 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=303, PETRI_PLACES=145, PETRI_TRANSITIONS=121} [2022-01-19 04:39:53,024 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 0 predicate places. [2022-01-19 04:39:53,024 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 121 transitions, 303 flow [2022-01-19 04:39:53,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.55555555555556) internal successors, (959), 9 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) [2022-01-19 04:39:53,024 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:53,025 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:53,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:39:53,025 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:39:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:53,025 INFO L85 PathProgramCache]: Analyzing trace with hash -694958401, now seen corresponding path program 1 times [2022-01-19 04:39:53,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:53,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373306709] [2022-01-19 04:39:53,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:53,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:53,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:53,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373306709] [2022-01-19 04:39:53,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373306709] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:53,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:53,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:39:53,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385329080] [2022-01-19 04:39:53,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:53,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:39:53,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:53,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:39:53,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:39:53,157 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-01-19 04:39:53,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 121 transitions, 303 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 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) [2022-01-19 04:39:53,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:53,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-01-19 04:39:53,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:53,655 INFO L129 PetriNetUnfolder]: 1948/3591 cut-off events. [2022-01-19 04:39:53,655 INFO L130 PetriNetUnfolder]: For 712/712 co-relation queries the response was YES. [2022-01-19 04:39:53,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7529 conditions, 3591 events. 1948/3591 cut-off events. For 712/712 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 25132 event pairs, 80 based on Foata normal form. 0/3515 useless extension candidates. Maximal degree in co-relation 7458. Up to 1224 conditions per place. [2022-01-19 04:39:53,677 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 46 selfloop transitions, 8 changer transitions 52/203 dead transitions. [2022-01-19 04:39:53,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 203 transitions, 783 flow [2022-01-19 04:39:53,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:39:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:39:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1221 transitions. [2022-01-19 04:39:53,679 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8847826086956522 [2022-01-19 04:39:53,679 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1221 transitions. [2022-01-19 04:39:53,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1221 transitions. [2022-01-19 04:39:53,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:53,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1221 transitions. [2022-01-19 04:39:53,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.1) internal successors, (1221), 10 states have internal predecessors, (1221), 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) [2022-01-19 04:39:53,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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) [2022-01-19 04:39:53,684 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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) [2022-01-19 04:39:53,684 INFO L186 Difference]: Start difference. First operand has 145 places, 121 transitions, 303 flow. Second operand 10 states and 1221 transitions. [2022-01-19 04:39:53,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 203 transitions, 783 flow [2022-01-19 04:39:53,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 203 transitions, 767 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-01-19 04:39:53,689 INFO L242 Difference]: Finished difference. Result has 147 places, 126 transitions, 361 flow [2022-01-19 04:39:53,689 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=361, PETRI_PLACES=147, PETRI_TRANSITIONS=126} [2022-01-19 04:39:53,690 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 2 predicate places. [2022-01-19 04:39:53,690 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 126 transitions, 361 flow [2022-01-19 04:39:53,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 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) [2022-01-19 04:39:53,690 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:53,690 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:53,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:39:53,691 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:39:53,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2125478232, now seen corresponding path program 1 times [2022-01-19 04:39:53,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:53,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676323292] [2022-01-19 04:39:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:53,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:53,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:53,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676323292] [2022-01-19 04:39:53,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676323292] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:53,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:53,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:39:53,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919471750] [2022-01-19 04:39:53,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:53,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:39:53,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:53,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:39:53,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:39:53,828 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-01-19 04:39:53,828 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 126 transitions, 361 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 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) [2022-01-19 04:39:53,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:53,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-01-19 04:39:53,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:54,295 INFO L129 PetriNetUnfolder]: 1297/2788 cut-off events. [2022-01-19 04:39:54,295 INFO L130 PetriNetUnfolder]: For 4110/4126 co-relation queries the response was YES. [2022-01-19 04:39:54,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8731 conditions, 2788 events. 1297/2788 cut-off events. For 4110/4126 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 20659 event pairs, 20 based on Foata normal form. 65/2848 useless extension candidates. Maximal degree in co-relation 8658. Up to 979 conditions per place. [2022-01-19 04:39:54,315 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 77 selfloop transitions, 22 changer transitions 20/216 dead transitions. [2022-01-19 04:39:54,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 216 transitions, 1092 flow [2022-01-19 04:39:54,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 04:39:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 04:39:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1345 transitions. [2022-01-19 04:39:54,318 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.886034255599473 [2022-01-19 04:39:54,318 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1345 transitions. [2022-01-19 04:39:54,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1345 transitions. [2022-01-19 04:39:54,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:54,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1345 transitions. [2022-01-19 04:39:54,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 122.27272727272727) internal successors, (1345), 11 states have internal predecessors, (1345), 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) [2022-01-19 04:39:54,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 138.0) internal successors, (1656), 12 states have internal predecessors, (1656), 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) [2022-01-19 04:39:54,322 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 138.0) internal successors, (1656), 12 states have internal predecessors, (1656), 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) [2022-01-19 04:39:54,322 INFO L186 Difference]: Start difference. First operand has 147 places, 126 transitions, 361 flow. Second operand 11 states and 1345 transitions. [2022-01-19 04:39:54,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 216 transitions, 1092 flow [2022-01-19 04:39:54,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 216 transitions, 1076 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-01-19 04:39:54,331 INFO L242 Difference]: Finished difference. Result has 155 places, 142 transitions, 570 flow [2022-01-19 04:39:54,331 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=570, PETRI_PLACES=155, PETRI_TRANSITIONS=142} [2022-01-19 04:39:54,331 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 10 predicate places. [2022-01-19 04:39:54,331 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 142 transitions, 570 flow [2022-01-19 04:39:54,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 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) [2022-01-19 04:39:54,332 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:54,332 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:54,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:39:54,332 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:39:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:54,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2090440290, now seen corresponding path program 1 times [2022-01-19 04:39:54,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:54,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886190234] [2022-01-19 04:39:54,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:54,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:54,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:54,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886190234] [2022-01-19 04:39:54,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886190234] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:54,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:54,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:39:54,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749576319] [2022-01-19 04:39:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:54,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:39:54,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:54,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:39:54,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:39:54,428 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-01-19 04:39:54,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 142 transitions, 570 flow. Second operand has 8 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 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) [2022-01-19 04:39:54,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:54,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-01-19 04:39:54,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:54,925 INFO L129 PetriNetUnfolder]: 1201/2637 cut-off events. [2022-01-19 04:39:54,926 INFO L130 PetriNetUnfolder]: For 10154/10154 co-relation queries the response was YES. [2022-01-19 04:39:54,935 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10561 conditions, 2637 events. 1201/2637 cut-off events. For 10154/10154 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 19751 event pairs, 54 based on Foata normal form. 36/2665 useless extension candidates. Maximal degree in co-relation 10483. Up to 919 conditions per place. [2022-01-19 04:39:54,941 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 64 selfloop transitions, 32 changer transitions 52/245 dead transitions. [2022-01-19 04:39:54,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 245 transitions, 1577 flow [2022-01-19 04:39:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 04:39:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 04:39:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1712 transitions. [2022-01-19 04:39:54,944 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8861283643892339 [2022-01-19 04:39:54,944 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1712 transitions. [2022-01-19 04:39:54,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1712 transitions. [2022-01-19 04:39:54,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:54,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1712 transitions. [2022-01-19 04:39:54,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 122.28571428571429) internal successors, (1712), 14 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:54,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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) [2022-01-19 04:39:54,950 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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) [2022-01-19 04:39:54,950 INFO L186 Difference]: Start difference. First operand has 155 places, 142 transitions, 570 flow. Second operand 14 states and 1712 transitions. [2022-01-19 04:39:54,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 245 transitions, 1577 flow [2022-01-19 04:39:54,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 245 transitions, 1500 flow, removed 35 selfloop flow, removed 2 redundant places. [2022-01-19 04:39:54,976 INFO L242 Difference]: Finished difference. Result has 172 places, 156 transitions, 813 flow [2022-01-19 04:39:54,976 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=813, PETRI_PLACES=172, PETRI_TRANSITIONS=156} [2022-01-19 04:39:54,976 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 27 predicate places. [2022-01-19 04:39:54,977 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 156 transitions, 813 flow [2022-01-19 04:39:54,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 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) [2022-01-19 04:39:54,977 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:54,977 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:54,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:39:54,977 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:39:54,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1903104096, now seen corresponding path program 1 times [2022-01-19 04:39:54,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:54,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338716139] [2022-01-19 04:39:54,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:54,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:55,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:55,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338716139] [2022-01-19 04:39:55,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338716139] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:55,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:55,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:39:55,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122087429] [2022-01-19 04:39:55,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:55,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:39:55,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:55,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:39:55,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:39:55,065 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2022-01-19 04:39:55,066 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 156 transitions, 813 flow. Second operand has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 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) [2022-01-19 04:39:55,066 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:55,066 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2022-01-19 04:39:55,066 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:55,374 INFO L129 PetriNetUnfolder]: 492/2316 cut-off events. [2022-01-19 04:39:55,374 INFO L130 PetriNetUnfolder]: For 10432/10635 co-relation queries the response was YES. [2022-01-19 04:39:55,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8289 conditions, 2316 events. 492/2316 cut-off events. For 10432/10635 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 23553 event pairs, 5 based on Foata normal form. 10/2184 useless extension candidates. Maximal degree in co-relation 8203. Up to 639 conditions per place. [2022-01-19 04:39:55,398 INFO L132 encePairwiseOnDemand]: 132/138 looper letters, 42 selfloop transitions, 2 changer transitions 10/189 dead transitions. [2022-01-19 04:39:55,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 189 transitions, 1019 flow [2022-01-19 04:39:55,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:39:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:39:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2022-01-19 04:39:55,401 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8788819875776398 [2022-01-19 04:39:55,401 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 849 transitions. [2022-01-19 04:39:55,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 849 transitions. [2022-01-19 04:39:55,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:55,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 849 transitions. [2022-01-19 04:39:55,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 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) [2022-01-19 04:39:55,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 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) [2022-01-19 04:39:55,404 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 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) [2022-01-19 04:39:55,404 INFO L186 Difference]: Start difference. First operand has 172 places, 156 transitions, 813 flow. Second operand 7 states and 849 transitions. [2022-01-19 04:39:55,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 189 transitions, 1019 flow [2022-01-19 04:39:55,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 189 transitions, 852 flow, removed 72 selfloop flow, removed 6 redundant places. [2022-01-19 04:39:55,483 INFO L242 Difference]: Finished difference. Result has 177 places, 157 transitions, 665 flow [2022-01-19 04:39:55,483 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=665, PETRI_PLACES=177, PETRI_TRANSITIONS=157} [2022-01-19 04:39:55,484 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 32 predicate places. [2022-01-19 04:39:55,484 INFO L470 AbstractCegarLoop]: Abstraction has has 177 places, 157 transitions, 665 flow [2022-01-19 04:39:55,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 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) [2022-01-19 04:39:55,484 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:55,484 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:55,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:39:55,485 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:39:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash -962127814, now seen corresponding path program 2 times [2022-01-19 04:39:55,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:55,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744738576] [2022-01-19 04:39:55,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:55,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:55,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:55,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744738576] [2022-01-19 04:39:55,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744738576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:55,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:55,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 04:39:55,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128916309] [2022-01-19 04:39:55,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:55,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 04:39:55,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:55,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 04:39:55,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-19 04:39:55,629 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-01-19 04:39:55,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 157 transitions, 665 flow. Second operand has 9 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 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) [2022-01-19 04:39:55,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:55,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-01-19 04:39:55,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:56,281 INFO L129 PetriNetUnfolder]: 1525/4048 cut-off events. [2022-01-19 04:39:56,281 INFO L130 PetriNetUnfolder]: For 6190/6243 co-relation queries the response was YES. [2022-01-19 04:39:56,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12132 conditions, 4048 events. 1525/4048 cut-off events. For 6190/6243 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 38357 event pairs, 22 based on Foata normal form. 41/3998 useless extension candidates. Maximal degree in co-relation 12102. Up to 430 conditions per place. [2022-01-19 04:39:56,309 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 59 selfloop transitions, 37 changer transitions 43/237 dead transitions. [2022-01-19 04:39:56,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 237 transitions, 1393 flow [2022-01-19 04:39:56,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 04:39:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 04:39:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2036 transitions. [2022-01-19 04:39:56,312 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8678601875532822 [2022-01-19 04:39:56,312 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2036 transitions. [2022-01-19 04:39:56,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2036 transitions. [2022-01-19 04:39:56,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:56,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2036 transitions. [2022-01-19 04:39:56,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 119.76470588235294) internal successors, (2036), 17 states have internal predecessors, (2036), 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) [2022-01-19 04:39:56,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 138.0) internal successors, (2484), 18 states have internal predecessors, (2484), 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) [2022-01-19 04:39:56,319 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 138.0) internal successors, (2484), 18 states have internal predecessors, (2484), 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) [2022-01-19 04:39:56,319 INFO L186 Difference]: Start difference. First operand has 177 places, 157 transitions, 665 flow. Second operand 17 states and 2036 transitions. [2022-01-19 04:39:56,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 237 transitions, 1393 flow [2022-01-19 04:39:56,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 237 transitions, 1352 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-01-19 04:39:56,360 INFO L242 Difference]: Finished difference. Result has 191 places, 157 transitions, 746 flow [2022-01-19 04:39:56,360 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=746, PETRI_PLACES=191, PETRI_TRANSITIONS=157} [2022-01-19 04:39:56,361 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 46 predicate places. [2022-01-19 04:39:56,361 INFO L470 AbstractCegarLoop]: Abstraction has has 191 places, 157 transitions, 746 flow [2022-01-19 04:39:56,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 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) [2022-01-19 04:39:56,362 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:56,362 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:56,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:39:56,362 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:39:56,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:56,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1063815850, now seen corresponding path program 1 times [2022-01-19 04:39:56,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:56,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199629218] [2022-01-19 04:39:56,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:56,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:56,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:56,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199629218] [2022-01-19 04:39:56,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199629218] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:56,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:56,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:39:56,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217277720] [2022-01-19 04:39:56,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:56,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:39:56,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:56,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:39:56,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:39:56,481 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 138 [2022-01-19 04:39:56,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 157 transitions, 746 flow. Second operand has 7 states, 7 states have (on average 109.85714285714286) internal successors, (769), 7 states have internal predecessors, (769), 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) [2022-01-19 04:39:56,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:56,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 138 [2022-01-19 04:39:56,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:57,025 INFO L129 PetriNetUnfolder]: 1086/5135 cut-off events. [2022-01-19 04:39:57,025 INFO L130 PetriNetUnfolder]: For 12235/13573 co-relation queries the response was YES. [2022-01-19 04:39:57,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15500 conditions, 5135 events. 1086/5135 cut-off events. For 12235/13573 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 65128 event pairs, 52 based on Foata normal form. 1/4762 useless extension candidates. Maximal degree in co-relation 15409. Up to 685 conditions per place. [2022-01-19 04:39:57,065 INFO L132 encePairwiseOnDemand]: 123/138 looper letters, 38 selfloop transitions, 15 changer transitions 5/183 dead transitions. [2022-01-19 04:39:57,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 183 transitions, 955 flow [2022-01-19 04:39:57,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 04:39:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 04:39:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 896 transitions. [2022-01-19 04:39:57,067 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8115942028985508 [2022-01-19 04:39:57,067 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 896 transitions. [2022-01-19 04:39:57,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 896 transitions. [2022-01-19 04:39:57,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:57,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 896 transitions. [2022-01-19 04:39:57,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 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) [2022-01-19 04:39:57,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 138.0) internal successors, (1242), 9 states have internal predecessors, (1242), 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) [2022-01-19 04:39:57,070 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 138.0) internal successors, (1242), 9 states have internal predecessors, (1242), 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) [2022-01-19 04:39:57,070 INFO L186 Difference]: Start difference. First operand has 191 places, 157 transitions, 746 flow. Second operand 8 states and 896 transitions. [2022-01-19 04:39:57,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 183 transitions, 955 flow [2022-01-19 04:39:57,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 183 transitions, 813 flow, removed 31 selfloop flow, removed 17 redundant places. [2022-01-19 04:39:57,299 INFO L242 Difference]: Finished difference. Result has 183 places, 167 transitions, 719 flow [2022-01-19 04:39:57,300 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=719, PETRI_PLACES=183, PETRI_TRANSITIONS=167} [2022-01-19 04:39:57,300 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 38 predicate places. [2022-01-19 04:39:57,300 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 167 transitions, 719 flow [2022-01-19 04:39:57,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.85714285714286) internal successors, (769), 7 states have internal predecessors, (769), 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) [2022-01-19 04:39:57,301 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:57,301 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:57,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 04:39:57,301 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:39:57,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:57,302 INFO L85 PathProgramCache]: Analyzing trace with hash 872235992, now seen corresponding path program 2 times [2022-01-19 04:39:57,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:57,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281117629] [2022-01-19 04:39:57,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:57,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:57,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:57,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281117629] [2022-01-19 04:39:57,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281117629] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:57,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:57,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:39:57,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031000891] [2022-01-19 04:39:57,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:57,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:39:57,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:39:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:39:57,432 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 138 [2022-01-19 04:39:57,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 167 transitions, 719 flow. Second operand has 8 states, 8 states have (on average 109.375) internal successors, (875), 8 states have internal predecessors, (875), 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) [2022-01-19 04:39:57,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:57,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 138 [2022-01-19 04:39:57,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:58,558 INFO L129 PetriNetUnfolder]: 2167/10348 cut-off events. [2022-01-19 04:39:58,559 INFO L130 PetriNetUnfolder]: For 10337/10950 co-relation queries the response was YES. [2022-01-19 04:39:58,603 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25109 conditions, 10348 events. 2167/10348 cut-off events. For 10337/10950 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 150762 event pairs, 48 based on Foata normal form. 2/9670 useless extension candidates. Maximal degree in co-relation 25080. Up to 1305 conditions per place. [2022-01-19 04:39:58,610 INFO L132 encePairwiseOnDemand]: 128/138 looper letters, 32 selfloop transitions, 5 changer transitions 45/207 dead transitions. [2022-01-19 04:39:58,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 207 transitions, 1101 flow [2022-01-19 04:39:58,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 04:39:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 04:39:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 899 transitions. [2022-01-19 04:39:58,613 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8143115942028986 [2022-01-19 04:39:58,613 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 899 transitions. [2022-01-19 04:39:58,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 899 transitions. [2022-01-19 04:39:58,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:58,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 899 transitions. [2022-01-19 04:39:58,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.375) internal successors, (899), 8 states have internal predecessors, (899), 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) [2022-01-19 04:39:58,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 138.0) internal successors, (1242), 9 states have internal predecessors, (1242), 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) [2022-01-19 04:39:58,616 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 138.0) internal successors, (1242), 9 states have internal predecessors, (1242), 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) [2022-01-19 04:39:58,616 INFO L186 Difference]: Start difference. First operand has 183 places, 167 transitions, 719 flow. Second operand 8 states and 899 transitions. [2022-01-19 04:39:58,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 207 transitions, 1101 flow [2022-01-19 04:39:58,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 207 transitions, 1075 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-01-19 04:39:58,919 INFO L242 Difference]: Finished difference. Result has 186 places, 159 transitions, 653 flow [2022-01-19 04:39:58,920 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=653, PETRI_PLACES=186, PETRI_TRANSITIONS=159} [2022-01-19 04:39:58,920 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 41 predicate places. [2022-01-19 04:39:58,920 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 159 transitions, 653 flow [2022-01-19 04:39:58,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.375) internal successors, (875), 8 states have internal predecessors, (875), 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) [2022-01-19 04:39:58,921 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:58,921 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:58,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 04:39:58,921 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:39:58,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1858045030, now seen corresponding path program 3 times [2022-01-19 04:39:58,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:58,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462814035] [2022-01-19 04:39:58,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:58,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:59,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:59,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462814035] [2022-01-19 04:39:59,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462814035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:59,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:59,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 04:39:59,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662687033] [2022-01-19 04:39:59,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:59,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 04:39:59,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:59,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 04:39:59,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-19 04:39:59,193 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 138 [2022-01-19 04:39:59,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 159 transitions, 653 flow. Second operand has 12 states, 12 states have (on average 111.0) internal successors, (1332), 12 states have internal predecessors, (1332), 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) [2022-01-19 04:39:59,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:59,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 138 [2022-01-19 04:39:59,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:59,768 INFO L129 PetriNetUnfolder]: 893/4763 cut-off events. [2022-01-19 04:39:59,768 INFO L130 PetriNetUnfolder]: For 4996/5258 co-relation queries the response was YES. [2022-01-19 04:39:59,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11368 conditions, 4763 events. 893/4763 cut-off events. For 4996/5258 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 61383 event pairs, 12 based on Foata normal form. 1/4459 useless extension candidates. Maximal degree in co-relation 11338. Up to 594 conditions per place. [2022-01-19 04:39:59,798 INFO L132 encePairwiseOnDemand]: 125/138 looper letters, 17 selfloop transitions, 12 changer transitions 15/176 dead transitions. [2022-01-19 04:39:59,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 176 transitions, 815 flow [2022-01-19 04:39:59,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 04:39:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 04:39:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1565 transitions. [2022-01-19 04:39:59,801 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8100414078674948 [2022-01-19 04:39:59,801 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1565 transitions. [2022-01-19 04:39:59,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1565 transitions. [2022-01-19 04:39:59,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:59,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1565 transitions. [2022-01-19 04:39:59,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 111.78571428571429) internal successors, (1565), 14 states have internal predecessors, (1565), 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) [2022-01-19 04:39:59,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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) [2022-01-19 04:39:59,806 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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) [2022-01-19 04:39:59,806 INFO L186 Difference]: Start difference. First operand has 186 places, 159 transitions, 653 flow. Second operand 14 states and 1565 transitions. [2022-01-19 04:39:59,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 176 transitions, 815 flow [2022-01-19 04:39:59,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 176 transitions, 788 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-01-19 04:39:59,891 INFO L242 Difference]: Finished difference. Result has 194 places, 161 transitions, 701 flow [2022-01-19 04:39:59,892 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=701, PETRI_PLACES=194, PETRI_TRANSITIONS=161} [2022-01-19 04:39:59,892 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 49 predicate places. [2022-01-19 04:39:59,892 INFO L470 AbstractCegarLoop]: Abstraction has has 194 places, 161 transitions, 701 flow [2022-01-19 04:39:59,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 111.0) internal successors, (1332), 12 states have internal predecessors, (1332), 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) [2022-01-19 04:39:59,893 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:59,893 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:59,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 04:39:59,893 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 04:39:59,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:59,894 INFO L85 PathProgramCache]: Analyzing trace with hash -523929476, now seen corresponding path program 4 times [2022-01-19 04:39:59,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:59,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124328288] [2022-01-19 04:39:59,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:59,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:39:59,938 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:39:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:40:00,026 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:40:00,026 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:40:00,027 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 04:40:00,028 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 04:40:00,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 04:40:00,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 04:40:00,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-19 04:40:00,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-19 04:40:00,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 04:40:00,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 04:40:00,031 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2022-01-19 04:40:00,035 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:40:00,035 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:40:00,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:40:00 BasicIcfg [2022-01-19 04:40:00,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:40:00,192 INFO L158 Benchmark]: Toolchain (without parser) took 10720.67ms. Allocated memory was 360.7MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 305.3MB in the beginning and 1.2GB in the end (delta: -875.7MB). Peak memory consumption was 199.5MB. Max. memory is 16.0GB. [2022-01-19 04:40:00,193 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 360.7MB. Free memory is still 323.1MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:40:00,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.30ms. Allocated memory was 360.7MB in the beginning and 455.1MB in the end (delta: 94.4MB). Free memory was 305.2MB in the beginning and 413.5MB in the end (delta: -108.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.0GB. [2022-01-19 04:40:00,194 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.04ms. Allocated memory is still 455.1MB. Free memory was 413.5MB in the beginning and 410.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:40:00,194 INFO L158 Benchmark]: Boogie Preprocessor took 23.64ms. Allocated memory is still 455.1MB. Free memory was 410.3MB in the beginning and 408.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:40:00,194 INFO L158 Benchmark]: RCFGBuilder took 780.83ms. Allocated memory is still 455.1MB. Free memory was 408.2MB in the beginning and 301.3MB in the end (delta: 107.0MB). Peak memory consumption was 107.0MB. Max. memory is 16.0GB. [2022-01-19 04:40:00,196 INFO L158 Benchmark]: TraceAbstraction took 9465.12ms. Allocated memory was 455.1MB in the beginning and 1.4GB in the end (delta: 979.4MB). Free memory was 301.3MB in the beginning and 1.2GB in the end (delta: -879.7MB). Peak memory consumption was 102.8MB. Max. memory is 16.0GB. [2022-01-19 04:40:00,196 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.09ms. Allocated memory is still 360.7MB. Free memory is still 323.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 409.30ms. Allocated memory was 360.7MB in the beginning and 455.1MB in the end (delta: 94.4MB). Free memory was 305.2MB in the beginning and 413.5MB in the end (delta: -108.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.04ms. Allocated memory is still 455.1MB. Free memory was 413.5MB in the beginning and 410.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.64ms. Allocated memory is still 455.1MB. Free memory was 410.3MB in the beginning and 408.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 780.83ms. Allocated memory is still 455.1MB. Free memory was 408.2MB in the beginning and 301.3MB in the end (delta: 107.0MB). Peak memory consumption was 107.0MB. Max. memory is 16.0GB. * TraceAbstraction took 9465.12ms. Allocated memory was 455.1MB in the beginning and 1.4GB in the end (delta: 979.4MB). Free memory was 301.3MB in the beginning and 1.2GB in the end (delta: -879.7MB). Peak memory consumption was 102.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L720] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0] [L722] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L724] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L725] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L726] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L728] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L730] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L732] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L733] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L734] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L735] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L736] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L737] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L738] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L739] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L740] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L741] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L742] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L743] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L744] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L745] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L746] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L747] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L748] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L749] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L750] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L751] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t93; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t93={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L872] FCALL, FORK 0 pthread_create(&t93, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t93, ((void *)0), P0, ((void *)0))=-3, t93={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t94; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t93={5:0}, t94={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L874] FCALL, FORK 0 pthread_create(&t94, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t94, ((void *)0), P1, ((void *)0))=-2, t93={5:0}, t94={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t95; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t93={5:0}, t94={6:0}, t95={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] FCALL, FORK 0 pthread_create(&t95, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t95, ((void *)0), P2, ((void *)0))=-1, t93={5:0}, t94={6:0}, t95={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t96; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L878] FCALL, FORK 0 pthread_create(&t96, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t96, ((void *)0), P3, ((void *)0))=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L834] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 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) [L796] 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) [L797] 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)) [L797] 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)) [L798] 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)) [L798] 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)) [L799] 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)) [L799] 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)) [L800] 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)) [L800] 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)) [L801] 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)) [L801] 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)) [L802] 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)) [L802] 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)) [L803] 3 __unbuffered_p2_EBX = z [L804] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L849] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice0=50, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 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) [L884] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L884] 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) [L884] 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) [L885] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L886] 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 [L887] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L888] 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 [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice0=50, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 681 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 681 mSDsluCounter, 730 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1245 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1549 IncrementalHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 148 mSDtfsCounter, 1549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=813occurred in iteration=6, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1175 NumberOfCodeBlocks, 1175 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1057 ConstructedInterpolants, 0 QuantifiedInterpolants, 5786 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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! [2022-01-19 04:40:00,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...