/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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:57:09,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:57:09,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:57:09,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:57:09,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:57:09,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:57:09,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:57:09,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:57:09,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:57:09,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:57:09,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:57:09,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:57:09,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:57:09,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:57:09,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:57:09,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:57:09,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:57:09,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:57:09,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:57:09,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:57:09,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:57:09,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:57:09,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:57:09,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:57:09,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:57:09,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:57:09,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:57:09,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:57:09,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:57:09,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:57:09,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:57:09,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:57:09,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:57:09,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:57:09,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:57:09,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:57:09,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:57:09,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:57:09,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:57:09,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:57:09,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:57:09,844 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:57:09,894 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:57:09,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:57:09,895 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:57:09,895 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:57:09,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:57:09,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:57:09,896 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:57:09,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:57:09,896 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:57:09,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:57:09,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:57:09,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:57:09,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:57:09,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:57:09,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:57:09,897 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:57:09,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:57:09,897 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:57:09,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:57:09,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:57:09,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:57:09,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:57:09,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:57:09,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:57:09,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:57:09,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:57:09,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:57:09,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:57:09,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:57:09,899 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:57:09,899 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:57:09,899 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:57:09,899 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:57:10,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:57:10,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:57:10,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:57:10,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:57:10,108 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:57:10,109 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-19 04:57:10,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5622ea30/b7509635ea07459bb2248d03149ad406/FLAG960425ed8 [2022-01-19 04:57:10,553 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:57:10,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-19 04:57:10,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5622ea30/b7509635ea07459bb2248d03149ad406/FLAG960425ed8 [2022-01-19 04:57:10,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5622ea30/b7509635ea07459bb2248d03149ad406 [2022-01-19 04:57:10,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:57:10,586 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:57:10,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:57:10,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:57:10,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:57:10,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:57:10" (1/1) ... [2022-01-19 04:57:10,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c9737e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:57:10, skipping insertion in model container [2022-01-19 04:57:10,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:57:10" (1/1) ... [2022-01-19 04:57:10,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:57:10,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:57:10,772 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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2022-01-19 04:57:10,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:57:10,890 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:57:10,897 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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2022-01-19 04:57:10,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:57:10,946 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:57:10,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:57:10 WrapperNode [2022-01-19 04:57:10,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:57:10,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:57:10,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:57:10,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:57:10,952 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:57:10" (1/1) ... [2022-01-19 04:57:10,963 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:57:10" (1/1) ... [2022-01-19 04:57:10,984 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 279 [2022-01-19 04:57:10,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:57:10,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:57:10,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:57:10,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:57:10,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:57:10" (1/1) ... [2022-01-19 04:57:10,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:57:10" (1/1) ... [2022-01-19 04:57:10,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:57:10" (1/1) ... [2022-01-19 04:57:10,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:57:10" (1/1) ... [2022-01-19 04:57:11,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:57:10" (1/1) ... [2022-01-19 04:57:11,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:57:10" (1/1) ... [2022-01-19 04:57:11,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:57:10" (1/1) ... [2022-01-19 04:57:11,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:57:11,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:57:11,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:57:11,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:57:11,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:57:10" (1/1) ... [2022-01-19 04:57:11,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:57:11,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:57:11,034 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:57:11,037 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:57:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:57:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:57:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:57:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:57:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:57:11,081 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 04:57:11,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 04:57:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 04:57:11,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 04:57:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 04:57:11,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 04:57:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:57:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:57:11,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:57:11,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:57:11,083 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:57:11,230 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:57:11,231 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:57:11,603 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:57:11,909 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:57:11,910 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 04:57:11,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:57:11 BoogieIcfgContainer [2022-01-19 04:57:11,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:57:11,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:57:11,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:57:11,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:57:11,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:57:10" (1/3) ... [2022-01-19 04:57:11,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9b4434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:57:11, skipping insertion in model container [2022-01-19 04:57:11,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:57:10" (2/3) ... [2022-01-19 04:57:11,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d9b4434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:57:11, skipping insertion in model container [2022-01-19 04:57:11,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:57:11" (3/3) ... [2022-01-19 04:57:11,918 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-01-19 04:57:11,922 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:57:11,922 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 04:57:11,922 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:57:11,969 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,969 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,969 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,969 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,969 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,969 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,969 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,969 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,970 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,970 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,970 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,970 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,970 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,970 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,970 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,970 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,971 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,971 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,971 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,971 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,971 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,971 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,971 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,972 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,972 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,972 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,972 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,972 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,973 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,973 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,973 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,973 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,973 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,973 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,973 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,973 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,973 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,974 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,974 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,974 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,974 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,974 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,974 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,975 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,975 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,975 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,976 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,976 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,976 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,977 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,978 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,979 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,981 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,982 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,982 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,982 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,982 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,983 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,985 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,988 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,988 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,988 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,989 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,989 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,989 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,989 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,989 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,989 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,989 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,989 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,989 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,990 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,990 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,990 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,990 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,990 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,990 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,990 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,990 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,990 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,991 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,992 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,994 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,994 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,994 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,994 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,994 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,994 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,994 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,994 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,994 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,994 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,995 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,995 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,995 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,995 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,996 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,996 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,996 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,996 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,996 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,996 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,996 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,997 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:11,999 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,000 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,000 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,000 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,000 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,000 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,000 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,000 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,001 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,001 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,001 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,001 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,001 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,001 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,001 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,001 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,001 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,001 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,001 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,001 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,002 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,003 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,003 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,005 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,006 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,007 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,007 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,007 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,007 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,010 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,011 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,011 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,015 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,015 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,015 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,015 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,015 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,016 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,016 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,017 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,018 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,018 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,018 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,018 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,018 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,018 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,018 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,018 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,018 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,018 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,018 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,018 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,018 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,019 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,020 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,021 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,021 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,021 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,021 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,021 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,021 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,021 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,021 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,021 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:57:12,021 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:57:12,065 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:57:12,071 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:57:12,071 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 04:57:12,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-01-19 04:57:12,124 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2022-01-19 04:57:12,124 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:57:12,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-01-19 04:57:12,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-01-19 04:57:12,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-01-19 04:57:12,145 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2022-01-19 04:57:12,145 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:57:12,145 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:57:12,146 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] [2022-01-19 04:57:12,147 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:57:12,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:57:12,151 INFO L85 PathProgramCache]: Analyzing trace with hash 335784103, now seen corresponding path program 1 times [2022-01-19 04:57:12,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:57:12,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533932986] [2022-01-19 04:57:12,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:57:12,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:57:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:57:12,409 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:57:12,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:57:12,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533932986] [2022-01-19 04:57:12,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533932986] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:57:12,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:57:12,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 04:57:12,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413082903] [2022-01-19 04:57:12,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:57:12,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:57:12,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:57:12,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:57:12,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:57:12,445 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 115 [2022-01-19 04:57:12,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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:57:12,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:57:12,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 115 [2022-01-19 04:57:12,451 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:57:12,599 INFO L129 PetriNetUnfolder]: 52/247 cut-off events. [2022-01-19 04:57:12,600 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-01-19 04:57:12,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 247 events. 52/247 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 856 event pairs, 7 based on Foata normal form. 11/237 useless extension candidates. Maximal degree in co-relation 316. Up to 76 conditions per place. [2022-01-19 04:57:12,603 INFO L132 encePairwiseOnDemand]: 110/115 looper letters, 12 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-01-19 04:57:12,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 112 transitions, 264 flow [2022-01-19 04:57:12,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:57:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:57:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2022-01-19 04:57:12,617 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2022-01-19 04:57:12,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2022-01-19 04:57:12,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2022-01-19 04:57:12,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:57:12,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2022-01-19 04:57:12,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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:57:12,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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:57:12,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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:57:12,635 INFO L186 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 322 transitions. [2022-01-19 04:57:12,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 112 transitions, 264 flow [2022-01-19 04:57:12,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 112 transitions, 260 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 04:57:12,642 INFO L242 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2022-01-19 04:57:12,643 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2022-01-19 04:57:12,646 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-01-19 04:57:12,646 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2022-01-19 04:57:12,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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:57:12,646 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:57:12,646 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] [2022-01-19 04:57:12,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:57:12,647 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:57:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:57:12,647 INFO L85 PathProgramCache]: Analyzing trace with hash 523540692, now seen corresponding path program 1 times [2022-01-19 04:57:12,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:57:12,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224367016] [2022-01-19 04:57:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:57:12,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:57:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:57:12,848 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:57:12,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:57:12,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224367016] [2022-01-19 04:57:12,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224367016] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:57:12,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:57:12,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:57:12,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562768050] [2022-01-19 04:57:12,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:57:12,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:57:12,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:57:12,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:57:12,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:57:12,851 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-01-19 04:57:12,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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:57:12,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:57:12,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-01-19 04:57:12,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:57:13,378 INFO L129 PetriNetUnfolder]: 604/1775 cut-off events. [2022-01-19 04:57:13,379 INFO L130 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-01-19 04:57:13,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 1775 events. 604/1775 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12927 event pairs, 304 based on Foata normal form. 0/1707 useless extension candidates. Maximal degree in co-relation 2787. Up to 481 conditions per place. [2022-01-19 04:57:13,391 INFO L132 encePairwiseOnDemand]: 109/115 looper letters, 27 selfloop transitions, 2 changer transitions 57/161 dead transitions. [2022-01-19 04:57:13,391 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 161 transitions, 500 flow [2022-01-19 04:57:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:57:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:57:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 878 transitions. [2022-01-19 04:57:13,394 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8483091787439614 [2022-01-19 04:57:13,394 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 878 transitions. [2022-01-19 04:57:13,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 878 transitions. [2022-01-19 04:57:13,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:57:13,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 878 transitions. [2022-01-19 04:57:13,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 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:57:13,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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:57:13,400 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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:57:13,400 INFO L186 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 9 states and 878 transitions. [2022-01-19 04:57:13,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 161 transitions, 500 flow [2022-01-19 04:57:13,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 161 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:57:13,405 INFO L242 Difference]: Finished difference. Result has 130 places, 96 transitions, 218 flow [2022-01-19 04:57:13,406 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=130, PETRI_TRANSITIONS=96} [2022-01-19 04:57:13,406 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-01-19 04:57:13,406 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 96 transitions, 218 flow [2022-01-19 04:57:13,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 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:57:13,407 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:57:13,407 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] [2022-01-19 04:57:13,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:57:13,407 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:57:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:57:13,408 INFO L85 PathProgramCache]: Analyzing trace with hash -76064941, now seen corresponding path program 1 times [2022-01-19 04:57:13,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:57:13,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268696750] [2022-01-19 04:57:13,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:57:13,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:57:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:57:13,592 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:57:13,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:57:13,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268696750] [2022-01-19 04:57:13,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268696750] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:57:13,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:57:13,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:57:13,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072283233] [2022-01-19 04:57:13,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:57:13,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:57:13,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:57:13,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:57:13,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:57:13,598 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2022-01-19 04:57:13,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 96 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 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:57:13,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:57:13,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2022-01-19 04:57:13,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:57:14,121 INFO L129 PetriNetUnfolder]: 787/1678 cut-off events. [2022-01-19 04:57:14,121 INFO L130 PetriNetUnfolder]: For 508/508 co-relation queries the response was YES. [2022-01-19 04:57:14,125 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3398 conditions, 1678 events. 787/1678 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10161 event pairs, 76 based on Foata normal form. 39/1654 useless extension candidates. Maximal degree in co-relation 3334. Up to 526 conditions per place. [2022-01-19 04:57:14,129 INFO L132 encePairwiseOnDemand]: 101/115 looper letters, 37 selfloop transitions, 14 changer transitions 86/210 dead transitions. [2022-01-19 04:57:14,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 210 transitions, 777 flow [2022-01-19 04:57:14,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 04:57:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 04:57:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1620 transitions. [2022-01-19 04:57:14,134 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8286445012787724 [2022-01-19 04:57:14,134 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1620 transitions. [2022-01-19 04:57:14,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1620 transitions. [2022-01-19 04:57:14,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:57:14,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1620 transitions. [2022-01-19 04:57:14,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 95.29411764705883) internal successors, (1620), 17 states have internal predecessors, (1620), 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:57:14,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 115.0) internal successors, (2070), 18 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:57:14,141 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 115.0) internal successors, (2070), 18 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:57:14,141 INFO L186 Difference]: Start difference. First operand has 130 places, 96 transitions, 218 flow. Second operand 17 states and 1620 transitions. [2022-01-19 04:57:14,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 210 transitions, 777 flow [2022-01-19 04:57:14,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 210 transitions, 715 flow, removed 28 selfloop flow, removed 8 redundant places. [2022-01-19 04:57:14,149 INFO L242 Difference]: Finished difference. Result has 135 places, 104 transitions, 344 flow [2022-01-19 04:57:14,149 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=344, PETRI_PLACES=135, PETRI_TRANSITIONS=104} [2022-01-19 04:57:14,150 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 15 predicate places. [2022-01-19 04:57:14,150 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 104 transitions, 344 flow [2022-01-19 04:57:14,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 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:57:14,150 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:57:14,150 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] [2022-01-19 04:57:14,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:57:14,151 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:57:14,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:57:14,151 INFO L85 PathProgramCache]: Analyzing trace with hash -286463136, now seen corresponding path program 1 times [2022-01-19 04:57:14,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:57:14,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893714686] [2022-01-19 04:57:14,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:57:14,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:57:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:57:14,251 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:57:14,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:57:14,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893714686] [2022-01-19 04:57:14,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893714686] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:57:14,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:57:14,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:57:14,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155012143] [2022-01-19 04:57:14,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:57:14,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:57:14,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:57:14,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:57:14,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:57:14,253 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2022-01-19 04:57:14,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 104 transitions, 344 flow. Second operand has 8 states, 8 states have (on average 89.125) internal successors, (713), 8 states have internal predecessors, (713), 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:57:14,254 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:57:14,254 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2022-01-19 04:57:14,254 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:57:14,618 INFO L129 PetriNetUnfolder]: 614/1330 cut-off events. [2022-01-19 04:57:14,619 INFO L130 PetriNetUnfolder]: For 7736/7736 co-relation queries the response was YES. [2022-01-19 04:57:14,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5305 conditions, 1330 events. 614/1330 cut-off events. For 7736/7736 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7679 event pairs, 104 based on Foata normal form. 24/1276 useless extension candidates. Maximal degree in co-relation 5226. Up to 393 conditions per place. [2022-01-19 04:57:14,626 INFO L132 encePairwiseOnDemand]: 107/115 looper letters, 30 selfloop transitions, 4 changer transitions 54/161 dead transitions. [2022-01-19 04:57:14,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 161 transitions, 1071 flow [2022-01-19 04:57:14,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:57:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:57:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 953 transitions. [2022-01-19 04:57:14,629 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.828695652173913 [2022-01-19 04:57:14,629 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 953 transitions. [2022-01-19 04:57:14,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 953 transitions. [2022-01-19 04:57:14,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:57:14,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 953 transitions. [2022-01-19 04:57:14,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.3) internal successors, (953), 10 states have internal predecessors, (953), 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:57:14,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:57:14,633 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:57:14,633 INFO L186 Difference]: Start difference. First operand has 135 places, 104 transitions, 344 flow. Second operand 10 states and 953 transitions. [2022-01-19 04:57:14,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 161 transitions, 1071 flow [2022-01-19 04:57:14,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 161 transitions, 855 flow, removed 102 selfloop flow, removed 10 redundant places. [2022-01-19 04:57:14,640 INFO L242 Difference]: Finished difference. Result has 130 places, 96 transitions, 286 flow [2022-01-19 04:57:14,641 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=286, PETRI_PLACES=130, PETRI_TRANSITIONS=96} [2022-01-19 04:57:14,641 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-01-19 04:57:14,641 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 96 transitions, 286 flow [2022-01-19 04:57:14,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.125) internal successors, (713), 8 states have internal predecessors, (713), 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:57:14,642 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:57:14,642 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] [2022-01-19 04:57:14,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:57:14,642 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:57:14,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:57:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1560548164, now seen corresponding path program 1 times [2022-01-19 04:57:14,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:57:14,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97043890] [2022-01-19 04:57:14,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:57:14,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:57:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:57:14,717 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:57:14,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:57:14,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97043890] [2022-01-19 04:57:14,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97043890] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:57:14,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:57:14,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:57:14,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193056132] [2022-01-19 04:57:14,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:57:14,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:57:14,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:57:14,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:57:14,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:57:14,719 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-01-19 04:57:14,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 96 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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:57:14,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:57:14,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-01-19 04:57:14,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:57:14,959 INFO L129 PetriNetUnfolder]: 325/764 cut-off events. [2022-01-19 04:57:14,959 INFO L130 PetriNetUnfolder]: For 1863/1863 co-relation queries the response was YES. [2022-01-19 04:57:14,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 764 events. 325/764 cut-off events. For 1863/1863 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3649 event pairs, 70 based on Foata normal form. 20/754 useless extension candidates. Maximal degree in co-relation 2513. Up to 264 conditions per place. [2022-01-19 04:57:14,963 INFO L132 encePairwiseOnDemand]: 107/115 looper letters, 22 selfloop transitions, 4 changer transitions 31/132 dead transitions. [2022-01-19 04:57:14,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 132 transitions, 644 flow [2022-01-19 04:57:14,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:57:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:57:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 949 transitions. [2022-01-19 04:57:14,965 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8252173913043478 [2022-01-19 04:57:14,966 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 949 transitions. [2022-01-19 04:57:14,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 949 transitions. [2022-01-19 04:57:14,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:57:14,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 949 transitions. [2022-01-19 04:57:14,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.9) internal successors, (949), 10 states have internal predecessors, (949), 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:57:14,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:57:14,970 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:57:14,970 INFO L186 Difference]: Start difference. First operand has 130 places, 96 transitions, 286 flow. Second operand 10 states and 949 transitions. [2022-01-19 04:57:14,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 132 transitions, 644 flow [2022-01-19 04:57:14,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 132 transitions, 548 flow, removed 38 selfloop flow, removed 14 redundant places. [2022-01-19 04:57:14,975 INFO L242 Difference]: Finished difference. Result has 125 places, 96 transitions, 266 flow [2022-01-19 04:57:14,975 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=266, PETRI_PLACES=125, PETRI_TRANSITIONS=96} [2022-01-19 04:57:14,977 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2022-01-19 04:57:14,977 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 96 transitions, 266 flow [2022-01-19 04:57:14,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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:57:14,977 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:57:14,978 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] [2022-01-19 04:57:14,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:57:14,978 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:57:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:57:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash 299920604, now seen corresponding path program 1 times [2022-01-19 04:57:14,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:57:14,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299745445] [2022-01-19 04:57:14,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:57:14,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:57:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:57:15,107 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:57:15,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:57:15,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299745445] [2022-01-19 04:57:15,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299745445] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:57:15,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:57:15,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:57:15,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224726226] [2022-01-19 04:57:15,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:57:15,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:57:15,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:57:15,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:57:15,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:57:15,110 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-01-19 04:57:15,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 96 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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:57:15,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:57:15,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-01-19 04:57:15,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:57:15,494 INFO L129 PetriNetUnfolder]: 1029/2069 cut-off events. [2022-01-19 04:57:15,494 INFO L130 PetriNetUnfolder]: For 3551/3703 co-relation queries the response was YES. [2022-01-19 04:57:15,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5337 conditions, 2069 events. 1029/2069 cut-off events. For 3551/3703 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13108 event pairs, 75 based on Foata normal form. 0/1987 useless extension candidates. Maximal degree in co-relation 5267. Up to 556 conditions per place. [2022-01-19 04:57:15,503 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 30 selfloop transitions, 6 changer transitions 50/162 dead transitions. [2022-01-19 04:57:15,503 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 162 transitions, 705 flow [2022-01-19 04:57:15,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:57:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:57:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 998 transitions. [2022-01-19 04:57:15,505 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8678260869565217 [2022-01-19 04:57:15,506 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 998 transitions. [2022-01-19 04:57:15,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 998 transitions. [2022-01-19 04:57:15,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:57:15,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 998 transitions. [2022-01-19 04:57:15,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.8) internal successors, (998), 10 states have internal predecessors, (998), 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:57:15,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:57:15,509 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:57:15,509 INFO L186 Difference]: Start difference. First operand has 125 places, 96 transitions, 266 flow. Second operand 10 states and 998 transitions. [2022-01-19 04:57:15,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 162 transitions, 705 flow [2022-01-19 04:57:15,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 162 transitions, 671 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-01-19 04:57:15,513 INFO L242 Difference]: Finished difference. Result has 125 places, 98 transitions, 300 flow [2022-01-19 04:57:15,513 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=300, PETRI_PLACES=125, PETRI_TRANSITIONS=98} [2022-01-19 04:57:15,514 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 5 predicate places. [2022-01-19 04:57:15,514 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 98 transitions, 300 flow [2022-01-19 04:57:15,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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:57:15,514 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:57:15,514 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] [2022-01-19 04:57:15,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:57:15,514 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:57:15,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:57:15,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1081081363, now seen corresponding path program 1 times [2022-01-19 04:57:15,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:57:15,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142686702] [2022-01-19 04:57:15,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:57:15,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:57:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:57:15,591 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:57:15,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:57:15,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142686702] [2022-01-19 04:57:15,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142686702] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:57:15,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:57:15,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:57:15,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280084882] [2022-01-19 04:57:15,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:57:15,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:57:15,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:57:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:57:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:57:15,593 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-01-19 04:57:15,593 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 98 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 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:57:15,593 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:57:15,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-01-19 04:57:15,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:57:15,837 INFO L129 PetriNetUnfolder]: 335/826 cut-off events. [2022-01-19 04:57:15,838 INFO L130 PetriNetUnfolder]: For 1732/1798 co-relation queries the response was YES. [2022-01-19 04:57:15,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 826 events. 335/826 cut-off events. For 1732/1798 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4371 event pairs, 23 based on Foata normal form. 32/842 useless extension candidates. Maximal degree in co-relation 2538. Up to 189 conditions per place. [2022-01-19 04:57:15,842 INFO L132 encePairwiseOnDemand]: 106/115 looper letters, 35 selfloop transitions, 9 changer transitions 39/159 dead transitions. [2022-01-19 04:57:15,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 159 transitions, 836 flow [2022-01-19 04:57:15,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:57:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:57:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 995 transitions. [2022-01-19 04:57:15,844 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8652173913043478 [2022-01-19 04:57:15,845 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 995 transitions. [2022-01-19 04:57:15,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 995 transitions. [2022-01-19 04:57:15,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:57:15,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 995 transitions. [2022-01-19 04:57:15,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.5) internal successors, (995), 10 states have internal predecessors, (995), 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:57:15,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:57:15,848 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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:57:15,848 INFO L186 Difference]: Start difference. First operand has 125 places, 98 transitions, 300 flow. Second operand 10 states and 995 transitions. [2022-01-19 04:57:15,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 159 transitions, 836 flow [2022-01-19 04:57:15,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 159 transitions, 812 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-01-19 04:57:15,852 INFO L242 Difference]: Finished difference. Result has 129 places, 101 transitions, 368 flow [2022-01-19 04:57:15,852 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=368, PETRI_PLACES=129, PETRI_TRANSITIONS=101} [2022-01-19 04:57:15,853 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 9 predicate places. [2022-01-19 04:57:15,853 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 101 transitions, 368 flow [2022-01-19 04:57:15,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 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:57:15,853 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:57:15,853 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] [2022-01-19 04:57:15,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:57:15,854 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:57:15,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:57:15,854 INFO L85 PathProgramCache]: Analyzing trace with hash 774512204, now seen corresponding path program 1 times [2022-01-19 04:57:15,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:57:15,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544832826] [2022-01-19 04:57:15,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:57:15,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:57:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:57:15,947 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:57:15,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:57:15,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544832826] [2022-01-19 04:57:15,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544832826] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:57:15,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:57:15,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:57:15,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726618147] [2022-01-19 04:57:15,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:57:15,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:57:15,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:57:15,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:57:15,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:57:15,949 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-01-19 04:57:15,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 101 transitions, 368 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 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:57:15,950 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:57:15,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-01-19 04:57:15,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:57:16,123 INFO L129 PetriNetUnfolder]: 98/357 cut-off events. [2022-01-19 04:57:16,123 INFO L130 PetriNetUnfolder]: For 867/889 co-relation queries the response was YES. [2022-01-19 04:57:16,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 357 events. 98/357 cut-off events. For 867/889 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1509 event pairs, 18 based on Foata normal form. 10/359 useless extension candidates. Maximal degree in co-relation 1077. Up to 68 conditions per place. [2022-01-19 04:57:16,125 INFO L132 encePairwiseOnDemand]: 106/115 looper letters, 24 selfloop transitions, 12 changer transitions 23/135 dead transitions. [2022-01-19 04:57:16,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 135 transitions, 724 flow [2022-01-19 04:57:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 04:57:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 04:57:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1062 transitions. [2022-01-19 04:57:16,128 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8395256916996048 [2022-01-19 04:57:16,128 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1062 transitions. [2022-01-19 04:57:16,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1062 transitions. [2022-01-19 04:57:16,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:57:16,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1062 transitions. [2022-01-19 04:57:16,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.54545454545455) internal successors, (1062), 11 states have internal predecessors, (1062), 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:57:16,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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:57:16,133 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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:57:16,133 INFO L186 Difference]: Start difference. First operand has 129 places, 101 transitions, 368 flow. Second operand 11 states and 1062 transitions. [2022-01-19 04:57:16,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 135 transitions, 724 flow [2022-01-19 04:57:16,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 135 transitions, 609 flow, removed 44 selfloop flow, removed 11 redundant places. [2022-01-19 04:57:16,136 INFO L242 Difference]: Finished difference. Result has 130 places, 101 transitions, 342 flow [2022-01-19 04:57:16,136 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=342, PETRI_PLACES=130, PETRI_TRANSITIONS=101} [2022-01-19 04:57:16,137 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-01-19 04:57:16,137 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 101 transitions, 342 flow [2022-01-19 04:57:16,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 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:57:16,137 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:57:16,137 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] [2022-01-19 04:57:16,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:57:16,138 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:57:16,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:57:16,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1838759686, now seen corresponding path program 1 times [2022-01-19 04:57:16,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:57:16,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881945585] [2022-01-19 04:57:16,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:57:16,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:57:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:57:16,231 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:57:16,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:57:16,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881945585] [2022-01-19 04:57:16,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881945585] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:57:16,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:57:16,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:57:16,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122681887] [2022-01-19 04:57:16,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:57:16,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:57:16,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:57:16,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:57:16,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:57:16,233 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 115 [2022-01-19 04:57:16,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 101 transitions, 342 flow. Second operand has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 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:57:16,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:57:16,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 115 [2022-01-19 04:57:16,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:57:16,377 INFO L129 PetriNetUnfolder]: 64/337 cut-off events. [2022-01-19 04:57:16,377 INFO L130 PetriNetUnfolder]: For 439/446 co-relation queries the response was YES. [2022-01-19 04:57:16,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 337 events. 64/337 cut-off events. For 439/446 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1507 event pairs, 14 based on Foata normal form. 1/332 useless extension candidates. Maximal degree in co-relation 791. Up to 72 conditions per place. [2022-01-19 04:57:16,379 INFO L132 encePairwiseOnDemand]: 103/115 looper letters, 23 selfloop transitions, 8 changer transitions 5/114 dead transitions. [2022-01-19 04:57:16,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 114 transitions, 465 flow [2022-01-19 04:57:16,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 04:57:16,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 04:57:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 733 transitions. [2022-01-19 04:57:16,413 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7967391304347826 [2022-01-19 04:57:16,414 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 733 transitions. [2022-01-19 04:57:16,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 733 transitions. [2022-01-19 04:57:16,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:57:16,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 733 transitions. [2022-01-19 04:57:16,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.625) internal successors, (733), 8 states have internal predecessors, (733), 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:57:16,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 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:57:16,417 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 115.0) internal successors, (1035), 9 states have internal predecessors, (1035), 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:57:16,417 INFO L186 Difference]: Start difference. First operand has 130 places, 101 transitions, 342 flow. Second operand 8 states and 733 transitions. [2022-01-19 04:57:16,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 114 transitions, 465 flow [2022-01-19 04:57:16,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 114 transitions, 347 flow, removed 40 selfloop flow, removed 18 redundant places. [2022-01-19 04:57:16,420 INFO L242 Difference]: Finished difference. Result has 120 places, 104 transitions, 290 flow [2022-01-19 04:57:16,420 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=290, PETRI_PLACES=120, PETRI_TRANSITIONS=104} [2022-01-19 04:57:16,420 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2022-01-19 04:57:16,421 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 104 transitions, 290 flow [2022-01-19 04:57:16,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 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:57:16,421 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:57:16,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, 1] [2022-01-19 04:57:16,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 04:57:16,421 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:57:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:57:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash -742882430, now seen corresponding path program 2 times [2022-01-19 04:57:16,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:57:16,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148876163] [2022-01-19 04:57:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:57:16,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:57:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:57:16,742 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:57:16,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:57:16,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148876163] [2022-01-19 04:57:16,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148876163] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:57:16,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:57:16,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-19 04:57:16,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440879885] [2022-01-19 04:57:16,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:57:16,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 04:57:16,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:57:16,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 04:57:16,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-01-19 04:57:16,748 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 115 [2022-01-19 04:57:16,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 104 transitions, 290 flow. Second operand has 14 states, 14 states have (on average 85.85714285714286) internal successors, (1202), 14 states have internal predecessors, (1202), 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:57:16,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:57:16,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 115 [2022-01-19 04:57:16,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:57:16,970 INFO L129 PetriNetUnfolder]: 46/297 cut-off events. [2022-01-19 04:57:16,970 INFO L130 PetriNetUnfolder]: For 49/56 co-relation queries the response was YES. [2022-01-19 04:57:16,971 INFO L84 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 297 events. 46/297 cut-off events. For 49/56 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1235 event pairs, 2 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 532. Up to 32 conditions per place. [2022-01-19 04:57:16,972 INFO L132 encePairwiseOnDemand]: 102/115 looper letters, 24 selfloop transitions, 8 changer transitions 11/120 dead transitions. [2022-01-19 04:57:16,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 120 transitions, 438 flow [2022-01-19 04:57:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 04:57:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 04:57:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1218 transitions. [2022-01-19 04:57:16,974 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7565217391304347 [2022-01-19 04:57:16,974 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1218 transitions. [2022-01-19 04:57:16,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1218 transitions. [2022-01-19 04:57:16,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:57:16,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1218 transitions. [2022-01-19 04:57:16,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 87.0) internal successors, (1218), 14 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:57:16,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 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:57:16,981 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 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:57:16,981 INFO L186 Difference]: Start difference. First operand has 120 places, 104 transitions, 290 flow. Second operand 14 states and 1218 transitions. [2022-01-19 04:57:16,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 120 transitions, 438 flow [2022-01-19 04:57:16,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 120 transitions, 415 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-01-19 04:57:16,984 INFO L242 Difference]: Finished difference. Result has 130 places, 104 transitions, 303 flow [2022-01-19 04:57:16,984 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=303, PETRI_PLACES=130, PETRI_TRANSITIONS=104} [2022-01-19 04:57:16,985 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-01-19 04:57:16,985 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 104 transitions, 303 flow [2022-01-19 04:57:16,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 85.85714285714286) internal successors, (1202), 14 states have internal predecessors, (1202), 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:57:16,986 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:57:16,986 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] [2022-01-19 04:57:16,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 04:57:16,986 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:57:16,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:57:16,986 INFO L85 PathProgramCache]: Analyzing trace with hash -392930626, now seen corresponding path program 3 times [2022-01-19 04:57:16,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:57:16,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731056567] [2022-01-19 04:57:16,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:57:16,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:57:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:57:17,052 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:57:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:57:17,141 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:57:17,141 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:57:17,142 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 04:57:17,143 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-19 04:57:17,143 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 04:57:17,143 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-19 04:57:17,143 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-19 04:57:17,144 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 04:57:17,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 04:57:17,146 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:57:17,150 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:57:17,150 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:57:17,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:57:17 BasicIcfg [2022-01-19 04:57:17,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:57:17,265 INFO L158 Benchmark]: Toolchain (without parser) took 6678.18ms. Allocated memory was 392.2MB in the beginning and 964.7MB in the end (delta: 572.5MB). Free memory was 338.1MB in the beginning and 728.6MB in the end (delta: -390.5MB). Peak memory consumption was 184.1MB. Max. memory is 16.0GB. [2022-01-19 04:57:17,265 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 392.2MB. Free memory was 356.2MB in the beginning and 356.1MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:57:17,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.91ms. Allocated memory is still 392.2MB. Free memory was 337.9MB in the beginning and 347.7MB in the end (delta: -9.8MB). Peak memory consumption was 11.4MB. Max. memory is 16.0GB. [2022-01-19 04:57:17,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.86ms. Allocated memory is still 392.2MB. Free memory was 347.7MB in the beginning and 344.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:57:17,266 INFO L158 Benchmark]: Boogie Preprocessor took 26.68ms. Allocated memory is still 392.2MB. Free memory was 344.5MB in the beginning and 342.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:57:17,266 INFO L158 Benchmark]: RCFGBuilder took 900.30ms. Allocated memory is still 392.2MB. Free memory was 342.4MB in the beginning and 238.6MB in the end (delta: 103.8MB). Peak memory consumption was 104.9MB. Max. memory is 16.0GB. [2022-01-19 04:57:17,266 INFO L158 Benchmark]: TraceAbstraction took 5351.18ms. Allocated memory was 392.2MB in the beginning and 964.7MB in the end (delta: 572.5MB). Free memory was 237.6MB in the beginning and 728.6MB in the end (delta: -491.1MB). Peak memory consumption was 84.6MB. Max. memory is 16.0GB. [2022-01-19 04:57:17,267 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 392.2MB. Free memory was 356.2MB in the beginning and 356.1MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 357.91ms. Allocated memory is still 392.2MB. Free memory was 337.9MB in the beginning and 347.7MB in the end (delta: -9.8MB). Peak memory consumption was 11.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.86ms. Allocated memory is still 392.2MB. Free memory was 347.7MB in the beginning and 344.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.68ms. Allocated memory is still 392.2MB. Free memory was 344.5MB in the beginning and 342.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 900.30ms. Allocated memory is still 392.2MB. Free memory was 342.4MB in the beginning and 238.6MB in the end (delta: 103.8MB). Peak memory consumption was 104.9MB. Max. memory is 16.0GB. * TraceAbstraction took 5351.18ms. Allocated memory was 392.2MB in the beginning and 964.7MB in the end (delta: 572.5MB). Free memory was 237.6MB in the beginning and 728.6MB in the end (delta: -491.1MB). Peak memory consumption was 84.6MB. 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: 19]: 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_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L716] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L718] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L725] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L726] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L727] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L728] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L729] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L730] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L731] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L732] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L733] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L734] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L735] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L736] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L737] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L738] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L739] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L740] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] 0 pthread_t t1740; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1740, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1740, ((void *)0), P0, ((void *)0))=-2, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1741; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1741, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1741, ((void *)0), P1, ((void *)0))=-1, t1740={5:0}, t1741={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1742; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1742, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1742, ((void *)0), P2, ((void *)0))=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 2 y$flush_delayed = weak$$choice2 [L789] 2 y$mem_tmp = y [L790] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L790] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L791] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L791] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L792] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L792] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L793] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L793] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L794] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L795] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L796] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 __unbuffered_p1_EAX = y [L798] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L798] 2 y = y$flush_delayed ? y$mem_tmp : y [L799] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=63, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=63, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=63, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=63, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L754] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L755] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L756] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L758] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=62, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L806] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L807] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L808] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L809] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L809] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=62, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=62, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=62, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice0=62, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=62, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice0=62, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=62, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=62, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: 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: 849]: 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: 845]: 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: 847]: 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 7 procedures, 141 locations, 6 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: 5.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 581 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 581 mSDsluCounter, 469 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 973 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1350 IncrementalHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 93 mSDtfsCounter, 1350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=7, InterpolantAutomatonStates: 102, 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.0s InterpolantComputationTime, 881 NumberOfCodeBlocks, 881 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 3990 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-19 04:57:17,300 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...