/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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:11:31,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:11:31,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:11:31,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:11:31,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:11:31,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:11:31,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:11:31,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:11:31,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:11:31,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:11:31,227 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:11:31,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:11:31,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:11:31,228 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:11:31,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:11:31,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:11:31,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:11:31,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:11:31,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:11:31,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:11:31,230 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:11:31,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:11:31,231 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:11:31,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:11:31,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:11:31,232 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:11:31,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:11:31,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:11:31,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:11:31,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:11:31,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:11:31,234 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:11:31,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:11:31,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:11:31,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:11:31,235 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:11:31,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:11:31,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:11:31,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:11:31,540 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:11:31,540 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:11:31,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2023-08-26 12:11:32,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:11:32,971 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:11:32,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2023-08-26 12:11:32,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55703f1f/db59b64d0003496fba901e9c77a87ffa/FLAG44ef105dd [2023-08-26 12:11:33,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55703f1f/db59b64d0003496fba901e9c77a87ffa [2023-08-26 12:11:33,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:11:33,015 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:11:33,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:11:33,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:11:33,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:11:33,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7780f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33, skipping insertion in model container [2023-08-26 12:11:33,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,079 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:11:33,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:11:33,456 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:11:33,488 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:11:33,489 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:11:33,525 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:11:33,561 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:11:33,561 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:11:33,566 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:11:33,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33 WrapperNode [2023-08-26 12:11:33,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:11:33,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:11:33,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:11:33,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:11:33,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,625 INFO L138 Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2023-08-26 12:11:33,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:11:33,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:11:33,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:11:33,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:11:33,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,650 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:11:33,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:11:33,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:11:33,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:11:33,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (1/1) ... [2023-08-26 12:11:33,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:11:33,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:11:33,693 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) [2023-08-26 12:11:33,722 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 [2023-08-26 12:11:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:11:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:11:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:11:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:11:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:11:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:11:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:11:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:11:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:11:33,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:11:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:11:33,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:11:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:11:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:11:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:11:33,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:11:33,739 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:11:33,870 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:11:33,872 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:11:34,401 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:11:34,734 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:11:34,734 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:11:34,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:11:34 BoogieIcfgContainer [2023-08-26 12:11:34,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:11:34,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:11:34,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:11:34,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:11:34,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:11:33" (1/3) ... [2023-08-26 12:11:34,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51192d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:11:34, skipping insertion in model container [2023-08-26 12:11:34,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:11:33" (2/3) ... [2023-08-26 12:11:34,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51192d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:11:34, skipping insertion in model container [2023-08-26 12:11:34,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:11:34" (3/3) ... [2023-08-26 12:11:34,745 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.oepc-thin001_power.oepc.i [2023-08-26 12:11:34,763 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:11:34,763 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2023-08-26 12:11:34,763 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:11:34,893 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:11:34,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 163 transitions, 341 flow [2023-08-26 12:11:35,031 INFO L124 PetriNetUnfolderBase]: 3/160 cut-off events. [2023-08-26 12:11:35,032 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:11:35,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 160 events. 3/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 209 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-08-26 12:11:35,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 163 transitions, 341 flow [2023-08-26 12:11:35,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 160 transitions, 329 flow [2023-08-26 12:11:35,049 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:11:35,061 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 160 transitions, 329 flow [2023-08-26 12:11:35,064 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 160 transitions, 329 flow [2023-08-26 12:11:35,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 160 transitions, 329 flow [2023-08-26 12:11:35,121 INFO L124 PetriNetUnfolderBase]: 3/160 cut-off events. [2023-08-26 12:11:35,121 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:11:35,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 160 events. 3/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 209 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-08-26 12:11:35,126 INFO L119 LiptonReduction]: Number of co-enabled transitions 5090 [2023-08-26 12:11:44,080 INFO L134 LiptonReduction]: Checked pairs total: 18775 [2023-08-26 12:11:44,080 INFO L136 LiptonReduction]: Total number of compositions: 148 [2023-08-26 12:11:44,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:11:44,096 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5294b1d2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:11:44,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2023-08-26 12:11:44,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:11:44,099 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 12:11:44,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:11:44,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:44,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:11:44,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:44,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:44,104 INFO L85 PathProgramCache]: Analyzing trace with hash 932, now seen corresponding path program 1 times [2023-08-26 12:11:44,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:44,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084485623] [2023-08-26 12:11:44,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:44,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:44,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:44,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084485623] [2023-08-26 12:11:44,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084485623] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:44,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:44,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:11:44,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044508829] [2023-08-26 12:11:44,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:44,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:11:44,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:11:44,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:11:44,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 311 [2023-08-26 12:11:44,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 131 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 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) [2023-08-26 12:11:44,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:44,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 311 [2023-08-26 12:11:44,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:45,277 INFO L124 PetriNetUnfolderBase]: 4396/6539 cut-off events. [2023-08-26 12:11:45,277 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:11:45,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12933 conditions, 6539 events. 4396/6539 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 41347 event pairs, 4396 based on Foata normal form. 135/3653 useless extension candidates. Maximal degree in co-relation 12922. Up to 6348 conditions per place. [2023-08-26 12:11:45,321 INFO L140 encePairwiseOnDemand]: 290/311 looper letters, 35 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2023-08-26 12:11:45,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 159 flow [2023-08-26 12:11:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:11:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:11:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 308 transitions. [2023-08-26 12:11:45,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49517684887459806 [2023-08-26 12:11:45,333 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 308 transitions. [2023-08-26 12:11:45,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 308 transitions. [2023-08-26 12:11:45,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:45,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 308 transitions. [2023-08-26 12:11:45,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 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) [2023-08-26 12:11:45,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 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) [2023-08-26 12:11:45,343 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 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) [2023-08-26 12:11:45,344 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 131 flow. Second operand 2 states and 308 transitions. [2023-08-26 12:11:45,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 159 flow [2023-08-26 12:11:45,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:11:45,350 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2023-08-26 12:11:45,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-26 12:11:45,355 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -22 predicate places. [2023-08-26 12:11:45,355 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2023-08-26 12:11:45,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 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) [2023-08-26 12:11:45,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:45,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:11:45,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:11:45,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:45,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash 920670, now seen corresponding path program 1 times [2023-08-26 12:11:45,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:45,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988387065] [2023-08-26 12:11:45,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:45,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:45,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:45,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988387065] [2023-08-26 12:11:45,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988387065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:45,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:45,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:11:45,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159652167] [2023-08-26 12:11:45,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:45,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:11:45,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:45,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:11:45,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:11:45,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 311 [2023-08-26 12:11:45,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2023-08-26 12:11:45,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:45,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 311 [2023-08-26 12:11:45,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:46,462 INFO L124 PetriNetUnfolderBase]: 3806/5707 cut-off events. [2023-08-26 12:11:46,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:11:46,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11387 conditions, 5707 events. 3806/5707 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 33635 event pairs, 2723 based on Foata normal form. 0/3893 useless extension candidates. Maximal degree in co-relation 11384. Up to 4008 conditions per place. [2023-08-26 12:11:46,499 INFO L140 encePairwiseOnDemand]: 298/311 looper letters, 43 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2023-08-26 12:11:46,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 210 flow [2023-08-26 12:11:46,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-08-26 12:11:46,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39764201500535906 [2023-08-26 12:11:46,505 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-08-26 12:11:46,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-08-26 12:11:46,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:46,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-08-26 12:11:46,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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) [2023-08-26 12:11:46,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 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) [2023-08-26 12:11:46,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 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) [2023-08-26 12:11:46,512 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 371 transitions. [2023-08-26 12:11:46,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 210 flow [2023-08-26 12:11:46,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:11:46,518 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 138 flow [2023-08-26 12:11:46,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-08-26 12:11:46,519 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -20 predicate places. [2023-08-26 12:11:46,519 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 138 flow [2023-08-26 12:11:46,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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) [2023-08-26 12:11:46,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:46,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:11:46,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:11:46,524 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:46,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:46,526 INFO L85 PathProgramCache]: Analyzing trace with hash 920671, now seen corresponding path program 1 times [2023-08-26 12:11:46,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:46,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811838866] [2023-08-26 12:11:46,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:46,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:46,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:46,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811838866] [2023-08-26 12:11:46,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811838866] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:46,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:46,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:11:46,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075904828] [2023-08-26 12:11:46,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:46,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:11:46,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:46,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:11:46,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:11:46,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 311 [2023-08-26 12:11:46,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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) [2023-08-26 12:11:46,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:46,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 311 [2023-08-26 12:11:46,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:47,076 INFO L124 PetriNetUnfolderBase]: 1585/2511 cut-off events. [2023-08-26 12:11:47,077 INFO L125 PetriNetUnfolderBase]: For 626/635 co-relation queries the response was YES. [2023-08-26 12:11:47,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6320 conditions, 2511 events. 1585/2511 cut-off events. For 626/635 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 14075 event pairs, 1372 based on Foata normal form. 360/2651 useless extension candidates. Maximal degree in co-relation 6315. Up to 2423 conditions per place. [2023-08-26 12:11:47,091 INFO L140 encePairwiseOnDemand]: 304/311 looper letters, 32 selfloop transitions, 1 changer transitions 1/37 dead transitions. [2023-08-26 12:11:47,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 194 flow [2023-08-26 12:11:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-26 12:11:47,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3879957127545552 [2023-08-26 12:11:47,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-26 12:11:47,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-26 12:11:47,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:47,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-26 12:11:47,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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) [2023-08-26 12:11:47,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 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) [2023-08-26 12:11:47,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 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) [2023-08-26 12:11:47,098 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 138 flow. Second operand 3 states and 362 transitions. [2023-08-26 12:11:47,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 194 flow [2023-08-26 12:11:47,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:47,107 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 112 flow [2023-08-26 12:11:47,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-08-26 12:11:47,108 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -26 predicate places. [2023-08-26 12:11:47,109 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 112 flow [2023-08-26 12:11:47,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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) [2023-08-26 12:11:47,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:47,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:47,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:11:47,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:47,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:47,113 INFO L85 PathProgramCache]: Analyzing trace with hash -122995441, now seen corresponding path program 1 times [2023-08-26 12:11:47,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:47,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836563730] [2023-08-26 12:11:47,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:47,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:47,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:47,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836563730] [2023-08-26 12:11:47,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836563730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:47,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:47,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:11:47,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739791418] [2023-08-26 12:11:47,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:47,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:11:47,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:47,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:11:47,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:11:47,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 311 [2023-08-26 12:11:47,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2023-08-26 12:11:47,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:47,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 311 [2023-08-26 12:11:47,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:47,658 INFO L124 PetriNetUnfolderBase]: 1284/2140 cut-off events. [2023-08-26 12:11:47,658 INFO L125 PetriNetUnfolderBase]: For 352/431 co-relation queries the response was YES. [2023-08-26 12:11:47,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5020 conditions, 2140 events. 1284/2140 cut-off events. For 352/431 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 12387 event pairs, 526 based on Foata normal form. 22/1858 useless extension candidates. Maximal degree in co-relation 5015. Up to 1352 conditions per place. [2023-08-26 12:11:47,673 INFO L140 encePairwiseOnDemand]: 307/311 looper letters, 48 selfloop transitions, 3 changer transitions 1/58 dead transitions. [2023-08-26 12:11:47,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 280 flow [2023-08-26 12:11:47,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-26 12:11:47,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45230439442658094 [2023-08-26 12:11:47,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-26 12:11:47,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-26 12:11:47,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:47,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-26 12:11:47,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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) [2023-08-26 12:11:47,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 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) [2023-08-26 12:11:47,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 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) [2023-08-26 12:11:47,680 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 112 flow. Second operand 3 states and 422 transitions. [2023-08-26 12:11:47,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 280 flow [2023-08-26 12:11:47,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:11:47,682 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 124 flow [2023-08-26 12:11:47,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-26 12:11:47,683 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -25 predicate places. [2023-08-26 12:11:47,684 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 124 flow [2023-08-26 12:11:47,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2023-08-26 12:11:47,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:47,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:47,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:11:47,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:47,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash -122995147, now seen corresponding path program 1 times [2023-08-26 12:11:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:47,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764539572] [2023-08-26 12:11:47,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:47,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:47,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764539572] [2023-08-26 12:11:47,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764539572] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:47,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:47,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:11:47,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936911310] [2023-08-26 12:11:47,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:47,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:11:47,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:47,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:11:47,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:11:47,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 311 [2023-08-26 12:11:47,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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) [2023-08-26 12:11:47,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:47,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 311 [2023-08-26 12:11:47,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:48,277 INFO L124 PetriNetUnfolderBase]: 1303/2267 cut-off events. [2023-08-26 12:11:48,277 INFO L125 PetriNetUnfolderBase]: For 933/1049 co-relation queries the response was YES. [2023-08-26 12:11:48,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5606 conditions, 2267 events. 1303/2267 cut-off events. For 933/1049 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 14683 event pairs, 241 based on Foata normal form. 24/2111 useless extension candidates. Maximal degree in co-relation 5600. Up to 1506 conditions per place. [2023-08-26 12:11:48,287 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 50 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-26 12:11:48,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 306 flow [2023-08-26 12:11:48,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-26 12:11:48,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44694533762057875 [2023-08-26 12:11:48,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-26 12:11:48,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-26 12:11:48,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:48,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-26 12:11:48,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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) [2023-08-26 12:11:48,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 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) [2023-08-26 12:11:48,293 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 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) [2023-08-26 12:11:48,293 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 124 flow. Second operand 3 states and 417 transitions. [2023-08-26 12:11:48,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 306 flow [2023-08-26 12:11:48,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:48,295 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 126 flow [2023-08-26 12:11:48,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-26 12:11:48,296 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -24 predicate places. [2023-08-26 12:11:48,296 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 126 flow [2023-08-26 12:11:48,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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) [2023-08-26 12:11:48,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:48,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:48,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:11:48,297 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:48,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:48,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1016097322, now seen corresponding path program 1 times [2023-08-26 12:11:48,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:48,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970917318] [2023-08-26 12:11:48,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:48,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:48,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:48,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970917318] [2023-08-26 12:11:48,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970917318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:48,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:48,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:11:48,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083642178] [2023-08-26 12:11:48,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:48,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:11:48,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:48,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:11:48,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:11:48,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 311 [2023-08-26 12:11:48,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 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) [2023-08-26 12:11:48,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:48,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 311 [2023-08-26 12:11:48,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:48,844 INFO L124 PetriNetUnfolderBase]: 1382/2300 cut-off events. [2023-08-26 12:11:48,844 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2023-08-26 12:11:48,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6156 conditions, 2300 events. 1382/2300 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 13728 event pairs, 405 based on Foata normal form. 0/2119 useless extension candidates. Maximal degree in co-relation 6149. Up to 976 conditions per place. [2023-08-26 12:11:48,856 INFO L140 encePairwiseOnDemand]: 304/311 looper letters, 56 selfloop transitions, 6 changer transitions 2/66 dead transitions. [2023-08-26 12:11:48,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 348 flow [2023-08-26 12:11:48,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-08-26 12:11:48,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38263665594855306 [2023-08-26 12:11:48,858 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-08-26 12:11:48,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-08-26 12:11:48,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:48,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-08-26 12:11:48,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 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) [2023-08-26 12:11:48,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 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) [2023-08-26 12:11:48,863 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 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) [2023-08-26 12:11:48,863 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 126 flow. Second operand 4 states and 476 transitions. [2023-08-26 12:11:48,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 348 flow [2023-08-26 12:11:48,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:48,865 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 166 flow [2023-08-26 12:11:48,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-08-26 12:11:48,866 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -22 predicate places. [2023-08-26 12:11:48,866 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 166 flow [2023-08-26 12:11:48,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 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) [2023-08-26 12:11:48,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:48,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:48,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:11:48,867 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:48,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash 482116259, now seen corresponding path program 1 times [2023-08-26 12:11:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:48,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816153532] [2023-08-26 12:11:48,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:48,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:49,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:49,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816153532] [2023-08-26 12:11:49,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816153532] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:49,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:49,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:11:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571161882] [2023-08-26 12:11:49,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:49,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:11:49,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:49,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:11:49,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:11:49,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 311 [2023-08-26 12:11:49,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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) [2023-08-26 12:11:49,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:49,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 311 [2023-08-26 12:11:49,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:49,379 INFO L124 PetriNetUnfolderBase]: 1220/2030 cut-off events. [2023-08-26 12:11:49,379 INFO L125 PetriNetUnfolderBase]: For 1695/1758 co-relation queries the response was YES. [2023-08-26 12:11:49,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5767 conditions, 2030 events. 1220/2030 cut-off events. For 1695/1758 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 11342 event pairs, 503 based on Foata normal form. 81/2069 useless extension candidates. Maximal degree in co-relation 5758. Up to 1241 conditions per place. [2023-08-26 12:11:49,390 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 50 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2023-08-26 12:11:49,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 327 flow [2023-08-26 12:11:49,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-26 12:11:49,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.387459807073955 [2023-08-26 12:11:49,392 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-26 12:11:49,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-26 12:11:49,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:49,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-26 12:11:49,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 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) [2023-08-26 12:11:49,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 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) [2023-08-26 12:11:49,397 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 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) [2023-08-26 12:11:49,397 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 166 flow. Second operand 4 states and 482 transitions. [2023-08-26 12:11:49,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 327 flow [2023-08-26 12:11:49,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:49,405 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 163 flow [2023-08-26 12:11:49,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-26 12:11:49,405 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -22 predicate places. [2023-08-26 12:11:49,406 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 163 flow [2023-08-26 12:11:49,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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) [2023-08-26 12:11:49,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:49,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:49,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:11:49,406 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:49,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash 185715384, now seen corresponding path program 1 times [2023-08-26 12:11:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:49,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164419940] [2023-08-26 12:11:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:49,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:49,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164419940] [2023-08-26 12:11:49,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164419940] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:49,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:49,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:11:49,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152630200] [2023-08-26 12:11:49,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:49,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:11:49,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:49,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:11:49,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:11:49,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 311 [2023-08-26 12:11:49,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 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) [2023-08-26 12:11:49,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:49,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 311 [2023-08-26 12:11:49,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:49,894 INFO L124 PetriNetUnfolderBase]: 1108/1869 cut-off events. [2023-08-26 12:11:49,895 INFO L125 PetriNetUnfolderBase]: For 1488/1506 co-relation queries the response was YES. [2023-08-26 12:11:49,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5375 conditions, 1869 events. 1108/1869 cut-off events. For 1488/1506 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 10685 event pairs, 286 based on Foata normal form. 9/1830 useless extension candidates. Maximal degree in co-relation 5367. Up to 1409 conditions per place. [2023-08-26 12:11:49,903 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 41 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-26 12:11:49,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 306 flow [2023-08-26 12:11:49,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-26 12:11:49,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4362272240085745 [2023-08-26 12:11:49,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-26 12:11:49,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-26 12:11:49,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:49,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-26 12:11:49,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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) [2023-08-26 12:11:49,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 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) [2023-08-26 12:11:49,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 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) [2023-08-26 12:11:49,908 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 163 flow. Second operand 3 states and 407 transitions. [2023-08-26 12:11:49,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 306 flow [2023-08-26 12:11:49,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 51 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:49,914 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 167 flow [2023-08-26 12:11:49,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-26 12:11:49,915 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -21 predicate places. [2023-08-26 12:11:49,915 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 167 flow [2023-08-26 12:11:49,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 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) [2023-08-26 12:11:49,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:49,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:49,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:11:49,916 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:49,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1462208700, now seen corresponding path program 1 times [2023-08-26 12:11:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:49,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608627001] [2023-08-26 12:11:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:50,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:50,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608627001] [2023-08-26 12:11:50,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608627001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:50,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:50,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:11:50,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441819337] [2023-08-26 12:11:50,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:50,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:11:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:50,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:11:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:11:50,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 311 [2023-08-26 12:11:50,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 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) [2023-08-26 12:11:50,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:50,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 311 [2023-08-26 12:11:50,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:50,479 INFO L124 PetriNetUnfolderBase]: 1821/3078 cut-off events. [2023-08-26 12:11:50,479 INFO L125 PetriNetUnfolderBase]: For 2270/2442 co-relation queries the response was YES. [2023-08-26 12:11:50,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8636 conditions, 3078 events. 1821/3078 cut-off events. For 2270/2442 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 19954 event pairs, 593 based on Foata normal form. 106/3082 useless extension candidates. Maximal degree in co-relation 8627. Up to 1091 conditions per place. [2023-08-26 12:11:50,496 INFO L140 encePairwiseOnDemand]: 307/311 looper letters, 65 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-08-26 12:11:50,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 434 flow [2023-08-26 12:11:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-26 12:11:50,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4405144694533762 [2023-08-26 12:11:50,498 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-26 12:11:50,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-26 12:11:50,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:50,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-26 12:11:50,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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) [2023-08-26 12:11:50,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 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) [2023-08-26 12:11:50,502 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 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) [2023-08-26 12:11:50,502 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 167 flow. Second operand 4 states and 548 transitions. [2023-08-26 12:11:50,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 434 flow [2023-08-26 12:11:50,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:50,510 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 182 flow [2023-08-26 12:11:50,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-26 12:11:50,511 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -18 predicate places. [2023-08-26 12:11:50,511 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 182 flow [2023-08-26 12:11:50,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 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) [2023-08-26 12:11:50,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:50,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:50,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:11:50,511 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:50,512 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:50,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2060760949, now seen corresponding path program 1 times [2023-08-26 12:11:50,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:50,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992086781] [2023-08-26 12:11:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:50,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:50,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:50,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992086781] [2023-08-26 12:11:50,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992086781] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:50,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:50,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:11:50,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841570677] [2023-08-26 12:11:50,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:50,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:11:50,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:50,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:11:50,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:11:50,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 311 [2023-08-26 12:11:50,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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) [2023-08-26 12:11:50,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:50,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 311 [2023-08-26 12:11:50,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:50,985 INFO L124 PetriNetUnfolderBase]: 1550/2529 cut-off events. [2023-08-26 12:11:50,986 INFO L125 PetriNetUnfolderBase]: For 1734/1742 co-relation queries the response was YES. [2023-08-26 12:11:50,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7761 conditions, 2529 events. 1550/2529 cut-off events. For 1734/1742 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14800 event pairs, 817 based on Foata normal form. 49/2543 useless extension candidates. Maximal degree in co-relation 7750. Up to 1207 conditions per place. [2023-08-26 12:11:50,998 INFO L140 encePairwiseOnDemand]: 301/311 looper letters, 46 selfloop transitions, 10 changer transitions 0/58 dead transitions. [2023-08-26 12:11:50,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 58 transitions, 376 flow [2023-08-26 12:11:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2023-08-26 12:11:51,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3665594855305466 [2023-08-26 12:11:51,000 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 456 transitions. [2023-08-26 12:11:51,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions. [2023-08-26 12:11:51,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:51,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions. [2023-08-26 12:11:51,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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) [2023-08-26 12:11:51,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 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) [2023-08-26 12:11:51,004 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 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) [2023-08-26 12:11:51,004 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 182 flow. Second operand 4 states and 456 transitions. [2023-08-26 12:11:51,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 58 transitions, 376 flow [2023-08-26 12:11:51,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 58 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:51,014 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 255 flow [2023-08-26 12:11:51,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-26 12:11:51,016 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -15 predicate places. [2023-08-26 12:11:51,016 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 255 flow [2023-08-26 12:11:51,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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) [2023-08-26 12:11:51,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:51,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:51,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:11:51,017 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:51,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:51,018 INFO L85 PathProgramCache]: Analyzing trace with hash -540920392, now seen corresponding path program 1 times [2023-08-26 12:11:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443446571] [2023-08-26 12:11:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:51,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:51,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443446571] [2023-08-26 12:11:51,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443446571] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:51,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:51,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:11:51,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287755631] [2023-08-26 12:11:51,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:51,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:11:51,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:51,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:11:51,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:11:51,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 311 [2023-08-26 12:11:51,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 255 flow. Second operand has 8 states, 8 states have (on average 98.75) internal successors, (790), 8 states have internal predecessors, (790), 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) [2023-08-26 12:11:51,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:51,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 311 [2023-08-26 12:11:51,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:51,810 INFO L124 PetriNetUnfolderBase]: 1351/2351 cut-off events. [2023-08-26 12:11:51,810 INFO L125 PetriNetUnfolderBase]: For 3082/3086 co-relation queries the response was YES. [2023-08-26 12:11:51,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7392 conditions, 2351 events. 1351/2351 cut-off events. For 3082/3086 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 14394 event pairs, 140 based on Foata normal form. 45/2380 useless extension candidates. Maximal degree in co-relation 7380. Up to 989 conditions per place. [2023-08-26 12:11:51,822 INFO L140 encePairwiseOnDemand]: 299/311 looper letters, 72 selfloop transitions, 16 changer transitions 4/94 dead transitions. [2023-08-26 12:11:51,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 689 flow [2023-08-26 12:11:51,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:11:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:11:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 750 transitions. [2023-08-26 12:11:51,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34451079467156637 [2023-08-26 12:11:51,825 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 750 transitions. [2023-08-26 12:11:51,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 750 transitions. [2023-08-26 12:11:51,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:51,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 750 transitions. [2023-08-26 12:11:51,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 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) [2023-08-26 12:11:51,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 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) [2023-08-26 12:11:51,830 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 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) [2023-08-26 12:11:51,830 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 255 flow. Second operand 7 states and 750 transitions. [2023-08-26 12:11:51,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 689 flow [2023-08-26 12:11:51,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:11:51,839 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 390 flow [2023-08-26 12:11:51,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=390, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-08-26 12:11:51,840 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2023-08-26 12:11:51,840 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 390 flow [2023-08-26 12:11:51,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.75) internal successors, (790), 8 states have internal predecessors, (790), 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) [2023-08-26 12:11:51,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:51,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:51,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:11:51,841 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:51,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:51,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2056648953, now seen corresponding path program 1 times [2023-08-26 12:11:51,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:51,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85073518] [2023-08-26 12:11:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:52,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:52,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85073518] [2023-08-26 12:11:52,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85073518] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:52,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:52,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:11:52,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025523356] [2023-08-26 12:11:52,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:52,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:11:52,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:11:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:11:52,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 311 [2023-08-26 12:11:52,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 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) [2023-08-26 12:11:52,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:52,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 311 [2023-08-26 12:11:52,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:52,603 INFO L124 PetriNetUnfolderBase]: 2141/3616 cut-off events. [2023-08-26 12:11:52,603 INFO L125 PetriNetUnfolderBase]: For 9853/10097 co-relation queries the response was YES. [2023-08-26 12:11:52,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12759 conditions, 3616 events. 2141/3616 cut-off events. For 9853/10097 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 23422 event pairs, 468 based on Foata normal form. 156/3693 useless extension candidates. Maximal degree in co-relation 12744. Up to 1403 conditions per place. [2023-08-26 12:11:52,619 INFO L140 encePairwiseOnDemand]: 307/311 looper letters, 87 selfloop transitions, 3 changer transitions 0/100 dead transitions. [2023-08-26 12:11:52,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 100 transitions, 947 flow [2023-08-26 12:11:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2023-08-26 12:11:52,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43729903536977494 [2023-08-26 12:11:52,621 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2023-08-26 12:11:52,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2023-08-26 12:11:52,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:52,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2023-08-26 12:11:52,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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) [2023-08-26 12:11:52,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 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) [2023-08-26 12:11:52,625 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 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) [2023-08-26 12:11:52,625 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 390 flow. Second operand 4 states and 544 transitions. [2023-08-26 12:11:52,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 100 transitions, 947 flow [2023-08-26 12:11:52,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 924 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:52,652 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 398 flow [2023-08-26 12:11:52,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=398, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2023-08-26 12:11:52,653 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2023-08-26 12:11:52,653 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 398 flow [2023-08-26 12:11:52,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 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) [2023-08-26 12:11:52,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:52,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:52,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:11:52,654 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:52,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:52,654 INFO L85 PathProgramCache]: Analyzing trace with hash 411339668, now seen corresponding path program 1 times [2023-08-26 12:11:52,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:52,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956163212] [2023-08-26 12:11:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:52,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:53,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:53,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956163212] [2023-08-26 12:11:53,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956163212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:53,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:53,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:11:53,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840634514] [2023-08-26 12:11:53,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:53,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:11:53,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:53,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:11:53,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:11:53,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 311 [2023-08-26 12:11:53,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 398 flow. Second operand has 9 states, 9 states have (on average 97.66666666666667) internal successors, (879), 9 states have internal predecessors, (879), 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) [2023-08-26 12:11:53,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:53,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 311 [2023-08-26 12:11:53,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:53,508 INFO L124 PetriNetUnfolderBase]: 1906/3081 cut-off events. [2023-08-26 12:11:53,509 INFO L125 PetriNetUnfolderBase]: For 5553/5570 co-relation queries the response was YES. [2023-08-26 12:11:53,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11040 conditions, 3081 events. 1906/3081 cut-off events. For 5553/5570 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 17886 event pairs, 194 based on Foata normal form. 86/3167 useless extension candidates. Maximal degree in co-relation 11022. Up to 1571 conditions per place. [2023-08-26 12:11:53,518 INFO L140 encePairwiseOnDemand]: 301/311 looper letters, 25 selfloop transitions, 4 changer transitions 57/88 dead transitions. [2023-08-26 12:11:53,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 754 flow [2023-08-26 12:11:53,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:11:53,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:11:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 826 transitions. [2023-08-26 12:11:53,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3319935691318328 [2023-08-26 12:11:53,522 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 826 transitions. [2023-08-26 12:11:53,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 826 transitions. [2023-08-26 12:11:53,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:53,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 826 transitions. [2023-08-26 12:11:53,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.25) internal successors, (826), 8 states have internal predecessors, (826), 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) [2023-08-26 12:11:53,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 311.0) internal successors, (2799), 9 states have internal predecessors, (2799), 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) [2023-08-26 12:11:53,527 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 311.0) internal successors, (2799), 9 states have internal predecessors, (2799), 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) [2023-08-26 12:11:53,528 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 398 flow. Second operand 8 states and 826 transitions. [2023-08-26 12:11:53,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 754 flow [2023-08-26 12:11:53,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 711 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-26 12:11:53,562 INFO L231 Difference]: Finished difference. Result has 64 places, 21 transitions, 101 flow [2023-08-26 12:11:53,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=101, PETRI_PLACES=64, PETRI_TRANSITIONS=21} [2023-08-26 12:11:53,562 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -6 predicate places. [2023-08-26 12:11:53,562 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 21 transitions, 101 flow [2023-08-26 12:11:53,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 97.66666666666667) internal successors, (879), 9 states have internal predecessors, (879), 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) [2023-08-26 12:11:53,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:53,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:53,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:11:53,563 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:53,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1588008751, now seen corresponding path program 1 times [2023-08-26 12:11:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:53,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94160795] [2023-08-26 12:11:53,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:53,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:54,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:54,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94160795] [2023-08-26 12:11:54,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94160795] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:54,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:54,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:11:54,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761229592] [2023-08-26 12:11:54,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:54,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:11:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:54,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:11:54,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:11:54,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 311 [2023-08-26 12:11:54,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 21 transitions, 101 flow. Second operand has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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) [2023-08-26 12:11:54,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:54,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 311 [2023-08-26 12:11:54,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:54,742 INFO L124 PetriNetUnfolderBase]: 226/402 cut-off events. [2023-08-26 12:11:54,742 INFO L125 PetriNetUnfolderBase]: For 400/400 co-relation queries the response was YES. [2023-08-26 12:11:54,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 402 events. 226/402 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1483 event pairs, 118 based on Foata normal form. 4/404 useless extension candidates. Maximal degree in co-relation 1169. Up to 276 conditions per place. [2023-08-26 12:11:54,744 INFO L140 encePairwiseOnDemand]: 304/311 looper letters, 31 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2023-08-26 12:11:54,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 40 transitions, 247 flow [2023-08-26 12:11:54,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:11:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:11:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2023-08-26 12:11:54,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3135048231511254 [2023-08-26 12:11:54,747 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 585 transitions. [2023-08-26 12:11:54,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 585 transitions. [2023-08-26 12:11:54,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:54,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 585 transitions. [2023-08-26 12:11:54,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:54,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 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) [2023-08-26 12:11:54,751 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 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) [2023-08-26 12:11:54,751 INFO L175 Difference]: Start difference. First operand has 64 places, 21 transitions, 101 flow. Second operand 6 states and 585 transitions. [2023-08-26 12:11:54,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 40 transitions, 247 flow [2023-08-26 12:11:54,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 190 flow, removed 9 selfloop flow, removed 15 redundant places. [2023-08-26 12:11:54,753 INFO L231 Difference]: Finished difference. Result has 49 places, 27 transitions, 113 flow [2023-08-26 12:11:54,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=113, PETRI_PLACES=49, PETRI_TRANSITIONS=27} [2023-08-26 12:11:54,753 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -21 predicate places. [2023-08-26 12:11:54,753 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 27 transitions, 113 flow [2023-08-26 12:11:54,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.75) internal successors, (742), 8 states have internal predecessors, (742), 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) [2023-08-26 12:11:54,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:54,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:54,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:11:54,754 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:54,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash 947655541, now seen corresponding path program 2 times [2023-08-26 12:11:54,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:54,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615812490] [2023-08-26 12:11:54,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:55,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:55,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615812490] [2023-08-26 12:11:55,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615812490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:55,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:55,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:11:55,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346387906] [2023-08-26 12:11:55,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:55,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:11:55,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:55,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:11:55,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:11:55,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 311 [2023-08-26 12:11:55,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 27 transitions, 113 flow. Second operand has 9 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 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) [2023-08-26 12:11:55,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:55,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 311 [2023-08-26 12:11:55,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:55,876 INFO L124 PetriNetUnfolderBase]: 287/508 cut-off events. [2023-08-26 12:11:55,877 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2023-08-26 12:11:55,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 508 events. 287/508 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2079 event pairs, 68 based on Foata normal form. 4/512 useless extension candidates. Maximal degree in co-relation 1321. Up to 257 conditions per place. [2023-08-26 12:11:55,879 INFO L140 encePairwiseOnDemand]: 304/311 looper letters, 31 selfloop transitions, 12 changer transitions 0/45 dead transitions. [2023-08-26 12:11:55,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 260 flow [2023-08-26 12:11:55,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:11:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:11:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 691 transitions. [2023-08-26 12:11:55,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31740927882406983 [2023-08-26 12:11:55,882 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 691 transitions. [2023-08-26 12:11:55,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 691 transitions. [2023-08-26 12:11:55,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:55,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 691 transitions. [2023-08-26 12:11:55,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 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) [2023-08-26 12:11:55,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 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) [2023-08-26 12:11:55,887 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 311.0) internal successors, (2488), 8 states have internal predecessors, (2488), 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) [2023-08-26 12:11:55,887 INFO L175 Difference]: Start difference. First operand has 49 places, 27 transitions, 113 flow. Second operand 7 states and 691 transitions. [2023-08-26 12:11:55,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 260 flow [2023-08-26 12:11:55,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:11:55,889 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 183 flow [2023-08-26 12:11:55,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=183, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2023-08-26 12:11:55,889 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -13 predicate places. [2023-08-26 12:11:55,890 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 183 flow [2023-08-26 12:11:55,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 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) [2023-08-26 12:11:55,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:55,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:55,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:11:55,890 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:55,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:55,891 INFO L85 PathProgramCache]: Analyzing trace with hash -974235693, now seen corresponding path program 3 times [2023-08-26 12:11:55,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:55,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615866079] [2023-08-26 12:11:55,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:56,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:56,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615866079] [2023-08-26 12:11:56,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615866079] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:56,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:56,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:11:56,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026894993] [2023-08-26 12:11:56,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:56,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:11:56,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:56,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:11:56,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:11:56,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 311 [2023-08-26 12:11:56,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 183 flow. Second operand has 9 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 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) [2023-08-26 12:11:56,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:56,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 311 [2023-08-26 12:11:56,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:57,042 INFO L124 PetriNetUnfolderBase]: 279/496 cut-off events. [2023-08-26 12:11:57,042 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-08-26 12:11:57,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 496 events. 279/496 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2008 event pairs, 104 based on Foata normal form. 4/498 useless extension candidates. Maximal degree in co-relation 1410. Up to 290 conditions per place. [2023-08-26 12:11:57,045 INFO L140 encePairwiseOnDemand]: 305/311 looper letters, 30 selfloop transitions, 14 changer transitions 0/46 dead transitions. [2023-08-26 12:11:57,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 46 transitions, 311 flow [2023-08-26 12:11:57,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:11:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:11:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 782 transitions. [2023-08-26 12:11:57,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31430868167202575 [2023-08-26 12:11:57,048 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 782 transitions. [2023-08-26 12:11:57,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 782 transitions. [2023-08-26 12:11:57,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:57,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 782 transitions. [2023-08-26 12:11:57,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 97.75) internal successors, (782), 8 states have internal predecessors, (782), 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) [2023-08-26 12:11:57,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 311.0) internal successors, (2799), 9 states have internal predecessors, (2799), 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) [2023-08-26 12:11:57,053 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 311.0) internal successors, (2799), 9 states have internal predecessors, (2799), 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) [2023-08-26 12:11:57,053 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 183 flow. Second operand 8 states and 782 transitions. [2023-08-26 12:11:57,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 46 transitions, 311 flow [2023-08-26 12:11:57,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 46 transitions, 294 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:57,055 INFO L231 Difference]: Finished difference. Result has 63 places, 34 transitions, 213 flow [2023-08-26 12:11:57,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=63, PETRI_TRANSITIONS=34} [2023-08-26 12:11:57,055 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2023-08-26 12:11:57,055 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 34 transitions, 213 flow [2023-08-26 12:11:57,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 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) [2023-08-26 12:11:57,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:57,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:57,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:11:57,056 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:57,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:57,057 INFO L85 PathProgramCache]: Analyzing trace with hash 308073059, now seen corresponding path program 1 times [2023-08-26 12:11:57,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:57,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003641002] [2023-08-26 12:11:57,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:57,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:57,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:57,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003641002] [2023-08-26 12:11:57,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003641002] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:57,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:57,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:11:57,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073247851] [2023-08-26 12:11:57,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:57,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:11:57,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:57,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:11:57,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:11:57,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 311 [2023-08-26 12:11:57,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 34 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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) [2023-08-26 12:11:57,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:57,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 311 [2023-08-26 12:11:57,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:57,267 INFO L124 PetriNetUnfolderBase]: 179/358 cut-off events. [2023-08-26 12:11:57,267 INFO L125 PetriNetUnfolderBase]: For 392/392 co-relation queries the response was YES. [2023-08-26 12:11:57,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 358 events. 179/358 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1526 event pairs, 48 based on Foata normal form. 11/364 useless extension candidates. Maximal degree in co-relation 1025. Up to 297 conditions per place. [2023-08-26 12:11:57,269 INFO L140 encePairwiseOnDemand]: 306/311 looper letters, 40 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-08-26 12:11:57,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 49 transitions, 375 flow [2023-08-26 12:11:57,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-26 12:11:57,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42229367631296894 [2023-08-26 12:11:57,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-26 12:11:57,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-26 12:11:57,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:57,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-26 12:11:57,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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) [2023-08-26 12:11:57,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 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) [2023-08-26 12:11:57,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 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) [2023-08-26 12:11:57,274 INFO L175 Difference]: Start difference. First operand has 63 places, 34 transitions, 213 flow. Second operand 3 states and 394 transitions. [2023-08-26 12:11:57,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 49 transitions, 375 flow [2023-08-26 12:11:57,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 49 transitions, 337 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-26 12:11:57,276 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 208 flow [2023-08-26 12:11:57,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=61, PETRI_TRANSITIONS=37} [2023-08-26 12:11:57,277 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2023-08-26 12:11:57,277 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 208 flow [2023-08-26 12:11:57,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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) [2023-08-26 12:11:57,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:57,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:57,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 12:11:57,278 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:57,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:57,278 INFO L85 PathProgramCache]: Analyzing trace with hash -284588461, now seen corresponding path program 1 times [2023-08-26 12:11:57,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:57,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445384093] [2023-08-26 12:11:57,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:57,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:57,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:57,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445384093] [2023-08-26 12:11:57,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445384093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:57,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:57,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:11:57,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107781984] [2023-08-26 12:11:57,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:57,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:11:57,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:57,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:11:57,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:11:57,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 311 [2023-08-26 12:11:57,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 37 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 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) [2023-08-26 12:11:57,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:57,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 311 [2023-08-26 12:11:57,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:57,498 INFO L124 PetriNetUnfolderBase]: 111/249 cut-off events. [2023-08-26 12:11:57,498 INFO L125 PetriNetUnfolderBase]: For 356/367 co-relation queries the response was YES. [2023-08-26 12:11:57,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 249 events. 111/249 cut-off events. For 356/367 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1012 event pairs, 12 based on Foata normal form. 26/270 useless extension candidates. Maximal degree in co-relation 866. Up to 104 conditions per place. [2023-08-26 12:11:57,499 INFO L140 encePairwiseOnDemand]: 306/311 looper letters, 47 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2023-08-26 12:11:57,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 427 flow [2023-08-26 12:11:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 523 transitions. [2023-08-26 12:11:57,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4204180064308682 [2023-08-26 12:11:57,503 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 523 transitions. [2023-08-26 12:11:57,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 523 transitions. [2023-08-26 12:11:57,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:57,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 523 transitions. [2023-08-26 12:11:57,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 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) [2023-08-26 12:11:57,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 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) [2023-08-26 12:11:57,506 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 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) [2023-08-26 12:11:57,506 INFO L175 Difference]: Start difference. First operand has 61 places, 37 transitions, 208 flow. Second operand 4 states and 523 transitions. [2023-08-26 12:11:57,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 427 flow [2023-08-26 12:11:57,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:11:57,508 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 244 flow [2023-08-26 12:11:57,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2023-08-26 12:11:57,509 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -6 predicate places. [2023-08-26 12:11:57,509 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 244 flow [2023-08-26 12:11:57,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 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) [2023-08-26 12:11:57,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:57,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:57,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 12:11:57,510 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:57,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:57,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1925928441, now seen corresponding path program 1 times [2023-08-26 12:11:57,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:57,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491000834] [2023-08-26 12:11:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:57,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:57,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491000834] [2023-08-26 12:11:57,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491000834] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:57,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:57,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:11:57,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839766640] [2023-08-26 12:11:57,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:57,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:11:57,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:57,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:11:57,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:11:57,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 311 [2023-08-26 12:11:57,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 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) [2023-08-26 12:11:57,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:57,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 311 [2023-08-26 12:11:57,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:57,747 INFO L124 PetriNetUnfolderBase]: 93/209 cut-off events. [2023-08-26 12:11:57,747 INFO L125 PetriNetUnfolderBase]: For 582/604 co-relation queries the response was YES. [2023-08-26 12:11:57,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 209 events. 93/209 cut-off events. For 582/604 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 861 event pairs, 9 based on Foata normal form. 25/229 useless extension candidates. Maximal degree in co-relation 821. Up to 95 conditions per place. [2023-08-26 12:11:57,749 INFO L140 encePairwiseOnDemand]: 306/311 looper letters, 44 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2023-08-26 12:11:57,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 451 flow [2023-08-26 12:11:57,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:11:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:11:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-08-26 12:11:57,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4141479099678457 [2023-08-26 12:11:57,751 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-08-26 12:11:57,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-08-26 12:11:57,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:57,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-08-26 12:11:57,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 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) [2023-08-26 12:11:57,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 311.0) internal successors, (1866), 6 states have internal predecessors, (1866), 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) [2023-08-26 12:11:57,768 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 311.0) internal successors, (1866), 6 states have internal predecessors, (1866), 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) [2023-08-26 12:11:57,768 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 244 flow. Second operand 5 states and 644 transitions. [2023-08-26 12:11:57,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 451 flow [2023-08-26 12:11:57,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 59 transitions, 418 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-26 12:11:57,771 INFO L231 Difference]: Finished difference. Result has 65 places, 40 transitions, 245 flow [2023-08-26 12:11:57,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2023-08-26 12:11:57,771 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -5 predicate places. [2023-08-26 12:11:57,771 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 245 flow [2023-08-26 12:11:57,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 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) [2023-08-26 12:11:57,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:57,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:57,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 12:11:57,772 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2023-08-26 12:11:57,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:57,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1039908116, now seen corresponding path program 1 times [2023-08-26 12:11:57,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:57,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229655737] [2023-08-26 12:11:57,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:57,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:11:57,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:11:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:11:57,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:11:57,986 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:11:57,987 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (59 of 60 remaining) [2023-08-26 12:11:57,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 60 remaining) [2023-08-26 12:11:57,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 60 remaining) [2023-08-26 12:11:57,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 60 remaining) [2023-08-26 12:11:57,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 60 remaining) [2023-08-26 12:11:57,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 60 remaining) [2023-08-26 12:11:57,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 60 remaining) [2023-08-26 12:11:57,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 60 remaining) [2023-08-26 12:11:57,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 60 remaining) [2023-08-26 12:11:57,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 60 remaining) [2023-08-26 12:11:57,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 60 remaining) [2023-08-26 12:11:57,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 60 remaining) [2023-08-26 12:11:57,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 60 remaining) [2023-08-26 12:11:57,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 60 remaining) [2023-08-26 12:11:57,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 60 remaining) [2023-08-26 12:11:57,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 60 remaining) [2023-08-26 12:11:57,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 60 remaining) [2023-08-26 12:11:57,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 60 remaining) [2023-08-26 12:11:57,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 60 remaining) [2023-08-26 12:11:57,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 60 remaining) [2023-08-26 12:11:57,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 60 remaining) [2023-08-26 12:11:57,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 60 remaining) [2023-08-26 12:11:57,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 60 remaining) [2023-08-26 12:11:57,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 60 remaining) [2023-08-26 12:11:57,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 60 remaining) [2023-08-26 12:11:57,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 60 remaining) [2023-08-26 12:11:57,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 60 remaining) [2023-08-26 12:11:57,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 60 remaining) [2023-08-26 12:11:57,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 60 remaining) [2023-08-26 12:11:57,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 60 remaining) [2023-08-26 12:11:57,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 60 remaining) [2023-08-26 12:11:57,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 60 remaining) [2023-08-26 12:11:57,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 60 remaining) [2023-08-26 12:11:57,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 60 remaining) [2023-08-26 12:11:57,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 60 remaining) [2023-08-26 12:11:57,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 60 remaining) [2023-08-26 12:11:57,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 60 remaining) [2023-08-26 12:11:57,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 60 remaining) [2023-08-26 12:11:57,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 60 remaining) [2023-08-26 12:11:57,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 60 remaining) [2023-08-26 12:11:57,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 60 remaining) [2023-08-26 12:11:57,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 60 remaining) [2023-08-26 12:11:57,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 60 remaining) [2023-08-26 12:11:57,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 60 remaining) [2023-08-26 12:11:57,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 60 remaining) [2023-08-26 12:11:57,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 60 remaining) [2023-08-26 12:11:57,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 60 remaining) [2023-08-26 12:11:57,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 60 remaining) [2023-08-26 12:11:57,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 60 remaining) [2023-08-26 12:11:57,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 60 remaining) [2023-08-26 12:11:57,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 60 remaining) [2023-08-26 12:11:57,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 60 remaining) [2023-08-26 12:11:57,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 60 remaining) [2023-08-26 12:11:57,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 60 remaining) [2023-08-26 12:11:57,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 60 remaining) [2023-08-26 12:11:57,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 60 remaining) [2023-08-26 12:11:57,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 60 remaining) [2023-08-26 12:11:57,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 60 remaining) [2023-08-26 12:11:57,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 60 remaining) [2023-08-26 12:11:57,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 60 remaining) [2023-08-26 12:11:57,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 12:11:57,996 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:58,001 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:11:58,001 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:11:58,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:11:58 BasicIcfg [2023-08-26 12:11:58,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:11:58,104 INFO L158 Benchmark]: Toolchain (without parser) took 25089.16ms. Allocated memory was 369.1MB in the beginning and 947.9MB in the end (delta: 578.8MB). Free memory was 343.2MB in the beginning and 874.4MB in the end (delta: -531.1MB). Peak memory consumption was 50.1MB. Max. memory is 16.0GB. [2023-08-26 12:11:58,104 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 369.1MB. Free memory was 346.0MB in the beginning and 345.9MB in the end (delta: 33.5kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:11:58,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.81ms. Allocated memory is still 369.1MB. Free memory was 343.2MB in the beginning and 319.7MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:11:58,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.88ms. Allocated memory is still 369.1MB. Free memory was 319.7MB in the beginning and 317.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:11:58,104 INFO L158 Benchmark]: Boogie Preprocessor took 31.25ms. Allocated memory is still 369.1MB. Free memory was 317.3MB in the beginning and 315.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:11:58,105 INFO L158 Benchmark]: RCFGBuilder took 1078.85ms. Allocated memory was 369.1MB in the beginning and 469.8MB in the end (delta: 100.7MB). Free memory was 315.2MB in the beginning and 398.3MB in the end (delta: -83.1MB). Peak memory consumption was 73.1MB. Max. memory is 16.0GB. [2023-08-26 12:11:58,105 INFO L158 Benchmark]: TraceAbstraction took 23364.48ms. Allocated memory was 469.8MB in the beginning and 947.9MB in the end (delta: 478.2MB). Free memory was 397.3MB in the beginning and 874.4MB in the end (delta: -477.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:11:58,108 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 369.1MB. Free memory was 346.0MB in the beginning and 345.9MB in the end (delta: 33.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 549.81ms. Allocated memory is still 369.1MB. Free memory was 343.2MB in the beginning and 319.7MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.88ms. Allocated memory is still 369.1MB. Free memory was 319.7MB in the beginning and 317.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.25ms. Allocated memory is still 369.1MB. Free memory was 317.3MB in the beginning and 315.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1078.85ms. Allocated memory was 369.1MB in the beginning and 469.8MB in the end (delta: 100.7MB). Free memory was 315.2MB in the beginning and 398.3MB in the end (delta: -83.1MB). Peak memory consumption was 73.1MB. Max. memory is 16.0GB. * TraceAbstraction took 23364.48ms. Allocated memory was 469.8MB in the beginning and 947.9MB in the end (delta: 478.2MB). Free memory was 397.3MB in the beginning and 874.4MB in the end (delta: -477.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0s, 167 PlacesBefore, 70 PlacesAfterwards, 160 TransitionsBefore, 61 TransitionsAfterwards, 5090 CoEnabledTransitionPairs, 7 FixpointIterations, 68 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 148 TotalNumberOfCompositions, 18775 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7076, independent: 6686, independent conditional: 0, independent unconditional: 6686, dependent: 390, dependent conditional: 0, dependent unconditional: 390, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2354, independent: 2289, independent conditional: 0, independent unconditional: 2289, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7076, independent: 4397, independent conditional: 0, independent unconditional: 4397, dependent: 325, dependent conditional: 0, dependent unconditional: 325, unknown: 2354, unknown conditional: 0, unknown unconditional: 2354] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 356, Positive conditional cache size: 0, Positive unconditional cache size: 356, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1937; [L838] FCALL, FORK 0 pthread_create(&t1937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1937, ((void *)0), P0, ((void *)0))=-1, t1937={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=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, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=0, y=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, z={3:0}] [L839] 0 pthread_t t1938; [L840] FCALL, FORK 0 pthread_create(&t1938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1938, ((void *)0), P1, ((void *)0))=0, t1937={7:0}, t1938={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=0, y=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, z={3:0}] [L841] 0 pthread_t t1939; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1937={7:0}, t1938={8:0}, t1939={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=0, y=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, z={3:0}] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=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, z={3:0}] [L794] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=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, z={3:0}] [L842] FCALL, FORK 0 pthread_create(&t1939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1939, ((void *)0), P2, ((void *)0))=1, t1937={7:0}, t1938={8:0}, t1939={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=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, z={3:0}] [L797] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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, z={3:0}] [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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, z={3:0}] [L812] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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, z={3:0}] [L815] 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) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] 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) [L815] 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) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 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 [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] 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) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] 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) [L848] 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) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 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 [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 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 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1937={7:0}, t1938={8:0}, t1939={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L859] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe007_power.oepc-thin001_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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, z={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: 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: 840]: 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: 838]: 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, 208 locations, 60 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: 23.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 588 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 588 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1417 IncrementalHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 10 mSDtfsCounter, 1417 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=398occurred in iteration=12, InterpolantAutomatonStates: 85, 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.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 2271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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! [2023-08-26 12:11:58,135 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...