/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/mix003.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:39:11,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:39:11,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:39:11,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:39:11,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:39:11,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:39:11,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:39:11,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:39:11,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:39:11,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:39:11,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:39:11,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:39:11,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:39:11,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:39:11,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:39:11,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:39:11,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:39:11,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:39:11,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:39:11,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:39:11,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:39:11,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:39:11,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:39:11,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:39:11,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:39:11,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:39:11,126 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:39:11,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:39:11,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:39:11,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:39:11,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:39:11,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:39:11,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:39:11,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:39:11,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:39:11,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:39:11,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:39:11,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:39:11,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:39:11,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:39:11,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:39:11,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 04:39:11,155 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:39:11,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:39:11,156 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:39:11,156 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:39:11,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:39:11,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:39:11,157 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:39:11,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:39:11,157 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:39:11,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:39:11,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:39:11,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:39:11,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:39:11,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:39:11,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:39:11,158 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:39:11,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:39:11,158 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:39:11,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:39:11,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:39:11,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:39:11,158 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:39:11,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:39:11,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:39:11,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:39:11,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:39:11,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:39:11,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:39:11,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:39:11,160 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:39:11,160 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:39:11,160 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:39:11,160 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 04:39:11,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:39:11,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:39:11,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:39:11,362 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:39:11,364 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:39:11,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2022-01-19 04:39:11,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f0a1687e/f1e237baf0934337afb44b21c5a068b8/FLAG6c561a604 [2022-01-19 04:39:11,787 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:39:11,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2022-01-19 04:39:11,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f0a1687e/f1e237baf0934337afb44b21c5a068b8/FLAG6c561a604 [2022-01-19 04:39:11,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f0a1687e/f1e237baf0934337afb44b21c5a068b8 [2022-01-19 04:39:11,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:39:11,808 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:39:11,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:39:11,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:39:11,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:39:11,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:39:11" (1/1) ... [2022-01-19 04:39:11,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb71adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:11, skipping insertion in model container [2022-01-19 04:39:11,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:39:11" (1/1) ... [2022-01-19 04:39:11,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:39:11,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:39:11,975 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/mix003.oepc.i[945,958] [2022-01-19 04:39:12,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:39:12,075 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:39:12,082 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/mix003.oepc.i[945,958] [2022-01-19 04:39:12,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:39:12,143 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:39:12,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:12 WrapperNode [2022-01-19 04:39:12,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:39:12,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:39:12,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:39:12,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:39:12,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:12" (1/1) ... [2022-01-19 04:39:12,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:12" (1/1) ... [2022-01-19 04:39:12,193 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2022-01-19 04:39:12,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:39:12,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:39:12,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:39:12,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:39:12,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:12" (1/1) ... [2022-01-19 04:39:12,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:12" (1/1) ... [2022-01-19 04:39:12,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:12" (1/1) ... [2022-01-19 04:39:12,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:12" (1/1) ... [2022-01-19 04:39:12,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:12" (1/1) ... [2022-01-19 04:39:12,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:12" (1/1) ... [2022-01-19 04:39:12,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:12" (1/1) ... [2022-01-19 04:39:12,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:39:12,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:39:12,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:39:12,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:39:12,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:12" (1/1) ... [2022-01-19 04:39:12,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:39:12,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:39:12,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 04:39:12,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 04:39:12,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:39:12,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:39:12,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:39:12,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:39:12,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:39:12,292 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 04:39:12,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 04:39:12,292 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 04:39:12,292 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 04:39:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 04:39:12,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 04:39:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:39:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:39:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:39:12,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:39:12,296 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 04:39:12,373 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:39:12,374 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:39:12,688 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:39:12,903 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:39:12,903 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 04:39:12,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:39:12 BoogieIcfgContainer [2022-01-19 04:39:12,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:39:12,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:39:12,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:39:12,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:39:12,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:39:11" (1/3) ... [2022-01-19 04:39:12,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37dbee21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:39:12, skipping insertion in model container [2022-01-19 04:39:12,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:39:12" (2/3) ... [2022-01-19 04:39:12,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37dbee21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:39:12, skipping insertion in model container [2022-01-19 04:39:12,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:39:12" (3/3) ... [2022-01-19 04:39:12,911 INFO L111 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2022-01-19 04:39:12,914 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:39:12,915 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 04:39:12,915 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:39:12,949 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,949 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,949 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,950 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,950 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,950 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,950 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,950 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,950 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,950 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,950 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,950 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,951 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,951 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,951 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,951 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,952 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,953 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,954 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,954 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,954 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,954 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,954 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,954 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,955 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,955 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,955 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,955 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,955 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,956 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,957 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,958 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,958 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,958 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,958 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,958 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,958 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,959 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,959 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,959 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,960 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,961 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,961 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,961 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,962 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,962 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,964 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,967 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,967 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,967 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,967 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,968 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,968 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,968 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,968 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,968 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,968 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,968 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,969 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,969 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,969 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,971 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,972 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,973 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,973 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,973 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,973 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,973 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,973 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,977 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,978 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,978 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,978 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,978 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,978 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,978 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,978 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,978 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,979 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,979 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,979 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,980 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,980 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,980 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,980 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,980 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,981 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,982 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,983 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,983 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,983 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,983 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,983 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,983 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,983 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,983 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,984 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,984 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,985 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,986 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,986 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,986 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,986 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,986 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,987 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,987 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,987 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,987 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,987 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,987 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,987 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,987 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,987 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,987 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,987 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,988 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,988 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,988 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,988 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,988 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,988 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:39:12,989 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:39:13,033 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:39:13,040 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 04:39:13,040 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 04:39:13,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2022-01-19 04:39:13,089 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2022-01-19 04:39:13,089 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:39:13,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-01-19 04:39:13,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2022-01-19 04:39:13,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2022-01-19 04:39:13,107 INFO L129 PetriNetUnfolder]: 0/50 cut-off events. [2022-01-19 04:39:13,108 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:39:13,108 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:13,108 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] [2022-01-19 04:39:13,109 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1818972421, now seen corresponding path program 1 times [2022-01-19 04:39:13,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:13,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852759466] [2022-01-19 04:39:13,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:13,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:13,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:13,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852759466] [2022-01-19 04:39:13,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852759466] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:13,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:13,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 04:39:13,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699915457] [2022-01-19 04:39:13,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:13,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:39:13,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:13,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:39:13,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:39:13,397 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 120 [2022-01-19 04:39:13,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:13,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:13,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 120 [2022-01-19 04:39:13,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:13,530 INFO L129 PetriNetUnfolder]: 58/327 cut-off events. [2022-01-19 04:39:13,530 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-01-19 04:39:13,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 327 events. 58/327 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1408 event pairs, 44 based on Foata normal form. 18/323 useless extension candidates. Maximal degree in co-relation 401. Up to 79 conditions per place. [2022-01-19 04:39:13,535 INFO L132 encePairwiseOnDemand]: 115/120 looper letters, 14 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2022-01-19 04:39:13,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 119 transitions, 285 flow [2022-01-19 04:39:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:39:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:39:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2022-01-19 04:39:13,549 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2022-01-19 04:39:13,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2022-01-19 04:39:13,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2022-01-19 04:39:13,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:13,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2022-01-19 04:39:13,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:13,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:13,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:13,572 INFO L186 Difference]: Start difference. First operand has 125 places, 117 transitions, 243 flow. Second operand 3 states and 339 transitions. [2022-01-19 04:39:13,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 119 transitions, 285 flow [2022-01-19 04:39:13,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 119 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 04:39:13,578 INFO L242 Difference]: Finished difference. Result has 122 places, 113 transitions, 236 flow [2022-01-19 04:39:13,579 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=122, PETRI_TRANSITIONS=113} [2022-01-19 04:39:13,582 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, -3 predicate places. [2022-01-19 04:39:13,582 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 113 transitions, 236 flow [2022-01-19 04:39:13,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:13,583 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:13,583 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:39:13,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:39:13,583 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:13,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash -141212877, now seen corresponding path program 1 times [2022-01-19 04:39:13,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:13,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049115321] [2022-01-19 04:39:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:13,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:13,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:13,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049115321] [2022-01-19 04:39:13,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049115321] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:13,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:13,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:39:13,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448821926] [2022-01-19 04:39:13,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:13,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:39:13,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:13,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:39:13,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:39:13,858 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-01-19 04:39:13,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 113 transitions, 236 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:39:13,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:13,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-01-19 04:39:13,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:14,461 INFO L129 PetriNetUnfolder]: 1548/3915 cut-off events. [2022-01-19 04:39:14,461 INFO L130 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-01-19 04:39:14,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6460 conditions, 3915 events. 1548/3915 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 31675 event pairs, 252 based on Foata normal form. 0/3814 useless extension candidates. Maximal degree in co-relation 6401. Up to 1203 conditions per place. [2022-01-19 04:39:14,478 INFO L132 encePairwiseOnDemand]: 112/120 looper letters, 27 selfloop transitions, 4 changer transitions 66/174 dead transitions. [2022-01-19 04:39:14,478 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 174 transitions, 544 flow [2022-01-19 04:39:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:39:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:39:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 998 transitions. [2022-01-19 04:39:14,481 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8316666666666667 [2022-01-19 04:39:14,481 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 998 transitions. [2022-01-19 04:39:14,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 998 transitions. [2022-01-19 04:39:14,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:14,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 998 transitions. [2022-01-19 04:39:14,483 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:39:14,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:14,486 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:14,486 INFO L186 Difference]: Start difference. First operand has 122 places, 113 transitions, 236 flow. Second operand 10 states and 998 transitions. [2022-01-19 04:39:14,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 174 transitions, 544 flow [2022-01-19 04:39:14,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 174 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:39:14,489 INFO L242 Difference]: Finished difference. Result has 136 places, 101 transitions, 232 flow [2022-01-19 04:39:14,489 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=136, PETRI_TRANSITIONS=101} [2022-01-19 04:39:14,490 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 11 predicate places. [2022-01-19 04:39:14,490 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 101 transitions, 232 flow [2022-01-19 04:39:14,490 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:39:14,490 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:14,490 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] [2022-01-19 04:39:14,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:39:14,490 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:14,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:14,491 INFO L85 PathProgramCache]: Analyzing trace with hash 687419341, now seen corresponding path program 1 times [2022-01-19 04:39:14,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:14,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067605614] [2022-01-19 04:39:14,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:14,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:14,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:14,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067605614] [2022-01-19 04:39:14,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067605614] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:14,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:14,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:39:14,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587302900] [2022-01-19 04:39:14,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:14,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:39:14,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:14,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:39:14,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:39:14,568 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 120 [2022-01-19 04:39:14,569 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 101 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:14,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:14,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 120 [2022-01-19 04:39:14,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:14,888 INFO L129 PetriNetUnfolder]: 459/999 cut-off events. [2022-01-19 04:39:14,889 INFO L130 PetriNetUnfolder]: For 252/252 co-relation queries the response was YES. [2022-01-19 04:39:14,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 999 events. 459/999 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5484 event pairs, 65 based on Foata normal form. 27/1000 useless extension candidates. Maximal degree in co-relation 1944. Up to 374 conditions per place. [2022-01-19 04:39:14,894 INFO L132 encePairwiseOnDemand]: 114/120 looper letters, 21 selfloop transitions, 2 changer transitions 37/144 dead transitions. [2022-01-19 04:39:14,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 144 transitions, 458 flow [2022-01-19 04:39:14,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:39:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:39:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 944 transitions. [2022-01-19 04:39:14,896 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8740740740740741 [2022-01-19 04:39:14,896 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 944 transitions. [2022-01-19 04:39:14,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 944 transitions. [2022-01-19 04:39:14,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:14,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 944 transitions. [2022-01-19 04:39:14,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.88888888888889) internal successors, (944), 9 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:14,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:14,900 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:14,900 INFO L186 Difference]: Start difference. First operand has 136 places, 101 transitions, 232 flow. Second operand 9 states and 944 transitions. [2022-01-19 04:39:14,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 144 transitions, 458 flow [2022-01-19 04:39:14,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 144 transitions, 422 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-01-19 04:39:14,910 INFO L242 Difference]: Finished difference. Result has 124 places, 101 transitions, 232 flow [2022-01-19 04:39:14,910 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=124, PETRI_TRANSITIONS=101} [2022-01-19 04:39:14,912 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, -1 predicate places. [2022-01-19 04:39:14,912 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 101 transitions, 232 flow [2022-01-19 04:39:14,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:14,913 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:14,913 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] [2022-01-19 04:39:14,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:39:14,913 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:14,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:14,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1087069435, now seen corresponding path program 1 times [2022-01-19 04:39:14,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:14,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208708445] [2022-01-19 04:39:14,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:14,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:15,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:15,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208708445] [2022-01-19 04:39:15,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208708445] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:15,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:15,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:39:15,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670122722] [2022-01-19 04:39:15,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:15,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:39:15,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:15,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:39:15,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:39:15,039 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2022-01-19 04:39:15,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 101 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:15,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:15,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2022-01-19 04:39:15,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:15,370 INFO L129 PetriNetUnfolder]: 917/1963 cut-off events. [2022-01-19 04:39:15,370 INFO L130 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2022-01-19 04:39:15,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3685 conditions, 1963 events. 917/1963 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13408 event pairs, 60 based on Foata normal form. 0/1923 useless extension candidates. Maximal degree in co-relation 3622. Up to 481 conditions per place. [2022-01-19 04:39:15,380 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 31 selfloop transitions, 6 changer transitions 50/168 dead transitions. [2022-01-19 04:39:15,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 168 transitions, 544 flow [2022-01-19 04:39:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:39:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:39:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1049 transitions. [2022-01-19 04:39:15,382 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8741666666666666 [2022-01-19 04:39:15,382 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1049 transitions. [2022-01-19 04:39:15,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1049 transitions. [2022-01-19 04:39:15,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:15,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1049 transitions. [2022-01-19 04:39:15,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.9) internal successors, (1049), 10 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:15,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:15,386 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:15,386 INFO L186 Difference]: Start difference. First operand has 124 places, 101 transitions, 232 flow. Second operand 10 states and 1049 transitions. [2022-01-19 04:39:15,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 168 transitions, 544 flow [2022-01-19 04:39:15,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 168 transitions, 528 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-01-19 04:39:15,390 INFO L242 Difference]: Finished difference. Result has 125 places, 103 transitions, 270 flow [2022-01-19 04:39:15,390 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=270, PETRI_PLACES=125, PETRI_TRANSITIONS=103} [2022-01-19 04:39:15,390 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 0 predicate places. [2022-01-19 04:39:15,390 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 103 transitions, 270 flow [2022-01-19 04:39:15,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:15,391 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:15,391 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:39:15,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:39:15,391 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:15,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:15,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1052983942, now seen corresponding path program 1 times [2022-01-19 04:39:15,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:15,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414430668] [2022-01-19 04:39:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:15,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:15,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:15,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414430668] [2022-01-19 04:39:15,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414430668] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:15,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:15,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:39:15,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970769572] [2022-01-19 04:39:15,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:15,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:39:15,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:15,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:39:15,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:39:15,472 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2022-01-19 04:39:15,473 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 103 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:15,473 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:15,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2022-01-19 04:39:15,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:15,948 INFO L129 PetriNetUnfolder]: 1014/2653 cut-off events. [2022-01-19 04:39:15,948 INFO L130 PetriNetUnfolder]: For 1048/1140 co-relation queries the response was YES. [2022-01-19 04:39:15,956 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5742 conditions, 2653 events. 1014/2653 cut-off events. For 1048/1140 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 20471 event pairs, 204 based on Foata normal form. 52/2607 useless extension candidates. Maximal degree in co-relation 5673. Up to 728 conditions per place. [2022-01-19 04:39:15,965 INFO L132 encePairwiseOnDemand]: 107/120 looper letters, 68 selfloop transitions, 20 changer transitions 0/165 dead transitions. [2022-01-19 04:39:15,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 165 transitions, 576 flow [2022-01-19 04:39:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 04:39:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 04:39:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1069 transitions. [2022-01-19 04:39:15,967 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8098484848484848 [2022-01-19 04:39:15,968 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1069 transitions. [2022-01-19 04:39:15,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1069 transitions. [2022-01-19 04:39:15,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:15,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1069 transitions. [2022-01-19 04:39:15,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.18181818181819) internal successors, (1069), 11 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:15,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:15,972 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:15,972 INFO L186 Difference]: Start difference. First operand has 125 places, 103 transitions, 270 flow. Second operand 11 states and 1069 transitions. [2022-01-19 04:39:15,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 165 transitions, 576 flow [2022-01-19 04:39:15,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 165 transitions, 562 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-01-19 04:39:15,977 INFO L242 Difference]: Finished difference. Result has 132 places, 118 transitions, 396 flow [2022-01-19 04:39:15,977 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=396, PETRI_PLACES=132, PETRI_TRANSITIONS=118} [2022-01-19 04:39:15,977 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 7 predicate places. [2022-01-19 04:39:15,978 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 118 transitions, 396 flow [2022-01-19 04:39:15,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:15,978 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:15,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, 1, 1, 1, 1] [2022-01-19 04:39:15,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:39:15,978 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:15,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:15,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1945505414, now seen corresponding path program 2 times [2022-01-19 04:39:15,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:15,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830993062] [2022-01-19 04:39:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:15,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:16,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:16,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830993062] [2022-01-19 04:39:16,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830993062] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:16,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:16,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:39:16,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139643517] [2022-01-19 04:39:16,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:16,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:39:16,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:16,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:39:16,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:39:16,056 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2022-01-19 04:39:16,056 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 118 transitions, 396 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:16,056 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:16,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2022-01-19 04:39:16,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:16,482 INFO L129 PetriNetUnfolder]: 808/2028 cut-off events. [2022-01-19 04:39:16,482 INFO L130 PetriNetUnfolder]: For 2434/2563 co-relation queries the response was YES. [2022-01-19 04:39:16,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5456 conditions, 2028 events. 808/2028 cut-off events. For 2434/2563 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14683 event pairs, 73 based on Foata normal form. 81/2049 useless extension candidates. Maximal degree in co-relation 5384. Up to 455 conditions per place. [2022-01-19 04:39:16,493 INFO L132 encePairwiseOnDemand]: 111/120 looper letters, 54 selfloop transitions, 19 changer transitions 28/188 dead transitions. [2022-01-19 04:39:16,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 188 transitions, 935 flow [2022-01-19 04:39:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:39:16,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:39:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1047 transitions. [2022-01-19 04:39:16,495 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8725 [2022-01-19 04:39:16,495 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1047 transitions. [2022-01-19 04:39:16,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1047 transitions. [2022-01-19 04:39:16,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:16,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1047 transitions. [2022-01-19 04:39:16,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.7) internal successors, (1047), 10 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:16,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:16,500 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:16,500 INFO L186 Difference]: Start difference. First operand has 132 places, 118 transitions, 396 flow. Second operand 10 states and 1047 transitions. [2022-01-19 04:39:16,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 188 transitions, 935 flow [2022-01-19 04:39:16,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 188 transitions, 924 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-01-19 04:39:16,508 INFO L242 Difference]: Finished difference. Result has 142 places, 127 transitions, 525 flow [2022-01-19 04:39:16,508 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=525, PETRI_PLACES=142, PETRI_TRANSITIONS=127} [2022-01-19 04:39:16,510 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 17 predicate places. [2022-01-19 04:39:16,510 INFO L470 AbstractCegarLoop]: Abstraction has has 142 places, 127 transitions, 525 flow [2022-01-19 04:39:16,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:16,510 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:16,511 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:39:16,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:39:16,512 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:16,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:16,512 INFO L85 PathProgramCache]: Analyzing trace with hash 919008771, now seen corresponding path program 1 times [2022-01-19 04:39:16,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:16,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495686968] [2022-01-19 04:39:16,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:16,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:16,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:16,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495686968] [2022-01-19 04:39:16,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495686968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:16,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:16,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:39:16,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304428937] [2022-01-19 04:39:16,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:16,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:39:16,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:16,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:39:16,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:39:16,673 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2022-01-19 04:39:16,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 127 transitions, 525 flow. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:16,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:16,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2022-01-19 04:39:16,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:17,065 INFO L129 PetriNetUnfolder]: 732/1774 cut-off events. [2022-01-19 04:39:17,065 INFO L130 PetriNetUnfolder]: For 3414/3564 co-relation queries the response was YES. [2022-01-19 04:39:17,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5414 conditions, 1774 events. 732/1774 cut-off events. For 3414/3564 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12894 event pairs, 68 based on Foata normal form. 36/1753 useless extension candidates. Maximal degree in co-relation 5391. Up to 420 conditions per place. [2022-01-19 04:39:17,077 INFO L132 encePairwiseOnDemand]: 111/120 looper letters, 43 selfloop transitions, 24 changer transitions 31/182 dead transitions. [2022-01-19 04:39:17,077 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 182 transitions, 981 flow [2022-01-19 04:39:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:39:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:39:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1331 transitions. [2022-01-19 04:39:17,080 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8532051282051282 [2022-01-19 04:39:17,080 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1331 transitions. [2022-01-19 04:39:17,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1331 transitions. [2022-01-19 04:39:17,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:17,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1331 transitions. [2022-01-19 04:39:17,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.38461538461539) internal successors, (1331), 13 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:17,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:17,084 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:17,084 INFO L186 Difference]: Start difference. First operand has 142 places, 127 transitions, 525 flow. Second operand 13 states and 1331 transitions. [2022-01-19 04:39:17,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 182 transitions, 981 flow [2022-01-19 04:39:17,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 182 transitions, 822 flow, removed 72 selfloop flow, removed 9 redundant places. [2022-01-19 04:39:17,107 INFO L242 Difference]: Finished difference. Result has 148 places, 124 transitions, 466 flow [2022-01-19 04:39:17,108 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=466, PETRI_PLACES=148, PETRI_TRANSITIONS=124} [2022-01-19 04:39:17,108 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 23 predicate places. [2022-01-19 04:39:17,108 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 124 transitions, 466 flow [2022-01-19 04:39:17,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:17,109 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:17,109 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:17,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:39:17,109 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:17,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash -568492, now seen corresponding path program 1 times [2022-01-19 04:39:17,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:17,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996390133] [2022-01-19 04:39:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:17,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:17,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:17,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996390133] [2022-01-19 04:39:17,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996390133] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:17,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:17,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 04:39:17,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757288530] [2022-01-19 04:39:17,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:17,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 04:39:17,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:17,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 04:39:17,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 04:39:17,235 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 120 [2022-01-19 04:39:17,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 124 transitions, 466 flow. Second operand has 8 states, 8 states have (on average 97.5) internal successors, (780), 8 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:17,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:17,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 120 [2022-01-19 04:39:17,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:17,479 INFO L129 PetriNetUnfolder]: 294/1476 cut-off events. [2022-01-19 04:39:17,480 INFO L130 PetriNetUnfolder]: For 1995/2035 co-relation queries the response was YES. [2022-01-19 04:39:17,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3560 conditions, 1476 events. 294/1476 cut-off events. For 1995/2035 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 13830 event pairs, 14 based on Foata normal form. 1/1435 useless extension candidates. Maximal degree in co-relation 3483. Up to 156 conditions per place. [2022-01-19 04:39:17,489 INFO L132 encePairwiseOnDemand]: 110/120 looper letters, 24 selfloop transitions, 9 changer transitions 11/147 dead transitions. [2022-01-19 04:39:17,489 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 147 transitions, 638 flow [2022-01-19 04:39:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:39:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:39:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 897 transitions. [2022-01-19 04:39:17,491 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8305555555555556 [2022-01-19 04:39:17,491 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 897 transitions. [2022-01-19 04:39:17,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 897 transitions. [2022-01-19 04:39:17,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:17,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 897 transitions. [2022-01-19 04:39:17,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.66666666666667) internal successors, (897), 9 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:17,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:17,494 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:17,494 INFO L186 Difference]: Start difference. First operand has 148 places, 124 transitions, 466 flow. Second operand 9 states and 897 transitions. [2022-01-19 04:39:17,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 147 transitions, 638 flow [2022-01-19 04:39:17,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 147 transitions, 590 flow, removed 10 selfloop flow, removed 10 redundant places. [2022-01-19 04:39:17,512 INFO L242 Difference]: Finished difference. Result has 147 places, 132 transitions, 502 flow [2022-01-19 04:39:17,512 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=147, PETRI_TRANSITIONS=132} [2022-01-19 04:39:17,512 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 22 predicate places. [2022-01-19 04:39:17,512 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 132 transitions, 502 flow [2022-01-19 04:39:17,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.5) internal successors, (780), 8 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:17,513 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:17,513 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:17,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:39:17,513 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:17,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:17,513 INFO L85 PathProgramCache]: Analyzing trace with hash 481010874, now seen corresponding path program 2 times [2022-01-19 04:39:17,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:17,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350717710] [2022-01-19 04:39:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:17,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:17,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:17,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350717710] [2022-01-19 04:39:17,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350717710] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:17,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:17,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 04:39:17,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707494378] [2022-01-19 04:39:17,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:17,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:39:17,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:17,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:39:17,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-19 04:39:17,707 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 120 [2022-01-19 04:39:17,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 132 transitions, 502 flow. Second operand has 11 states, 11 states have (on average 85.9090909090909) internal successors, (945), 11 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:17,708 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:17,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 120 [2022-01-19 04:39:17,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:18,039 INFO L129 PetriNetUnfolder]: 398/1836 cut-off events. [2022-01-19 04:39:18,039 INFO L130 PetriNetUnfolder]: For 1744/1747 co-relation queries the response was YES. [2022-01-19 04:39:18,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4528 conditions, 1836 events. 398/1836 cut-off events. For 1744/1747 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 17806 event pairs, 24 based on Foata normal form. 1/1799 useless extension candidates. Maximal degree in co-relation 4503. Up to 200 conditions per place. [2022-01-19 04:39:18,050 INFO L132 encePairwiseOnDemand]: 106/120 looper letters, 46 selfloop transitions, 11 changer transitions 15/160 dead transitions. [2022-01-19 04:39:18,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 160 transitions, 794 flow [2022-01-19 04:39:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 04:39:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 04:39:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1051 transitions. [2022-01-19 04:39:18,052 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7298611111111111 [2022-01-19 04:39:18,052 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1051 transitions. [2022-01-19 04:39:18,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1051 transitions. [2022-01-19 04:39:18,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:18,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1051 transitions. [2022-01-19 04:39:18,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 87.58333333333333) internal successors, (1051), 12 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:18,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 120.0) internal successors, (1560), 13 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:18,056 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 120.0) internal successors, (1560), 13 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:18,057 INFO L186 Difference]: Start difference. First operand has 147 places, 132 transitions, 502 flow. Second operand 12 states and 1051 transitions. [2022-01-19 04:39:18,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 160 transitions, 794 flow [2022-01-19 04:39:18,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 160 transitions, 750 flow, removed 22 selfloop flow, removed 7 redundant places. [2022-01-19 04:39:18,079 INFO L242 Difference]: Finished difference. Result has 151 places, 132 transitions, 514 flow [2022-01-19 04:39:18,079 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=514, PETRI_PLACES=151, PETRI_TRANSITIONS=132} [2022-01-19 04:39:18,080 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 26 predicate places. [2022-01-19 04:39:18,080 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 132 transitions, 514 flow [2022-01-19 04:39:18,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 85.9090909090909) internal successors, (945), 11 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:18,080 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:18,080 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:18,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 04:39:18,082 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:18,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:18,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1339963168, now seen corresponding path program 3 times [2022-01-19 04:39:18,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:18,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193443132] [2022-01-19 04:39:18,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:18,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:39:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:39:18,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:39:18,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193443132] [2022-01-19 04:39:18,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193443132] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:39:18,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:39:18,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:39:18,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525405359] [2022-01-19 04:39:18,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:39:18,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:39:18,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:39:18,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:39:18,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:39:18,180 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 120 [2022-01-19 04:39:18,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 132 transitions, 514 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:18,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:39:18,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 120 [2022-01-19 04:39:18,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:39:18,437 INFO L129 PetriNetUnfolder]: 447/2155 cut-off events. [2022-01-19 04:39:18,438 INFO L130 PetriNetUnfolder]: For 2028/2076 co-relation queries the response was YES. [2022-01-19 04:39:18,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5158 conditions, 2155 events. 447/2155 cut-off events. For 2028/2076 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 21799 event pairs, 41 based on Foata normal form. 5/2096 useless extension candidates. Maximal degree in co-relation 5134. Up to 195 conditions per place. [2022-01-19 04:39:18,448 INFO L132 encePairwiseOnDemand]: 114/120 looper letters, 26 selfloop transitions, 1 changer transitions 32/161 dead transitions. [2022-01-19 04:39:18,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 161 transitions, 805 flow [2022-01-19 04:39:18,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:39:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:39:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 703 transitions. [2022-01-19 04:39:18,450 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8369047619047619 [2022-01-19 04:39:18,450 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 703 transitions. [2022-01-19 04:39:18,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 703 transitions. [2022-01-19 04:39:18,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:39:18,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 703 transitions. [2022-01-19 04:39:18,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.42857142857143) internal successors, (703), 7 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:18,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:18,453 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:18,453 INFO L186 Difference]: Start difference. First operand has 151 places, 132 transitions, 514 flow. Second operand 7 states and 703 transitions. [2022-01-19 04:39:18,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 161 transitions, 805 flow [2022-01-19 04:39:18,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 161 transitions, 747 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-01-19 04:39:18,477 INFO L242 Difference]: Finished difference. Result has 147 places, 127 transitions, 466 flow [2022-01-19 04:39:18,477 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=466, PETRI_PLACES=147, PETRI_TRANSITIONS=127} [2022-01-19 04:39:18,478 INFO L334 CegarLoopForPetriNet]: 125 programPoint places, 22 predicate places. [2022-01-19 04:39:18,478 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 127 transitions, 466 flow [2022-01-19 04:39:18,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:39:18,478 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:39:18,478 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:39:18,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 04:39:18,479 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-19 04:39:18,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:39:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1655283286, now seen corresponding path program 4 times [2022-01-19 04:39:18,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:39:18,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30581420] [2022-01-19 04:39:18,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:39:18,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:39:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:39:18,511 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:39:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:39:18,565 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:39:18,565 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:39:18,566 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 04:39:18,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-19 04:39:18,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 04:39:18,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-19 04:39:18,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-19 04:39:18,567 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 04:39:18,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 04:39:18,569 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2022-01-19 04:39:18,573 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:39:18,573 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:39:18,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:39:18 BasicIcfg [2022-01-19 04:39:18,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:39:18,659 INFO L158 Benchmark]: Toolchain (without parser) took 6850.67ms. Allocated memory was 402.7MB in the beginning and 744.5MB in the end (delta: 341.8MB). Free memory was 347.2MB in the beginning and 309.1MB in the end (delta: 38.1MB). Peak memory consumption was 381.4MB. Max. memory is 16.0GB. [2022-01-19 04:39:18,659 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 402.7MB. Free memory is still 364.9MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:39:18,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.02ms. Allocated memory was 402.7MB in the beginning and 501.2MB in the end (delta: 98.6MB). Free memory was 347.0MB in the beginning and 460.7MB in the end (delta: -113.7MB). Peak memory consumption was 9.1MB. Max. memory is 16.0GB. [2022-01-19 04:39:18,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.63ms. Allocated memory is still 501.2MB. Free memory was 460.7MB in the beginning and 458.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:39:18,660 INFO L158 Benchmark]: Boogie Preprocessor took 49.13ms. Allocated memory is still 501.2MB. Free memory was 458.6MB in the beginning and 456.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:39:18,660 INFO L158 Benchmark]: RCFGBuilder took 661.87ms. Allocated memory is still 501.2MB. Free memory was 456.4MB in the beginning and 375.8MB in the end (delta: 80.6MB). Peak memory consumption was 79.7MB. Max. memory is 16.0GB. [2022-01-19 04:39:18,660 INFO L158 Benchmark]: TraceAbstraction took 5752.09ms. Allocated memory was 501.2MB in the beginning and 744.5MB in the end (delta: 243.3MB). Free memory was 374.7MB in the beginning and 309.1MB in the end (delta: 65.7MB). Peak memory consumption was 310.0MB. Max. memory is 16.0GB. [2022-01-19 04:39:18,661 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 402.7MB. Free memory is still 364.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 335.02ms. Allocated memory was 402.7MB in the beginning and 501.2MB in the end (delta: 98.6MB). Free memory was 347.0MB in the beginning and 460.7MB in the end (delta: -113.7MB). Peak memory consumption was 9.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.63ms. Allocated memory is still 501.2MB. Free memory was 460.7MB in the beginning and 458.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.13ms. Allocated memory is still 501.2MB. Free memory was 458.6MB in the beginning and 456.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 661.87ms. Allocated memory is still 501.2MB. Free memory was 456.4MB in the beginning and 375.8MB in the end (delta: 80.6MB). Peak memory consumption was 79.7MB. Max. memory is 16.0GB. * TraceAbstraction took 5752.09ms. Allocated memory was 501.2MB in the beginning and 744.5MB in the end (delta: 243.3MB). Free memory was 374.7MB in the beginning and 309.1MB in the end (delta: 65.7MB). Peak memory consumption was 310.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L717] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L719] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L720] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L721] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L723] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L728] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L729] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L730] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L731] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L732] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L733] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L738] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L739] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L740] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L741] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L742] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L743] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t62; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t62, ((void *)0), P0, ((void *)0))=-2, t62={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t63; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, t63={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t63, ((void *)0), P1, ((void *)0))=-1, t62={5:0}, t63={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff1 = z$w_buff0 [L750] 1 z$w_buff0 = 1 [L751] 1 z$w_buff1_used = z$w_buff0_used [L752] 1 z$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L754] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L755] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L756] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L757] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L758] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t64; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L850] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t64, ((void *)0), P2, ((void *)0))=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 z$flush_delayed = weak$$choice2 [L810] 3 z$mem_tmp = z [L811] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L811] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L812] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L812] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L812] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L812] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L813] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L813] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L813] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L813] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L814] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L814] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L814] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L814] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L815] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L816] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L816] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L816] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L817] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L817] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = z [L819] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L819] 3 z = z$flush_delayed ? z$mem_tmp : z [L820] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L791] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L791] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 846]: 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: 848]: 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, 149 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.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 493 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 493 mSDsluCounter, 570 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1044 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1341 IncrementalHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 122 mSDtfsCounter, 1341 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=525occurred in iteration=6, InterpolantAutomatonStates: 94, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 925 NumberOfCodeBlocks, 925 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 821 ConstructedInterpolants, 0 QuantifiedInterpolants, 4412 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:39:18,686 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...