/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 --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -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/rfi009_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:19:52,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:19:53,053 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 18:19:53,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:19:53,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:19:53,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:19:53,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:19:53,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:19:53,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:19:53,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:19:53,093 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:19:53,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:19:53,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:19:53,095 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:19:53,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:19:53,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:19:53,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:19:53,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:19:53,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:19:53,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:19:53,096 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:19:53,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:19:53,097 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:19:53,097 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:19:53,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:19:53,098 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:19:53,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:19:53,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:19:53,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:19:53,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:19:53,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:19:53,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:19:53,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:19:53,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:19:53,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:19:53,101 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST 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 18:19:53,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:19:53,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:19:53,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:19:53,434 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:19:53,436 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:19:53,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.oepc.i [2023-08-26 18:19:54,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:19:54,928 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:19:54,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_power.oepc.i [2023-08-26 18:19:54,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ea3b97d/9b20a7ac37d14eb6bd88e9b14130ce35/FLAGea001480a [2023-08-26 18:19:54,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ea3b97d/9b20a7ac37d14eb6bd88e9b14130ce35 [2023-08-26 18:19:54,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:19:54,963 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:19:54,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:19:54,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:19:54,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:19:54,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:19:54" (1/1) ... [2023-08-26 18:19:54,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a43f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:54, skipping insertion in model container [2023-08-26 18:19:54,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:19:54" (1/1) ... [2023-08-26 18:19:55,032 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:19:55,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:19:55,423 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:19:55,454 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:19:55,456 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:19:55,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:19:55,539 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:19:55,540 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:19:55,545 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:19:55,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:55 WrapperNode [2023-08-26 18:19:55,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:19:55,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:19:55,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:19:55,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:19:55,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:55" (1/1) ... [2023-08-26 18:19:55,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:55" (1/1) ... [2023-08-26 18:19:55,603 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2023-08-26 18:19:55,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:19:55,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:19:55,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:19:55,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:19:55,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:55" (1/1) ... [2023-08-26 18:19:55,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:55" (1/1) ... [2023-08-26 18:19:55,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:55" (1/1) ... [2023-08-26 18:19:55,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:55" (1/1) ... [2023-08-26 18:19:55,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:55" (1/1) ... [2023-08-26 18:19:55,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:55" (1/1) ... [2023-08-26 18:19:55,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:55" (1/1) ... [2023-08-26 18:19:55,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:55" (1/1) ... [2023-08-26 18:19:55,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:19:55,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:19:55,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:19:55,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:19:55,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:55" (1/1) ... [2023-08-26 18:19:55,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:19:55,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:19:55,698 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 18:19:55,726 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 18:19:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:19:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:19:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:19:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:19:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:19:55,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:19:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:19:55,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:19:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:19:55,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:19:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:19:55,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:19:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:19:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:19:55,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:19:55,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:19:55,745 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 18:19:55,937 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:19:55,938 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:19:56,400 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:19:56,842 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:19:56,842 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:19:56,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:19:56 BoogieIcfgContainer [2023-08-26 18:19:56,845 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:19:56,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:19:56,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:19:56,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:19:56,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:19:54" (1/3) ... [2023-08-26 18:19:56,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cde511f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:19:56, skipping insertion in model container [2023-08-26 18:19:56,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:19:55" (2/3) ... [2023-08-26 18:19:56,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cde511f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:19:56, skipping insertion in model container [2023-08-26 18:19:56,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:19:56" (3/3) ... [2023-08-26 18:19:56,853 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.oepc.i [2023-08-26 18:19:56,869 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:19:56,870 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2023-08-26 18:19:56,870 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:19:57,027 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:19:57,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 175 transitions, 365 flow [2023-08-26 18:19:57,173 INFO L124 PetriNetUnfolderBase]: 3/172 cut-off events. [2023-08-26 18:19:57,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:19:57,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 172 events. 3/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 281 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2023-08-26 18:19:57,181 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 175 transitions, 365 flow [2023-08-26 18:19:57,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 172 transitions, 353 flow [2023-08-26 18:19:57,192 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:19:57,202 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 172 transitions, 353 flow [2023-08-26 18:19:57,206 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 179 places, 172 transitions, 353 flow [2023-08-26 18:19:57,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 172 transitions, 353 flow [2023-08-26 18:19:57,273 INFO L124 PetriNetUnfolderBase]: 3/172 cut-off events. [2023-08-26 18:19:57,273 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:19:57,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 172 events. 3/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 283 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2023-08-26 18:19:57,280 INFO L119 LiptonReduction]: Number of co-enabled transitions 7088 [2023-08-26 18:20:06,150 INFO L134 LiptonReduction]: Checked pairs total: 39193 [2023-08-26 18:20:06,151 INFO L136 LiptonReduction]: Total number of compositions: 147 [2023-08-26 18:20:06,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:20:06,167 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;@100fe193, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:20:06,168 INFO L358 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2023-08-26 18:20:06,169 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:20:06,169 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:20:06,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:20:06,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:06,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:20:06,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:06,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:06,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1076, now seen corresponding path program 1 times [2023-08-26 18:20:06,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:06,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507596939] [2023-08-26 18:20:06,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:06,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:06,271 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 18:20:06,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:06,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507596939] [2023-08-26 18:20:06,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507596939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:06,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:06,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:20:06,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487608564] [2023-08-26 18:20:06,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:06,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:20:06,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:06,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:20:06,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:20:06,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 322 [2023-08-26 18:20:06,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 159 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 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 18:20:06,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:06,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 322 [2023-08-26 18:20:06,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:08,624 INFO L124 PetriNetUnfolderBase]: 10500/15118 cut-off events. [2023-08-26 18:20:08,625 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-26 18:20:08,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30001 conditions, 15118 events. 10500/15118 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1322. Compared 98782 event pairs, 10500 based on Foata normal form. 300/7340 useless extension candidates. Maximal degree in co-relation 29990. Up to 14807 conditions per place. [2023-08-26 18:20:08,719 INFO L140 encePairwiseOnDemand]: 290/322 looper letters, 39 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2023-08-26 18:20:08,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 171 flow [2023-08-26 18:20:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:20:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:20:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 321 transitions. [2023-08-26 18:20:08,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984472049689441 [2023-08-26 18:20:08,738 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 321 transitions. [2023-08-26 18:20:08,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 321 transitions. [2023-08-26 18:20:08,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:08,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 321 transitions. [2023-08-26 18:20:08,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:20:08,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 322.0) internal successors, (966), 3 states have internal predecessors, (966), 0 states have call successors, (0), 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 18:20:08,752 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 322.0) internal successors, (966), 3 states have internal predecessors, (966), 0 states have call successors, (0), 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 18:20:08,754 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 159 flow. Second operand 2 states and 321 transitions. [2023-08-26 18:20:08,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 171 flow [2023-08-26 18:20:08,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:20:08,761 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2023-08-26 18:20:08,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-26 18:20:08,766 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, -33 predicate places. [2023-08-26 18:20:08,767 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2023-08-26 18:20:08,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 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 18:20:08,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:08,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:20:08,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:20:08,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:08,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1061824, now seen corresponding path program 1 times [2023-08-26 18:20:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:08,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119164533] [2023-08-26 18:20:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:09,056 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 18:20:09,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:09,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119164533] [2023-08-26 18:20:09,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119164533] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:09,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:09,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:20:09,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72809338] [2023-08-26 18:20:09,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:09,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:20:09,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:09,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:20:09,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:20:09,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 322 [2023-08-26 18:20:09,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 18:20:09,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:09,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 322 [2023-08-26 18:20:09,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:10,592 INFO L124 PetriNetUnfolderBase]: 6566/9729 cut-off events. [2023-08-26 18:20:10,593 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:20:10,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19441 conditions, 9729 events. 6566/9729 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 61335 event pairs, 4547 based on Foata normal form. 0/5965 useless extension candidates. Maximal degree in co-relation 19438. Up to 6669 conditions per place. [2023-08-26 18:20:10,645 INFO L140 encePairwiseOnDemand]: 307/322 looper letters, 45 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2023-08-26 18:20:10,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 222 flow [2023-08-26 18:20:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:20:10,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:20:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-26 18:20:10,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38509316770186336 [2023-08-26 18:20:10,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-26 18:20:10,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-26 18:20:10,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:10,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-26 18:20:10,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 18:20:10,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 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 18:20:10,653 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 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 18:20:10,653 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 372 transitions. [2023-08-26 18:20:10,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 222 flow [2023-08-26 18:20:10,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:20:10,654 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 152 flow [2023-08-26 18:20:10,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2023-08-26 18:20:10,655 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, -31 predicate places. [2023-08-26 18:20:10,656 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 152 flow [2023-08-26 18:20:10,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 18:20:10,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:10,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:20:10,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:20:10,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:10,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:10,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1061825, now seen corresponding path program 1 times [2023-08-26 18:20:10,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:10,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505038342] [2023-08-26 18:20:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:10,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:10,742 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 18:20:10,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505038342] [2023-08-26 18:20:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505038342] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:10,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:10,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:20:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364027116] [2023-08-26 18:20:10,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:10,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:20:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:10,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:20:10,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:20:10,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 322 [2023-08-26 18:20:10,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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 18:20:10,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:10,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 322 [2023-08-26 18:20:10,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:11,426 INFO L124 PetriNetUnfolderBase]: 2133/3375 cut-off events. [2023-08-26 18:20:11,427 INFO L125 PetriNetUnfolderBase]: For 1168/1168 co-relation queries the response was YES. [2023-08-26 18:20:11,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9195 conditions, 3375 events. 2133/3375 cut-off events. For 1168/1168 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 19548 event pairs, 1670 based on Foata normal form. 925/4044 useless extension candidates. Maximal degree in co-relation 9190. Up to 3283 conditions per place. [2023-08-26 18:20:11,442 INFO L140 encePairwiseOnDemand]: 314/322 looper letters, 34 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2023-08-26 18:20:11,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 210 flow [2023-08-26 18:20:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:20:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:20:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-26 18:20:11,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37370600414078675 [2023-08-26 18:20:11,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-26 18:20:11,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-26 18:20:11,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:11,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-26 18:20:11,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 18:20:11,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 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 18:20:11,449 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 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 18:20:11,449 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 152 flow. Second operand 3 states and 361 transitions. [2023-08-26 18:20:11,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 210 flow [2023-08-26 18:20:11,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:20:11,459 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 122 flow [2023-08-26 18:20:11,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-08-26 18:20:11,460 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, -38 predicate places. [2023-08-26 18:20:11,460 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 122 flow [2023-08-26 18:20:11,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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 18:20:11,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:11,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:11,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:20:11,465 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:11,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:11,466 INFO L85 PathProgramCache]: Analyzing trace with hash -547733002, now seen corresponding path program 1 times [2023-08-26 18:20:11,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:11,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662674093] [2023-08-26 18:20:11,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:11,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:11,564 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 18:20:11,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:11,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662674093] [2023-08-26 18:20:11,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662674093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:11,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:11,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:20:11,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5604634] [2023-08-26 18:20:11,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:11,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:20:11,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:11,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:20:11,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:20:11,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 322 [2023-08-26 18:20:11,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 122 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 18:20:11,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:11,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 322 [2023-08-26 18:20:11,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:11,998 INFO L124 PetriNetUnfolderBase]: 1949/3253 cut-off events. [2023-08-26 18:20:11,998 INFO L125 PetriNetUnfolderBase]: For 512/533 co-relation queries the response was YES. [2023-08-26 18:20:12,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8096 conditions, 3253 events. 1949/3253 cut-off events. For 512/533 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 20346 event pairs, 668 based on Foata normal form. 16/2787 useless extension candidates. Maximal degree in co-relation 8091. Up to 1987 conditions per place. [2023-08-26 18:20:12,015 INFO L140 encePairwiseOnDemand]: 318/322 looper letters, 59 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-08-26 18:20:12,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 332 flow [2023-08-26 18:20:12,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:20:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:20:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-26 18:20:12,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43995859213250516 [2023-08-26 18:20:12,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-26 18:20:12,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-26 18:20:12,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:12,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-26 18:20:12,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 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 18:20:12,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 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 18:20:12,022 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 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 18:20:12,022 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 122 flow. Second operand 3 states and 425 transitions. [2023-08-26 18:20:12,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 332 flow [2023-08-26 18:20:12,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 331 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:20:12,026 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 134 flow [2023-08-26 18:20:12,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=3, PETRI_FLOW=134, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-26 18:20:12,028 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, -37 predicate places. [2023-08-26 18:20:12,028 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 134 flow [2023-08-26 18:20:12,028 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 18:20:12,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:12,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:12,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:20:12,029 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:12,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:12,029 INFO L85 PathProgramCache]: Analyzing trace with hash -547732643, now seen corresponding path program 1 times [2023-08-26 18:20:12,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:12,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295149288] [2023-08-26 18:20:12,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:12,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:12,260 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 18:20:12,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:12,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295149288] [2023-08-26 18:20:12,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295149288] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:12,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:12,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:20:12,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934829843] [2023-08-26 18:20:12,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:12,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:20:12,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:12,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:20:12,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:20:12,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 322 [2023-08-26 18:20:12,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 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 18:20:12,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:12,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 322 [2023-08-26 18:20:12,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:12,776 INFO L124 PetriNetUnfolderBase]: 2359/3696 cut-off events. [2023-08-26 18:20:12,776 INFO L125 PetriNetUnfolderBase]: For 1198/1210 co-relation queries the response was YES. [2023-08-26 18:20:12,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10128 conditions, 3696 events. 2359/3696 cut-off events. For 1198/1210 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 21889 event pairs, 724 based on Foata normal form. 12/3305 useless extension candidates. Maximal degree in co-relation 10122. Up to 2523 conditions per place. [2023-08-26 18:20:12,795 INFO L140 encePairwiseOnDemand]: 319/322 looper letters, 58 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-26 18:20:12,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 342 flow [2023-08-26 18:20:12,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:20:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:20:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-26 18:20:12,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4337474120082816 [2023-08-26 18:20:12,797 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-26 18:20:12,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-26 18:20:12,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:12,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-26 18:20:12,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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 18:20:12,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 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 18:20:12,801 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 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 18:20:12,801 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 134 flow. Second operand 3 states and 419 transitions. [2023-08-26 18:20:12,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 342 flow [2023-08-26 18:20:12,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:20:12,804 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 136 flow [2023-08-26 18:20:12,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=136, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-26 18:20:12,807 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, -36 predicate places. [2023-08-26 18:20:12,807 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 136 flow [2023-08-26 18:20:12,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 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 18:20:12,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:12,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:12,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:20:12,808 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:12,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2106764454, now seen corresponding path program 1 times [2023-08-26 18:20:12,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:12,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858757906] [2023-08-26 18:20:12,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:13,310 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 18:20:13,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:13,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858757906] [2023-08-26 18:20:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858757906] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:13,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:13,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:20:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229637131] [2023-08-26 18:20:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:13,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:20:13,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:13,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:20:13,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:20:13,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 322 [2023-08-26 18:20:13,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 99.71428571428571) internal successors, (698), 7 states have internal predecessors, (698), 0 states have call successors, (0), 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 18:20:13,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:13,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 322 [2023-08-26 18:20:13,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:13,815 INFO L124 PetriNetUnfolderBase]: 2017/3395 cut-off events. [2023-08-26 18:20:13,815 INFO L125 PetriNetUnfolderBase]: For 495/500 co-relation queries the response was YES. [2023-08-26 18:20:13,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8834 conditions, 3395 events. 2017/3395 cut-off events. For 495/500 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 21742 event pairs, 552 based on Foata normal form. 32/3057 useless extension candidates. Maximal degree in co-relation 8827. Up to 1076 conditions per place. [2023-08-26 18:20:13,829 INFO L140 encePairwiseOnDemand]: 315/322 looper letters, 65 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2023-08-26 18:20:13,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 390 flow [2023-08-26 18:20:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:20:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:20:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2023-08-26 18:20:13,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2023-08-26 18:20:13,831 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2023-08-26 18:20:13,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2023-08-26 18:20:13,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:13,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2023-08-26 18:20:13,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:20:13,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 0 states have call successors, (0), 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 18:20:13,836 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 0 states have call successors, (0), 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 18:20:13,836 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 136 flow. Second operand 5 states and 552 transitions. [2023-08-26 18:20:13,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 390 flow [2023-08-26 18:20:13,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 73 transitions, 383 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:20:13,839 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 156 flow [2023-08-26 18:20:13,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=121, 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=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-26 18:20:13,839 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, -36 predicate places. [2023-08-26 18:20:13,839 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 156 flow [2023-08-26 18:20:13,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.71428571428571) internal successors, (698), 7 states have internal predecessors, (698), 0 states have call successors, (0), 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 18:20:13,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:13,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:13,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:20:13,840 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:13,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:13,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1168738144, now seen corresponding path program 1 times [2023-08-26 18:20:13,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:13,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026238267] [2023-08-26 18:20:13,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:13,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:14,195 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 18:20:14,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:14,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026238267] [2023-08-26 18:20:14,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026238267] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:14,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:14,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:20:14,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941148731] [2023-08-26 18:20:14,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:14,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:20:14,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:14,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:20:14,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:20:14,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 322 [2023-08-26 18:20:14,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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 18:20:14,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:14,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 322 [2023-08-26 18:20:14,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:14,591 INFO L124 PetriNetUnfolderBase]: 1988/3286 cut-off events. [2023-08-26 18:20:14,591 INFO L125 PetriNetUnfolderBase]: For 1842/1847 co-relation queries the response was YES. [2023-08-26 18:20:14,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9180 conditions, 3286 events. 1988/3286 cut-off events. For 1842/1847 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 20224 event pairs, 871 based on Foata normal form. 12/3033 useless extension candidates. Maximal degree in co-relation 9173. Up to 2136 conditions per place. [2023-08-26 18:20:14,603 INFO L140 encePairwiseOnDemand]: 319/322 looper letters, 60 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-08-26 18:20:14,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 65 transitions, 370 flow [2023-08-26 18:20:14,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:20:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:20:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-08-26 18:20:14,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37888198757763975 [2023-08-26 18:20:14,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-08-26 18:20:14,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-08-26 18:20:14,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:14,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-08-26 18:20:14,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 18:20:14,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 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 18:20:14,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 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 18:20:14,611 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 156 flow. Second operand 3 states and 366 transitions. [2023-08-26 18:20:14,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 65 transitions, 370 flow [2023-08-26 18:20:14,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:20:14,617 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 163 flow [2023-08-26 18:20:14,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-08-26 18:20:14,618 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, -35 predicate places. [2023-08-26 18:20:14,619 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 163 flow [2023-08-26 18:20:14,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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 18:20:14,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:14,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:14,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:20:14,619 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:14,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1909924857, now seen corresponding path program 1 times [2023-08-26 18:20:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:14,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986332464] [2023-08-26 18:20:14,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:14,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:14,736 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 18:20:14,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:14,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986332464] [2023-08-26 18:20:14,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986332464] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:14,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:14,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:20:14,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535231998] [2023-08-26 18:20:14,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:14,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:20:14,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:14,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:20:14,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:20:14,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 322 [2023-08-26 18:20:14,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 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 18:20:14,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:14,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 322 [2023-08-26 18:20:14,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:15,117 INFO L124 PetriNetUnfolderBase]: 1654/2731 cut-off events. [2023-08-26 18:20:15,117 INFO L125 PetriNetUnfolderBase]: For 1611/1611 co-relation queries the response was YES. [2023-08-26 18:20:15,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8050 conditions, 2731 events. 1654/2731 cut-off events. For 1611/1611 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 16049 event pairs, 750 based on Foata normal form. 16/2567 useless extension candidates. Maximal degree in co-relation 8042. Up to 1038 conditions per place. [2023-08-26 18:20:15,124 INFO L140 encePairwiseOnDemand]: 310/322 looper letters, 43 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2023-08-26 18:20:15,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 327 flow [2023-08-26 18:20:15,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:20:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:20:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2023-08-26 18:20:15,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35248447204968947 [2023-08-26 18:20:15,126 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions. [2023-08-26 18:20:15,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions. [2023-08-26 18:20:15,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:15,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions. [2023-08-26 18:20:15,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 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 18:20:15,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 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 18:20:15,130 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 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 18:20:15,130 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 163 flow. Second operand 4 states and 454 transitions. [2023-08-26 18:20:15,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 327 flow [2023-08-26 18:20:15,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:20:15,134 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 228 flow [2023-08-26 18:20:15,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=228, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-26 18:20:15,135 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, -32 predicate places. [2023-08-26 18:20:15,135 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 228 flow [2023-08-26 18:20:15,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 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 18:20:15,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:15,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:15,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:20:15,136 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:15,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:15,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1407256752, now seen corresponding path program 1 times [2023-08-26 18:20:15,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:15,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801804747] [2023-08-26 18:20:15,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:16,131 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 18:20:16,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:16,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801804747] [2023-08-26 18:20:16,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801804747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:16,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:16,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:20:16,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502504080] [2023-08-26 18:20:16,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:16,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:20:16,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:16,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:20:16,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:20:16,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 322 [2023-08-26 18:20:16,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 228 flow. Second operand has 9 states, 9 states have (on average 92.44444444444444) internal successors, (832), 9 states have internal predecessors, (832), 0 states have call successors, (0), 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 18:20:16,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:16,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 322 [2023-08-26 18:20:16,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:16,902 INFO L124 PetriNetUnfolderBase]: 1868/3048 cut-off events. [2023-08-26 18:20:16,902 INFO L125 PetriNetUnfolderBase]: For 2621/2626 co-relation queries the response was YES. [2023-08-26 18:20:16,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9954 conditions, 3048 events. 1868/3048 cut-off events. For 2621/2626 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 18232 event pairs, 395 based on Foata normal form. 14/3022 useless extension candidates. Maximal degree in co-relation 9945. Up to 2660 conditions per place. [2023-08-26 18:20:16,911 INFO L140 encePairwiseOnDemand]: 311/322 looper letters, 73 selfloop transitions, 20 changer transitions 2/97 dead transitions. [2023-08-26 18:20:16,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 97 transitions, 634 flow [2023-08-26 18:20:16,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 18:20:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 18:20:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1082 transitions. [2023-08-26 18:20:16,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30547713156408807 [2023-08-26 18:20:16,915 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1082 transitions. [2023-08-26 18:20:16,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1082 transitions. [2023-08-26 18:20:16,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:16,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1082 transitions. [2023-08-26 18:20:16,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 98.36363636363636) internal successors, (1082), 11 states have internal predecessors, (1082), 0 states have call successors, (0), 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 18:20:16,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 322.0) internal successors, (3864), 12 states have internal predecessors, (3864), 0 states have call successors, (0), 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 18:20:16,922 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 322.0) internal successors, (3864), 12 states have internal predecessors, (3864), 0 states have call successors, (0), 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 18:20:16,922 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 228 flow. Second operand 11 states and 1082 transitions. [2023-08-26 18:20:16,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 97 transitions, 634 flow [2023-08-26 18:20:16,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 628 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:20:16,931 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 410 flow [2023-08-26 18:20:16,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=410, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2023-08-26 18:20:16,931 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, -18 predicate places. [2023-08-26 18:20:16,931 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 410 flow [2023-08-26 18:20:16,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.44444444444444) internal successors, (832), 9 states have internal predecessors, (832), 0 states have call successors, (0), 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 18:20:16,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:16,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:16,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:20:16,932 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:16,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:16,932 INFO L85 PathProgramCache]: Analyzing trace with hash -937684652, now seen corresponding path program 2 times [2023-08-26 18:20:16,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:16,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029301920] [2023-08-26 18:20:16,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:16,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:18,055 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 18:20:18,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:18,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029301920] [2023-08-26 18:20:18,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029301920] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:18,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:18,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:20:18,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782078023] [2023-08-26 18:20:18,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:18,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:20:18,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:18,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:20:18,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:20:18,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 322 [2023-08-26 18:20:18,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 410 flow. Second operand has 9 states, 9 states have (on average 87.44444444444444) internal successors, (787), 9 states have internal predecessors, (787), 0 states have call successors, (0), 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 18:20:18,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:18,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 322 [2023-08-26 18:20:18,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:18,815 INFO L124 PetriNetUnfolderBase]: 1952/3183 cut-off events. [2023-08-26 18:20:18,815 INFO L125 PetriNetUnfolderBase]: For 4282/4282 co-relation queries the response was YES. [2023-08-26 18:20:18,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11512 conditions, 3183 events. 1952/3183 cut-off events. For 4282/4282 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 19167 event pairs, 550 based on Foata normal form. 6/3149 useless extension candidates. Maximal degree in co-relation 11497. Up to 2908 conditions per place. [2023-08-26 18:20:18,828 INFO L140 encePairwiseOnDemand]: 313/322 looper letters, 72 selfloop transitions, 15 changer transitions 0/89 dead transitions. [2023-08-26 18:20:18,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 89 transitions, 671 flow [2023-08-26 18:20:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:20:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:20:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 835 transitions. [2023-08-26 18:20:18,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2881297446514838 [2023-08-26 18:20:18,831 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 835 transitions. [2023-08-26 18:20:18,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 835 transitions. [2023-08-26 18:20:18,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:18,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 835 transitions. [2023-08-26 18:20:18,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.77777777777777) internal successors, (835), 9 states have internal predecessors, (835), 0 states have call successors, (0), 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 18:20:18,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 322.0) internal successors, (3220), 10 states have internal predecessors, (3220), 0 states have call successors, (0), 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 18:20:18,837 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 322.0) internal successors, (3220), 10 states have internal predecessors, (3220), 0 states have call successors, (0), 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 18:20:18,837 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 410 flow. Second operand 9 states and 835 transitions. [2023-08-26 18:20:18,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 89 transitions, 671 flow [2023-08-26 18:20:18,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 89 transitions, 669 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 18:20:18,861 INFO L231 Difference]: Finished difference. Result has 74 places, 66 transitions, 483 flow [2023-08-26 18:20:18,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=483, PETRI_PLACES=74, PETRI_TRANSITIONS=66} [2023-08-26 18:20:18,861 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, -9 predicate places. [2023-08-26 18:20:18,861 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 483 flow [2023-08-26 18:20:18,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.44444444444444) internal successors, (787), 9 states have internal predecessors, (787), 0 states have call successors, (0), 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 18:20:18,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:18,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:18,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:20:18,862 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:18,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:18,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1173364312, now seen corresponding path program 3 times [2023-08-26 18:20:18,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:18,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658759276] [2023-08-26 18:20:18,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:18,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:19,658 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 18:20:19,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:19,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658759276] [2023-08-26 18:20:19,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658759276] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:19,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:19,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:20:19,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554927856] [2023-08-26 18:20:19,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:19,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:20:19,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:19,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:20:19,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:20:19,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 322 [2023-08-26 18:20:19,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 483 flow. Second operand has 9 states, 9 states have (on average 93.44444444444444) internal successors, (841), 9 states have internal predecessors, (841), 0 states have call successors, (0), 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 18:20:19,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:19,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 322 [2023-08-26 18:20:19,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:20,440 INFO L124 PetriNetUnfolderBase]: 1939/3177 cut-off events. [2023-08-26 18:20:20,440 INFO L125 PetriNetUnfolderBase]: For 4809/4809 co-relation queries the response was YES. [2023-08-26 18:20:20,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11987 conditions, 3177 events. 1939/3177 cut-off events. For 4809/4809 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 19148 event pairs, 312 based on Foata normal form. 6/3143 useless extension candidates. Maximal degree in co-relation 11970. Up to 2136 conditions per place. [2023-08-26 18:20:20,455 INFO L140 encePairwiseOnDemand]: 314/322 looper letters, 98 selfloop transitions, 44 changer transitions 0/144 dead transitions. [2023-08-26 18:20:20,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 144 transitions, 1225 flow [2023-08-26 18:20:20,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 18:20:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 18:20:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1199 transitions. [2023-08-26 18:20:20,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3103002070393375 [2023-08-26 18:20:20,458 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1199 transitions. [2023-08-26 18:20:20,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1199 transitions. [2023-08-26 18:20:20,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:20,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1199 transitions. [2023-08-26 18:20:20,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 99.91666666666667) internal successors, (1199), 12 states have internal predecessors, (1199), 0 states have call successors, (0), 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 18:20:20,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 322.0) internal successors, (4186), 13 states have internal predecessors, (4186), 0 states have call successors, (0), 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 18:20:20,466 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 322.0) internal successors, (4186), 13 states have internal predecessors, (4186), 0 states have call successors, (0), 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 18:20:20,467 INFO L175 Difference]: Start difference. First operand has 74 places, 66 transitions, 483 flow. Second operand 12 states and 1199 transitions. [2023-08-26 18:20:20,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 144 transitions, 1225 flow [2023-08-26 18:20:20,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 144 transitions, 1192 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-26 18:20:20,495 INFO L231 Difference]: Finished difference. Result has 83 places, 88 transitions, 790 flow [2023-08-26 18:20:20,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=790, PETRI_PLACES=83, PETRI_TRANSITIONS=88} [2023-08-26 18:20:20,495 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 0 predicate places. [2023-08-26 18:20:20,495 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 790 flow [2023-08-26 18:20:20,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.44444444444444) internal successors, (841), 9 states have internal predecessors, (841), 0 states have call successors, (0), 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 18:20:20,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:20,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:20,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:20:20,496 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:20,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:20,496 INFO L85 PathProgramCache]: Analyzing trace with hash -921870666, now seen corresponding path program 1 times [2023-08-26 18:20:20,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:20,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825270480] [2023-08-26 18:20:20,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:20,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:20,676 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 18:20:20,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:20,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825270480] [2023-08-26 18:20:20,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825270480] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:20,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:20,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:20:20,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513576851] [2023-08-26 18:20:20,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:20,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:20:20,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:20,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:20:20,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:20:20,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 322 [2023-08-26 18:20:20,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 790 flow. Second operand has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 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 18:20:20,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:20,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 322 [2023-08-26 18:20:20,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:21,235 INFO L124 PetriNetUnfolderBase]: 1573/2601 cut-off events. [2023-08-26 18:20:21,235 INFO L125 PetriNetUnfolderBase]: For 5360/5360 co-relation queries the response was YES. [2023-08-26 18:20:21,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10291 conditions, 2601 events. 1573/2601 cut-off events. For 5360/5360 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14965 event pairs, 665 based on Foata normal form. 62/2639 useless extension candidates. Maximal degree in co-relation 10271. Up to 1321 conditions per place. [2023-08-26 18:20:21,248 INFO L140 encePairwiseOnDemand]: 309/322 looper letters, 88 selfloop transitions, 23 changer transitions 1/114 dead transitions. [2023-08-26 18:20:21,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 114 transitions, 1155 flow [2023-08-26 18:20:21,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:20:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:20:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 647 transitions. [2023-08-26 18:20:21,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33488612836438925 [2023-08-26 18:20:21,251 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 647 transitions. [2023-08-26 18:20:21,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 647 transitions. [2023-08-26 18:20:21,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:21,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 647 transitions. [2023-08-26 18:20:21,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 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 18:20:21,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 322.0) internal successors, (2254), 7 states have internal predecessors, (2254), 0 states have call successors, (0), 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 18:20:21,255 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 322.0) internal successors, (2254), 7 states have internal predecessors, (2254), 0 states have call successors, (0), 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 18:20:21,255 INFO L175 Difference]: Start difference. First operand has 83 places, 88 transitions, 790 flow. Second operand 6 states and 647 transitions. [2023-08-26 18:20:21,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 114 transitions, 1155 flow [2023-08-26 18:20:21,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 114 transitions, 1124 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-26 18:20:21,277 INFO L231 Difference]: Finished difference. Result has 86 places, 90 transitions, 865 flow [2023-08-26 18:20:21,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=865, PETRI_PLACES=86, PETRI_TRANSITIONS=90} [2023-08-26 18:20:21,278 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 3 predicate places. [2023-08-26 18:20:21,278 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 865 flow [2023-08-26 18:20:21,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 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 18:20:21,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:21,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:21,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:20:21,279 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:21,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:21,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1319393085, now seen corresponding path program 1 times [2023-08-26 18:20:21,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:21,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884778443] [2023-08-26 18:20:21,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:21,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 18:20:21,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:21,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884778443] [2023-08-26 18:20:21,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884778443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:21,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:21,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:20:21,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611830827] [2023-08-26 18:20:21,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:21,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:20:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:21,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:20:21,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:20:21,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 322 [2023-08-26 18:20:21,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 865 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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 18:20:21,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:21,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 322 [2023-08-26 18:20:21,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:21,654 INFO L124 PetriNetUnfolderBase]: 713/1310 cut-off events. [2023-08-26 18:20:21,654 INFO L125 PetriNetUnfolderBase]: For 3531/3534 co-relation queries the response was YES. [2023-08-26 18:20:21,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5567 conditions, 1310 events. 713/1310 cut-off events. For 3531/3534 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7113 event pairs, 127 based on Foata normal form. 25/1324 useless extension candidates. Maximal degree in co-relation 5545. Up to 1131 conditions per place. [2023-08-26 18:20:21,659 INFO L140 encePairwiseOnDemand]: 317/322 looper letters, 98 selfloop transitions, 4 changer transitions 1/110 dead transitions. [2023-08-26 18:20:21,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 110 transitions, 1182 flow [2023-08-26 18:20:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:20:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:20:21,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-08-26 18:20:21,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161490683229814 [2023-08-26 18:20:21,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-08-26 18:20:21,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-08-26 18:20:21,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:21,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-08-26 18:20:21,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 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 18:20:21,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 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 18:20:21,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 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 18:20:21,663 INFO L175 Difference]: Start difference. First operand has 86 places, 90 transitions, 865 flow. Second operand 3 states and 402 transitions. [2023-08-26 18:20:21,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 110 transitions, 1182 flow [2023-08-26 18:20:21,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 110 transitions, 1147 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-26 18:20:21,676 INFO L231 Difference]: Finished difference. Result has 84 places, 87 transitions, 793 flow [2023-08-26 18:20:21,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=84, PETRI_TRANSITIONS=87} [2023-08-26 18:20:21,676 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 1 predicate places. [2023-08-26 18:20:21,676 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 87 transitions, 793 flow [2023-08-26 18:20:21,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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 18:20:21,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:21,677 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 18:20:21,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:20:21,677 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:21,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash 952082588, now seen corresponding path program 1 times [2023-08-26 18:20:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186925958] [2023-08-26 18:20:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:21,831 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 18:20:21,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:21,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186925958] [2023-08-26 18:20:21,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186925958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:21,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:21,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:20:21,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085332213] [2023-08-26 18:20:21,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:21,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:20:21,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:21,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:20:21,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:20:21,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 322 [2023-08-26 18:20:21,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 87 transitions, 793 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 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 18:20:21,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:21,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 322 [2023-08-26 18:20:21,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:22,355 INFO L124 PetriNetUnfolderBase]: 1651/2874 cut-off events. [2023-08-26 18:20:22,355 INFO L125 PetriNetUnfolderBase]: For 7609/7634 co-relation queries the response was YES. [2023-08-26 18:20:22,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12454 conditions, 2874 events. 1651/2874 cut-off events. For 7609/7634 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16834 event pairs, 182 based on Foata normal form. 36/2884 useless extension candidates. Maximal degree in co-relation 12431. Up to 1523 conditions per place. [2023-08-26 18:20:22,366 INFO L140 encePairwiseOnDemand]: 319/322 looper letters, 179 selfloop transitions, 2 changer transitions 4/190 dead transitions. [2023-08-26 18:20:22,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 190 transitions, 2089 flow [2023-08-26 18:20:22,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:20:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:20:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2023-08-26 18:20:22,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246894409937888 [2023-08-26 18:20:22,368 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2023-08-26 18:20:22,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2023-08-26 18:20:22,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:22,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2023-08-26 18:20:22,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 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 18:20:22,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 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 18:20:22,371 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 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 18:20:22,372 INFO L175 Difference]: Start difference. First operand has 84 places, 87 transitions, 793 flow. Second operand 4 states and 547 transitions. [2023-08-26 18:20:22,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 190 transitions, 2089 flow [2023-08-26 18:20:22,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 190 transitions, 2080 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:20:22,394 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 802 flow [2023-08-26 18:20:22,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=802, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2023-08-26 18:20:22,394 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 5 predicate places. [2023-08-26 18:20:22,394 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 802 flow [2023-08-26 18:20:22,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 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 18:20:22,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:22,395 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 18:20:22,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:20:22,395 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:22,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:22,395 INFO L85 PathProgramCache]: Analyzing trace with hash 876272070, now seen corresponding path program 2 times [2023-08-26 18:20:22,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:22,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959220265] [2023-08-26 18:20:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:22,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:22,542 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 18:20:22,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:22,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959220265] [2023-08-26 18:20:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959220265] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:22,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:22,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:20:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117117074] [2023-08-26 18:20:22,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:22,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:20:22,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:20:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:20:22,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 322 [2023-08-26 18:20:22,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 802 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 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 18:20:22,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:22,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 322 [2023-08-26 18:20:22,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:22,753 INFO L124 PetriNetUnfolderBase]: 387/790 cut-off events. [2023-08-26 18:20:22,754 INFO L125 PetriNetUnfolderBase]: For 1938/1941 co-relation queries the response was YES. [2023-08-26 18:20:22,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3370 conditions, 790 events. 387/790 cut-off events. For 1938/1941 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4064 event pairs, 54 based on Foata normal form. 50/820 useless extension candidates. Maximal degree in co-relation 3345. Up to 367 conditions per place. [2023-08-26 18:20:22,758 INFO L140 encePairwiseOnDemand]: 317/322 looper letters, 82 selfloop transitions, 7 changer transitions 13/109 dead transitions. [2023-08-26 18:20:22,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 109 transitions, 1084 flow [2023-08-26 18:20:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:20:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:20:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-26 18:20:22,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4138198757763975 [2023-08-26 18:20:22,760 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-26 18:20:22,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-26 18:20:22,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:22,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-26 18:20:22,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 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 18:20:22,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 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 18:20:22,764 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 322.0) internal successors, (1610), 5 states have internal predecessors, (1610), 0 states have call successors, (0), 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 18:20:22,764 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 802 flow. Second operand 4 states and 533 transitions. [2023-08-26 18:20:22,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 109 transitions, 1084 flow [2023-08-26 18:20:22,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 109 transitions, 1053 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-26 18:20:22,771 INFO L231 Difference]: Finished difference. Result has 84 places, 62 transitions, 482 flow [2023-08-26 18:20:22,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=84, PETRI_TRANSITIONS=62} [2023-08-26 18:20:22,771 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, 1 predicate places. [2023-08-26 18:20:22,772 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 62 transitions, 482 flow [2023-08-26 18:20:22,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 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 18:20:22,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:22,772 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 18:20:22,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:20:22,772 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:22,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash 435285290, now seen corresponding path program 1 times [2023-08-26 18:20:22,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:22,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333182558] [2023-08-26 18:20:22,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:20:22,989 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 18:20:22,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:20:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333182558] [2023-08-26 18:20:22,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333182558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:20:22,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:20:22,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:20:22,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509188836] [2023-08-26 18:20:22,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:20:22,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:20:22,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:20:22,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:20:22,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:20:22,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 322 [2023-08-26 18:20:22,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 62 transitions, 482 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 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 18:20:22,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:20:22,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 322 [2023-08-26 18:20:22,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:20:23,124 INFO L124 PetriNetUnfolderBase]: 270/519 cut-off events. [2023-08-26 18:20:23,124 INFO L125 PetriNetUnfolderBase]: For 1574/1577 co-relation queries the response was YES. [2023-08-26 18:20:23,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2310 conditions, 519 events. 270/519 cut-off events. For 1574/1577 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2540 event pairs, 43 based on Foata normal form. 20/523 useless extension candidates. Maximal degree in co-relation 2288. Up to 236 conditions per place. [2023-08-26 18:20:23,127 INFO L140 encePairwiseOnDemand]: 317/322 looper letters, 55 selfloop transitions, 10 changer transitions 12/79 dead transitions. [2023-08-26 18:20:23,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 79 transitions, 716 flow [2023-08-26 18:20:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:20:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:20:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-26 18:20:23,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40248447204968946 [2023-08-26 18:20:23,129 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-26 18:20:23,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-26 18:20:23,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:20:23,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-26 18:20:23,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 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 18:20:23,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 0 states have call successors, (0), 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 18:20:23,132 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 322.0) internal successors, (1932), 6 states have internal predecessors, (1932), 0 states have call successors, (0), 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 18:20:23,133 INFO L175 Difference]: Start difference. First operand has 84 places, 62 transitions, 482 flow. Second operand 5 states and 648 transitions. [2023-08-26 18:20:23,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 79 transitions, 716 flow [2023-08-26 18:20:23,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 599 flow, removed 16 selfloop flow, removed 16 redundant places. [2023-08-26 18:20:23,136 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 249 flow [2023-08-26 18:20:23,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2023-08-26 18:20:23,136 INFO L281 CegarLoopForPetriNet]: 83 programPoint places, -21 predicate places. [2023-08-26 18:20:23,137 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 249 flow [2023-08-26 18:20:23,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 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 18:20:23,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:20:23,137 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 18:20:23,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:20:23,137 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:20:23,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:20:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash 313211088, now seen corresponding path program 1 times [2023-08-26 18:20:23,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:20:23,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535845042] [2023-08-26 18:20:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:20:23,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:20:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:20:23,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:20:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:20:23,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:20:23,331 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:20:23,332 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (83 of 84 remaining) [2023-08-26 18:20:23,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 84 remaining) [2023-08-26 18:20:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 84 remaining) [2023-08-26 18:20:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 84 remaining) [2023-08-26 18:20:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 84 remaining) [2023-08-26 18:20:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 84 remaining) [2023-08-26 18:20:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 84 remaining) [2023-08-26 18:20:23,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 84 remaining) [2023-08-26 18:20:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 84 remaining) [2023-08-26 18:20:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 84 remaining) [2023-08-26 18:20:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 84 remaining) [2023-08-26 18:20:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 84 remaining) [2023-08-26 18:20:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 84 remaining) [2023-08-26 18:20:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 84 remaining) [2023-08-26 18:20:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 84 remaining) [2023-08-26 18:20:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 84 remaining) [2023-08-26 18:20:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 84 remaining) [2023-08-26 18:20:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 84 remaining) [2023-08-26 18:20:23,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 84 remaining) [2023-08-26 18:20:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 84 remaining) [2023-08-26 18:20:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 84 remaining) [2023-08-26 18:20:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 84 remaining) [2023-08-26 18:20:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 84 remaining) [2023-08-26 18:20:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 84 remaining) [2023-08-26 18:20:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 84 remaining) [2023-08-26 18:20:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 84 remaining) [2023-08-26 18:20:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 84 remaining) [2023-08-26 18:20:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 84 remaining) [2023-08-26 18:20:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 84 remaining) [2023-08-26 18:20:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 84 remaining) [2023-08-26 18:20:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 84 remaining) [2023-08-26 18:20:23,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 84 remaining) [2023-08-26 18:20:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 84 remaining) [2023-08-26 18:20:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 84 remaining) [2023-08-26 18:20:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 84 remaining) [2023-08-26 18:20:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 84 remaining) [2023-08-26 18:20:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 84 remaining) [2023-08-26 18:20:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 84 remaining) [2023-08-26 18:20:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 84 remaining) [2023-08-26 18:20:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 84 remaining) [2023-08-26 18:20:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 84 remaining) [2023-08-26 18:20:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 84 remaining) [2023-08-26 18:20:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 84 remaining) [2023-08-26 18:20:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 84 remaining) [2023-08-26 18:20:23,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 84 remaining) [2023-08-26 18:20:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 84 remaining) [2023-08-26 18:20:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 84 remaining) [2023-08-26 18:20:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 84 remaining) [2023-08-26 18:20:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 84 remaining) [2023-08-26 18:20:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 84 remaining) [2023-08-26 18:20:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 84 remaining) [2023-08-26 18:20:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 84 remaining) [2023-08-26 18:20:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 84 remaining) [2023-08-26 18:20:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 84 remaining) [2023-08-26 18:20:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 84 remaining) [2023-08-26 18:20:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 84 remaining) [2023-08-26 18:20:23,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 84 remaining) [2023-08-26 18:20:23,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 84 remaining) [2023-08-26 18:20:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 84 remaining) [2023-08-26 18:20:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 84 remaining) [2023-08-26 18:20:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 84 remaining) [2023-08-26 18:20:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 84 remaining) [2023-08-26 18:20:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 84 remaining) [2023-08-26 18:20:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 84 remaining) [2023-08-26 18:20:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 84 remaining) [2023-08-26 18:20:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 84 remaining) [2023-08-26 18:20:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 84 remaining) [2023-08-26 18:20:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 84 remaining) [2023-08-26 18:20:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 84 remaining) [2023-08-26 18:20:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 84 remaining) [2023-08-26 18:20:23,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 84 remaining) [2023-08-26 18:20:23,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:20:23,341 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:20:23,346 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:20:23,346 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:20:23,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:20:23 BasicIcfg [2023-08-26 18:20:23,414 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:20:23,414 INFO L158 Benchmark]: Toolchain (without parser) took 28451.52ms. Allocated memory was 360.7MB in the beginning and 1.2GB in the end (delta: 855.6MB). Free memory was 335.5MB in the beginning and 462.1MB in the end (delta: -126.6MB). Peak memory consumption was 730.8MB. Max. memory is 16.0GB. [2023-08-26 18:20:23,415 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 360.7MB. Free memory is still 336.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:20:23,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.98ms. Allocated memory is still 360.7MB. Free memory was 335.5MB in the beginning and 311.1MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:20:23,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.83ms. Allocated memory is still 360.7MB. Free memory was 310.4MB in the beginning and 308.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:20:23,415 INFO L158 Benchmark]: Boogie Preprocessor took 39.79ms. Allocated memory is still 360.7MB. Free memory was 308.3MB in the beginning and 306.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:20:23,415 INFO L158 Benchmark]: RCFGBuilder took 1200.61ms. Allocated memory is still 360.7MB. Free memory was 305.4MB in the beginning and 252.3MB in the end (delta: 53.1MB). Peak memory consumption was 67.2MB. Max. memory is 16.0GB. [2023-08-26 18:20:23,415 INFO L158 Benchmark]: TraceAbstraction took 26567.24ms. Allocated memory was 360.7MB in the beginning and 1.2GB in the end (delta: 855.6MB). Free memory was 252.3MB in the beginning and 462.1MB in the end (delta: -209.8MB). Peak memory consumption was 646.9MB. Max. memory is 16.0GB. [2023-08-26 18:20:23,416 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.15ms. Allocated memory is still 360.7MB. Free memory is still 336.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 581.98ms. Allocated memory is still 360.7MB. Free memory was 335.5MB in the beginning and 311.1MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.83ms. Allocated memory is still 360.7MB. Free memory was 310.4MB in the beginning and 308.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.79ms. Allocated memory is still 360.7MB. Free memory was 308.3MB in the beginning and 306.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1200.61ms. Allocated memory is still 360.7MB. Free memory was 305.4MB in the beginning and 252.3MB in the end (delta: 53.1MB). Peak memory consumption was 67.2MB. Max. memory is 16.0GB. * TraceAbstraction took 26567.24ms. Allocated memory was 360.7MB in the beginning and 1.2GB in the end (delta: 855.6MB). Free memory was 252.3MB in the beginning and 462.1MB in the end (delta: -209.8MB). Peak memory consumption was 646.9MB. 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: 8.9s, 179 PlacesBefore, 83 PlacesAfterwards, 172 TransitionsBefore, 75 TransitionsAfterwards, 7088 CoEnabledTransitionPairs, 8 FixpointIterations, 66 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 147 TotalNumberOfCompositions, 39193 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9993, independent: 9318, independent conditional: 0, independent unconditional: 9318, dependent: 675, dependent conditional: 0, dependent unconditional: 675, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2917, independent: 2837, independent conditional: 0, independent unconditional: 2837, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9993, independent: 6481, independent conditional: 0, independent unconditional: 6481, dependent: 595, dependent conditional: 0, dependent unconditional: 595, unknown: 2917, unknown conditional: 0, unknown unconditional: 2917] , Statistics on independence cache: Total cache size (in pairs): 491, Positive cache size: 437, Positive conditional cache size: 0, Positive unconditional cache size: 437, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, 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_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1737; [L851] FCALL, FORK 0 pthread_create(&t1737, ((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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1737, ((void *)0), P0, ((void *)0))=0, t1737={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L768] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L782] 1 __unbuffered_p0_EBX = 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L852] 0 pthread_t t1738; [L853] FCALL, FORK 0 pthread_create(&t1738, ((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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1738, ((void *)0), P1, ((void *)0))=1, t1737={5:0}, t1738={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L794] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L797] 2 __unbuffered_p1_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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L800] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 2 x$flush_delayed = weak$$choice2 [L803] EXPR 2 \read(x) [L803] 2 x$mem_tmp = x [L804] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] EXPR 2 \read(x) [L804] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L805] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L806] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L807] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L808] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L810] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L811] EXPR 2 \read(x) [L811] 2 __unbuffered_p1_EBX = x [L812] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L812] 2 x = x$flush_delayed ? x$mem_tmp : x [L813] 2 x$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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L854] 0 pthread_t t1739; 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1737={5:0}, t1738={7:0}, t1739={8:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L855] FCALL, FORK 0 pthread_create(&t1739, ((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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1739, ((void *)0), P2, ((void *)0))=2, t1737={5:0}, t1738={7:0}, t1739={8:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L825] 3 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L828] EXPR 3 \read(x) [L828] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L830] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L831] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L832] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L861] EXPR 0 \read(x) [L861] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1737={5:0}, t1738={7:0}, t1739={8:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L869] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L869] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L872] 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", "rfi009_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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: -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: 855]: 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: 853]: 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: 851]: 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, 232 locations, 84 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: 26.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 541 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 541 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1611 IncrementalHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 185 mSolverCounterUnsat, 5 mSDtfsCounter, 1611 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=865occurred in iteration=12, InterpolantAutomatonStates: 80, 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, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 1836 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 18:20:23,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...