/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/mix021_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:12:26,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:12:27,019 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:12:27,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:12:27,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:12:27,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:12:27,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:12:27,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:12:27,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:12:27,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:12:27,045 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:12:27,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:12:27,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:12:27,046 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:12:27,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:12:27,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:12:27,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:12:27,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:12:27,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:12:27,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:12:27,048 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:12:27,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:12:27,054 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:12:27,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:12:27,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:12:27,056 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:12:27,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:12:27,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:12:27,057 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:12:27,057 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:12:27,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:12:27,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:12:27,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:12:27,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:12:27,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:12:27,059 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:12:27,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:12:27,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:12:27,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:12:27,362 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:12:27,362 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:12:27,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:12:28,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:12:28,734 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:12:28,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:12:28,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a715be0/bd7b498ff5304ad98e6f69109dc2493a/FLAG49e4a05a1 [2023-08-26 18:12:28,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a715be0/bd7b498ff5304ad98e6f69109dc2493a [2023-08-26 18:12:28,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:12:28,771 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:12:28,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:12:28,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:12:28,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:12:28,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:12:28" (1/1) ... [2023-08-26 18:12:28,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6a47b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:12:28, skipping insertion in model container [2023-08-26 18:12:28,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:12:28" (1/1) ... [2023-08-26 18:12:28,837 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:12:29,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:12:29,196 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:12:29,224 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:12:29,230 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:12:29,257 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:12:29,292 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:12:29,292 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:12:29,299 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:12:29,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:12:29 WrapperNode [2023-08-26 18:12:29,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:12:29,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:12:29,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:12:29,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:12:29,306 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:12:29" (1/1) ... [2023-08-26 18:12:29,328 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:12:29" (1/1) ... [2023-08-26 18:12:29,354 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-08-26 18:12:29,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:12:29,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:12:29,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:12:29,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:12:29,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:12:29" (1/1) ... [2023-08-26 18:12:29,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:12:29" (1/1) ... [2023-08-26 18:12:29,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:12:29" (1/1) ... [2023-08-26 18:12:29,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:12:29" (1/1) ... [2023-08-26 18:12:29,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:12:29" (1/1) ... [2023-08-26 18:12:29,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:12:29" (1/1) ... [2023-08-26 18:12:29,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:12:29" (1/1) ... [2023-08-26 18:12:29,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:12:29" (1/1) ... [2023-08-26 18:12:29,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:12:29,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:12:29,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:12:29,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:12:29,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:12:29" (1/1) ... [2023-08-26 18:12:29,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:12:29,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:12:29,436 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:12:29,457 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:12:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:12:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:12:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:12:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:12:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:12:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:12:29,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:12:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:12:29,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:12:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:12:29,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:12:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:12:29,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:12:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:12:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:12:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:12:29,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:12:29,473 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:12:29,620 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:12:29,622 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:12:29,898 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:12:30,039 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:12:30,040 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:12:30,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:12:30 BoogieIcfgContainer [2023-08-26 18:12:30,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:12:30,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:12:30,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:12:30,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:12:30,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:12:28" (1/3) ... [2023-08-26 18:12:30,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c2dfb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:12:30, skipping insertion in model container [2023-08-26 18:12:30,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:12:29" (2/3) ... [2023-08-26 18:12:30,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57c2dfb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:12:30, skipping insertion in model container [2023-08-26 18:12:30,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:12:30" (3/3) ... [2023-08-26 18:12:30,051 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:12:30,065 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:12:30,065 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 18:12:30,066 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:12:30,131 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:12:30,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 18:12:30,239 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 18:12:30,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:12:30,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 18:12:30,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 304 flow [2023-08-26 18:12:30,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 138 transitions, 288 flow [2023-08-26 18:12:30,254 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:12:30,269 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 18:12:30,271 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 138 transitions, 288 flow [2023-08-26 18:12:30,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 288 flow [2023-08-26 18:12:30,320 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events. [2023-08-26 18:12:30,320 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:12:30,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-26 18:12:30,324 INFO L119 LiptonReduction]: Number of co-enabled transitions 3584 [2023-08-26 18:12:34,649 INFO L134 LiptonReduction]: Checked pairs total: 11299 [2023-08-26 18:12:34,650 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-08-26 18:12:34,661 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:12:34,666 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;@19c38cb8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:12:34,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 18:12:34,668 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:12:34,668 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:12:34,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:12:34,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:12:34,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:12:34,669 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:12:34,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:12:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash 626, now seen corresponding path program 1 times [2023-08-26 18:12:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:12:34,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052024895] [2023-08-26 18:12:34,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:12:34,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:12:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:12:34,762 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:12:34,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:12:34,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052024895] [2023-08-26 18:12:34,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052024895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:12:34,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:12:34,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:12:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3476632] [2023-08-26 18:12:34,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:12:34,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:12:34,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:12:34,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:12:34,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:12:34,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 284 [2023-08-26 18:12:34,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:12:34,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:12:34,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 284 [2023-08-26 18:12:34,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:12:35,815 INFO L124 PetriNetUnfolderBase]: 6239/8530 cut-off events. [2023-08-26 18:12:35,816 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-08-26 18:12:35,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17198 conditions, 8530 events. 6239/8530 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 43138 event pairs, 6239 based on Foata normal form. 0/7582 useless extension candidates. Maximal degree in co-relation 17186. Up to 8451 conditions per place. [2023-08-26 18:12:35,870 INFO L140 encePairwiseOnDemand]: 275/284 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-26 18:12:35,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-26 18:12:35,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:12:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:12:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2023-08-26 18:12:35,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052816901408451 [2023-08-26 18:12:35,885 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2023-08-26 18:12:35,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2023-08-26 18:12:35,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:12:35,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2023-08-26 18:12:35,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 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:12:35,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 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:12:35,894 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 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:12:35,895 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 287 transitions. [2023-08-26 18:12:35,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-26 18:12:35,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:12:35,902 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-26 18:12:35,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-26 18:12:35,907 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-26 18:12:35,907 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-26 18:12:35,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:12:35,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:12:35,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:12:35,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:12:35,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:12:35,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:12:35,908 INFO L85 PathProgramCache]: Analyzing trace with hash 617117, now seen corresponding path program 1 times [2023-08-26 18:12:35,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:12:35,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173222581] [2023-08-26 18:12:35,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:12:35,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:12:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:12:36,188 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:12:36,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:12:36,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173222581] [2023-08-26 18:12:36,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173222581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:12:36,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:12:36,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:12:36,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079034934] [2023-08-26 18:12:36,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:12:36,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:12:36,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:12:36,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:12:36,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:12:36,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 284 [2023-08-26 18:12:36,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:12:36,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:12:36,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 284 [2023-08-26 18:12:36,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:12:36,946 INFO L124 PetriNetUnfolderBase]: 4903/7130 cut-off events. [2023-08-26 18:12:36,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:12:36,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13975 conditions, 7130 events. 4903/7130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 42077 event pairs, 895 based on Foata normal form. 0/6789 useless extension candidates. Maximal degree in co-relation 13972. Up to 5335 conditions per place. [2023-08-26 18:12:36,981 INFO L140 encePairwiseOnDemand]: 281/284 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-08-26 18:12:36,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 202 flow [2023-08-26 18:12:36,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:12:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:12:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-26 18:12:36,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49413145539906106 [2023-08-26 18:12:36,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-26 18:12:36,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-26 18:12:36,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:12:36,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-26 18:12:36,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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:12:36,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 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:12:36,994 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 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:12:36,994 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 421 transitions. [2023-08-26 18:12:36,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 202 flow [2023-08-26 18:12:36,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:12:36,998 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-08-26 18:12:36,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-26 18:12:36,999 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-26 18:12:37,000 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-08-26 18:12:37,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:12:37,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:12:37,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:12:37,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:12:37,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:12:37,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:12:37,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1652525622, now seen corresponding path program 1 times [2023-08-26 18:12:37,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:12:37,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98147964] [2023-08-26 18:12:37,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:12:37,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:12:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:12:37,235 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:12:37,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:12:37,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98147964] [2023-08-26 18:12:37,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98147964] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:12:37,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:12:37,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:12:37,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001560638] [2023-08-26 18:12:37,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:12:37,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:12:37,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:12:37,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:12:37,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:12:37,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 284 [2023-08-26 18:12:37,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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:12:37,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:12:37,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 284 [2023-08-26 18:12:37,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:12:39,221 INFO L124 PetriNetUnfolderBase]: 16243/22100 cut-off events. [2023-08-26 18:12:39,222 INFO L125 PetriNetUnfolderBase]: For 1019/1019 co-relation queries the response was YES. [2023-08-26 18:12:39,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45717 conditions, 22100 events. 16243/22100 cut-off events. For 1019/1019 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 117088 event pairs, 5739 based on Foata normal form. 634/22734 useless extension candidates. Maximal degree in co-relation 45713. Up to 13082 conditions per place. [2023-08-26 18:12:39,328 INFO L140 encePairwiseOnDemand]: 275/284 looper letters, 43 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2023-08-26 18:12:39,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 222 flow [2023-08-26 18:12:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:12:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:12:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-26 18:12:39,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624413145539906 [2023-08-26 18:12:39,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-26 18:12:39,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-26 18:12:39,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:12:39,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-26 18:12:39,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:12:39,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 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:12:39,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 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:12:39,335 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 394 transitions. [2023-08-26 18:12:39,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 222 flow [2023-08-26 18:12:39,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:12:39,336 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 126 flow [2023-08-26 18:12:39,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-08-26 18:12:39,337 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2023-08-26 18:12:39,337 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 126 flow [2023-08-26 18:12:39,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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:12:39,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:12:39,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:12:39,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:12:39,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:12:39,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:12:39,339 INFO L85 PathProgramCache]: Analyzing trace with hash -311314809, now seen corresponding path program 1 times [2023-08-26 18:12:39,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:12:39,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577044606] [2023-08-26 18:12:39,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:12:39,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:12:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:12:39,487 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:12:39,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:12:39,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577044606] [2023-08-26 18:12:39,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577044606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:12:39,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:12:39,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:12:39,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87231122] [2023-08-26 18:12:39,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:12:39,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:12:39,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:12:39,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:12:39,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:12:39,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 284 [2023-08-26 18:12:39,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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:12:39,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:12:39,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 284 [2023-08-26 18:12:39,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:12:41,317 INFO L124 PetriNetUnfolderBase]: 15063/20506 cut-off events. [2023-08-26 18:12:41,317 INFO L125 PetriNetUnfolderBase]: For 9347/9347 co-relation queries the response was YES. [2023-08-26 18:12:41,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51832 conditions, 20506 events. 15063/20506 cut-off events. For 9347/9347 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 103959 event pairs, 4008 based on Foata normal form. 210/20716 useless extension candidates. Maximal degree in co-relation 51827. Up to 8969 conditions per place. [2023-08-26 18:12:41,404 INFO L140 encePairwiseOnDemand]: 275/284 looper letters, 56 selfloop transitions, 9 changer transitions 0/65 dead transitions. [2023-08-26 18:12:41,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 346 flow [2023-08-26 18:12:41,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:12:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:12:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-26 18:12:41,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45422535211267606 [2023-08-26 18:12:41,406 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-26 18:12:41,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-26 18:12:41,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:12:41,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-26 18:12:41,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 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:12:41,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 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:12:41,411 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 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:12:41,411 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 126 flow. Second operand 4 states and 516 transitions. [2023-08-26 18:12:41,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 346 flow [2023-08-26 18:12:41,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:12:41,439 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 178 flow [2023-08-26 18:12:41,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-08-26 18:12:41,440 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-08-26 18:12:41,441 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 178 flow [2023-08-26 18:12:41,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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:12:41,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:12:41,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:12:41,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:12:41,441 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:12:41,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:12:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1130596424, now seen corresponding path program 1 times [2023-08-26 18:12:41,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:12:41,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896231351] [2023-08-26 18:12:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:12:41,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:12:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:12:41,609 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:12:41,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:12:41,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896231351] [2023-08-26 18:12:41,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896231351] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:12:41,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:12:41,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:12:41,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112797905] [2023-08-26 18:12:41,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:12:41,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:12:41,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:12:41,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:12:41,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:12:41,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 284 [2023-08-26 18:12:41,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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:12:41,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:12:41,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 284 [2023-08-26 18:12:41,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:12:43,077 INFO L124 PetriNetUnfolderBase]: 14788/20131 cut-off events. [2023-08-26 18:12:43,077 INFO L125 PetriNetUnfolderBase]: For 15209/15209 co-relation queries the response was YES. [2023-08-26 18:12:43,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54165 conditions, 20131 events. 14788/20131 cut-off events. For 15209/15209 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 105912 event pairs, 2844 based on Foata normal form. 40/20171 useless extension candidates. Maximal degree in co-relation 54158. Up to 11267 conditions per place. [2023-08-26 18:12:43,167 INFO L140 encePairwiseOnDemand]: 275/284 looper letters, 63 selfloop transitions, 18 changer transitions 0/81 dead transitions. [2023-08-26 18:12:43,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 472 flow [2023-08-26 18:12:43,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:12:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:12:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-26 18:12:43,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4647887323943662 [2023-08-26 18:12:43,169 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-26 18:12:43,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-26 18:12:43,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:12:43,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-26 18:12:43,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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:12:43,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 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:12:43,174 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 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:12:43,175 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 178 flow. Second operand 4 states and 528 transitions. [2023-08-26 18:12:43,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 472 flow [2023-08-26 18:12:43,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:12:43,207 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 283 flow [2023-08-26 18:12:43,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=283, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2023-08-26 18:12:43,209 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-08-26 18:12:43,209 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 283 flow [2023-08-26 18:12:43,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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:12:43,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:12:43,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:12:43,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:12:43,210 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:12:43,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:12:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash -688698375, now seen corresponding path program 1 times [2023-08-26 18:12:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:12:43,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938519857] [2023-08-26 18:12:43,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:12:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:12:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:12:43,346 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:12:43,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:12:43,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938519857] [2023-08-26 18:12:43,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938519857] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:12:43,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:12:43,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:12:43,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272431153] [2023-08-26 18:12:43,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:12:43,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:12:43,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:12:43,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:12:43,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:12:43,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 284 [2023-08-26 18:12:43,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 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:12:43,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:12:43,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 284 [2023-08-26 18:12:43,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:12:44,906 INFO L124 PetriNetUnfolderBase]: 14589/19864 cut-off events. [2023-08-26 18:12:44,906 INFO L125 PetriNetUnfolderBase]: For 28222/28222 co-relation queries the response was YES. [2023-08-26 18:12:44,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60005 conditions, 19864 events. 14589/19864 cut-off events. For 28222/28222 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 104092 event pairs, 1545 based on Foata normal form. 32/19896 useless extension candidates. Maximal degree in co-relation 59995. Up to 11096 conditions per place. [2023-08-26 18:12:45,047 INFO L140 encePairwiseOnDemand]: 275/284 looper letters, 68 selfloop transitions, 22 changer transitions 0/90 dead transitions. [2023-08-26 18:12:45,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 90 transitions, 666 flow [2023-08-26 18:12:45,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:12:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:12:45,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-08-26 18:12:45,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4612676056338028 [2023-08-26 18:12:45,052 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-08-26 18:12:45,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-08-26 18:12:45,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:12:45,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-08-26 18:12:45,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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:12:45,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 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:12:45,057 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 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:12:45,057 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 283 flow. Second operand 4 states and 524 transitions. [2023-08-26 18:12:45,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 90 transitions, 666 flow [2023-08-26 18:12:45,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 90 transitions, 666 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:12:45,130 INFO L231 Difference]: Finished difference. Result has 56 places, 60 transitions, 512 flow [2023-08-26 18:12:45,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=512, PETRI_PLACES=56, PETRI_TRANSITIONS=60} [2023-08-26 18:12:45,134 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-08-26 18:12:45,137 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 60 transitions, 512 flow [2023-08-26 18:12:45,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 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:12:45,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:12:45,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:12:45,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:12:45,138 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:12:45,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:12:45,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1532757076, now seen corresponding path program 1 times [2023-08-26 18:12:45,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:12:45,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431019569] [2023-08-26 18:12:45,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:12:45,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:12:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:12:45,308 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:12:45,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:12:45,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431019569] [2023-08-26 18:12:45,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431019569] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:12:45,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:12:45,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:12:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570052773] [2023-08-26 18:12:45,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:12:45,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:12:45,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:12:45,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:12:45,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:12:45,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 284 [2023-08-26 18:12:45,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 60 transitions, 512 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 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:12:45,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:12:45,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 284 [2023-08-26 18:12:45,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:12:47,266 INFO L124 PetriNetUnfolderBase]: 19688/27036 cut-off events. [2023-08-26 18:12:47,266 INFO L125 PetriNetUnfolderBase]: For 71201/71201 co-relation queries the response was YES. [2023-08-26 18:12:47,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86813 conditions, 27036 events. 19688/27036 cut-off events. For 71201/71201 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 150814 event pairs, 3657 based on Foata normal form. 300/27336 useless extension candidates. Maximal degree in co-relation 86800. Up to 12108 conditions per place. [2023-08-26 18:12:47,575 INFO L140 encePairwiseOnDemand]: 275/284 looper letters, 66 selfloop transitions, 31 changer transitions 4/101 dead transitions. [2023-08-26 18:12:47,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 101 transitions, 886 flow [2023-08-26 18:12:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:12:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:12:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2023-08-26 18:12:47,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46566901408450706 [2023-08-26 18:12:47,579 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2023-08-26 18:12:47,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2023-08-26 18:12:47,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:12:47,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2023-08-26 18:12:47,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 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:12:47,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 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:12:47,583 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 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:12:47,583 INFO L175 Difference]: Start difference. First operand has 56 places, 60 transitions, 512 flow. Second operand 4 states and 529 transitions. [2023-08-26 18:12:47,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 101 transitions, 886 flow [2023-08-26 18:12:47,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 101 transitions, 886 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:12:47,698 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 692 flow [2023-08-26 18:12:47,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=692, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2023-08-26 18:12:47,699 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-26 18:12:47,699 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 692 flow [2023-08-26 18:12:47,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 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:12:47,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:12:47,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:12:47,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:12:47,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:12:47,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:12:47,700 INFO L85 PathProgramCache]: Analyzing trace with hash 125230607, now seen corresponding path program 1 times [2023-08-26 18:12:47,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:12:47,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332156934] [2023-08-26 18:12:47,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:12:47,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:12:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:12:47,822 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:12:47,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:12:47,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332156934] [2023-08-26 18:12:47,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332156934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:12:47,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:12:47,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:12:47,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984221201] [2023-08-26 18:12:47,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:12:47,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:12:47,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:12:47,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:12:47,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:12:47,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 284 [2023-08-26 18:12:47,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 692 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 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:12:47,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:12:47,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 284 [2023-08-26 18:12:47,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:12:49,279 INFO L124 PetriNetUnfolderBase]: 11933/17683 cut-off events. [2023-08-26 18:12:49,280 INFO L125 PetriNetUnfolderBase]: For 52197/53826 co-relation queries the response was YES. [2023-08-26 18:12:49,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54287 conditions, 17683 events. 11933/17683 cut-off events. For 52197/53826 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 115656 event pairs, 1992 based on Foata normal form. 1834/19154 useless extension candidates. Maximal degree in co-relation 54271. Up to 11053 conditions per place. [2023-08-26 18:12:49,353 INFO L140 encePairwiseOnDemand]: 277/284 looper letters, 116 selfloop transitions, 10 changer transitions 0/150 dead transitions. [2023-08-26 18:12:49,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 150 transitions, 1737 flow [2023-08-26 18:12:49,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:12:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:12:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-08-26 18:12:49,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591549295774648 [2023-08-26 18:12:49,359 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-08-26 18:12:49,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-08-26 18:12:49,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:12:49,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-08-26 18:12:49,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:12:49,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 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:12:49,364 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 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:12:49,364 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 692 flow. Second operand 5 states and 652 transitions. [2023-08-26 18:12:49,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 150 transitions, 1737 flow [2023-08-26 18:12:49,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 150 transitions, 1729 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-26 18:12:49,404 INFO L231 Difference]: Finished difference. Result has 69 places, 72 transitions, 765 flow [2023-08-26 18:12:49,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=765, PETRI_PLACES=69, PETRI_TRANSITIONS=72} [2023-08-26 18:12:49,406 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-26 18:12:49,406 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 765 flow [2023-08-26 18:12:49,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 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:12:49,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:12:49,407 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:12:49,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:12:49,407 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:12:49,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:12:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash 745661775, now seen corresponding path program 1 times [2023-08-26 18:12:49,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:12:49,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936960449] [2023-08-26 18:12:49,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:12:49,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:12:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:12:49,619 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:12:49,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:12:49,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936960449] [2023-08-26 18:12:49,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936960449] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:12:49,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:12:49,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:12:49,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377971101] [2023-08-26 18:12:49,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:12:49,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:12:49,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:12:49,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:12:49,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:12:49,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 284 [2023-08-26 18:12:49,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 72 transitions, 765 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 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:12:49,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:12:49,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 284 [2023-08-26 18:12:49,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:12:51,971 INFO L124 PetriNetUnfolderBase]: 20168/28970 cut-off events. [2023-08-26 18:12:51,972 INFO L125 PetriNetUnfolderBase]: For 140733/140733 co-relation queries the response was YES. [2023-08-26 18:12:52,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119500 conditions, 28970 events. 20168/28970 cut-off events. For 140733/140733 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 182001 event pairs, 1462 based on Foata normal form. 192/29162 useless extension candidates. Maximal degree in co-relation 119480. Up to 14393 conditions per place. [2023-08-26 18:12:52,109 INFO L140 encePairwiseOnDemand]: 274/284 looper letters, 92 selfloop transitions, 47 changer transitions 19/158 dead transitions. [2023-08-26 18:12:52,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 158 transitions, 1713 flow [2023-08-26 18:12:52,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:12:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:12:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-08-26 18:12:52,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4507042253521127 [2023-08-26 18:12:52,111 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-08-26 18:12:52,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-08-26 18:12:52,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:12:52,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-08-26 18:12:52,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 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:12:52,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 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:12:52,116 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 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:12:52,116 INFO L175 Difference]: Start difference. First operand has 69 places, 72 transitions, 765 flow. Second operand 5 states and 640 transitions. [2023-08-26 18:12:52,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 158 transitions, 1713 flow [2023-08-26 18:12:52,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 158 transitions, 1698 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:12:52,308 INFO L231 Difference]: Finished difference. Result has 75 places, 90 transitions, 1250 flow [2023-08-26 18:12:52,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1250, PETRI_PLACES=75, PETRI_TRANSITIONS=90} [2023-08-26 18:12:52,308 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places. [2023-08-26 18:12:52,308 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 90 transitions, 1250 flow [2023-08-26 18:12:52,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 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:12:52,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:12:52,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:12:52,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:12:52,309 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:12:52,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:12:52,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1808474689, now seen corresponding path program 1 times [2023-08-26 18:12:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:12:52,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229839543] [2023-08-26 18:12:52,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:12:52,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:12:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:12:52,467 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:12:52,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:12:52,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229839543] [2023-08-26 18:12:52,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229839543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:12:52,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:12:52,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:12:52,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402294969] [2023-08-26 18:12:52,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:12:52,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:12:52,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:12:52,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:12:52,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:12:52,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 284 [2023-08-26 18:12:52,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 90 transitions, 1250 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 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:12:52,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:12:52,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 284 [2023-08-26 18:12:52,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:12:55,662 INFO L124 PetriNetUnfolderBase]: 20128/29244 cut-off events. [2023-08-26 18:12:55,662 INFO L125 PetriNetUnfolderBase]: For 174395/174395 co-relation queries the response was YES. [2023-08-26 18:12:55,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125169 conditions, 29244 events. 20128/29244 cut-off events. For 174395/174395 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 184849 event pairs, 6619 based on Foata normal form. 168/29412 useless extension candidates. Maximal degree in co-relation 125146. Up to 14486 conditions per place. [2023-08-26 18:12:55,768 INFO L140 encePairwiseOnDemand]: 275/284 looper letters, 96 selfloop transitions, 37 changer transitions 15/148 dead transitions. [2023-08-26 18:12:55,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 148 transitions, 1958 flow [2023-08-26 18:12:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:12:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:12:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-26 18:12:55,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4665492957746479 [2023-08-26 18:12:55,770 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-26 18:12:55,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-26 18:12:55,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:12:55,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-26 18:12:55,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 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:12:55,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 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:12:55,774 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 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:12:55,774 INFO L175 Difference]: Start difference. First operand has 75 places, 90 transitions, 1250 flow. Second operand 4 states and 530 transitions. [2023-08-26 18:12:55,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 148 transitions, 1958 flow [2023-08-26 18:12:56,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 148 transitions, 1936 flow, removed 11 selfloop flow, removed 1 redundant places. [2023-08-26 18:12:56,168 INFO L231 Difference]: Finished difference. Result has 78 places, 87 transitions, 1344 flow [2023-08-26 18:12:56,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1344, PETRI_PLACES=78, PETRI_TRANSITIONS=87} [2023-08-26 18:12:56,169 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2023-08-26 18:12:56,169 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 87 transitions, 1344 flow [2023-08-26 18:12:56,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 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:12:56,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:12:56,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:12:56,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:12:56,169 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:12:56,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:12:56,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1504729412, now seen corresponding path program 1 times [2023-08-26 18:12:56,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:12:56,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117424708] [2023-08-26 18:12:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:12:56,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:12:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:12:56,295 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:12:56,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:12:56,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117424708] [2023-08-26 18:12:56,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117424708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:12:56,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:12:56,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:12:56,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704721524] [2023-08-26 18:12:56,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:12:56,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:12:56,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:12:56,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:12:56,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:12:56,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 284 [2023-08-26 18:12:56,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 87 transitions, 1344 flow. Second operand has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 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:12:56,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:12:56,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 284 [2023-08-26 18:12:56,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:12:57,993 INFO L124 PetriNetUnfolderBase]: 9957/15637 cut-off events. [2023-08-26 18:12:57,993 INFO L125 PetriNetUnfolderBase]: For 68243/69003 co-relation queries the response was YES. [2023-08-26 18:12:58,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59986 conditions, 15637 events. 9957/15637 cut-off events. For 68243/69003 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 110218 event pairs, 1182 based on Foata normal form. 1780/17221 useless extension candidates. Maximal degree in co-relation 59961. Up to 6328 conditions per place. [2023-08-26 18:12:58,056 INFO L140 encePairwiseOnDemand]: 277/284 looper letters, 165 selfloop transitions, 14 changer transitions 12/224 dead transitions. [2023-08-26 18:12:58,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 224 transitions, 3494 flow [2023-08-26 18:12:58,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:12:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:12:58,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2023-08-26 18:12:58,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46068075117370894 [2023-08-26 18:12:58,059 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2023-08-26 18:12:58,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2023-08-26 18:12:58,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:12:58,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2023-08-26 18:12:58,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 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:12:58,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 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:12:58,063 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 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:12:58,063 INFO L175 Difference]: Start difference. First operand has 78 places, 87 transitions, 1344 flow. Second operand 6 states and 785 transitions. [2023-08-26 18:12:58,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 224 transitions, 3494 flow [2023-08-26 18:12:58,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 224 transitions, 3470 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-26 18:12:58,120 INFO L231 Difference]: Finished difference. Result has 86 places, 95 transitions, 1433 flow [2023-08-26 18:12:58,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1433, PETRI_PLACES=86, PETRI_TRANSITIONS=95} [2023-08-26 18:12:58,120 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 35 predicate places. [2023-08-26 18:12:58,120 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 95 transitions, 1433 flow [2023-08-26 18:12:58,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 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:12:58,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:12:58,121 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, 1] [2023-08-26 18:12:58,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:12:58,121 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:12:58,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:12:58,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1707920895, now seen corresponding path program 1 times [2023-08-26 18:12:58,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:12:58,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417168595] [2023-08-26 18:12:58,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:12:58,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:12:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:12:58,287 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:12:58,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:12:58,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417168595] [2023-08-26 18:12:58,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417168595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:12:58,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:12:58,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:12:58,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335505969] [2023-08-26 18:12:58,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:12:58,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:12:58,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:12:58,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:12:58,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:12:58,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 284 [2023-08-26 18:12:58,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 95 transitions, 1433 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 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:12:58,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:12:58,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 284 [2023-08-26 18:12:58,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:00,141 INFO L124 PetriNetUnfolderBase]: 8591/13609 cut-off events. [2023-08-26 18:13:00,141 INFO L125 PetriNetUnfolderBase]: For 65068/65596 co-relation queries the response was YES. [2023-08-26 18:13:00,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61557 conditions, 13609 events. 8591/13609 cut-off events. For 65068/65596 co-relation queries the response was YES. Maximal size of possible extension queue 787. Compared 95481 event pairs, 838 based on Foata normal form. 805/14222 useless extension candidates. Maximal degree in co-relation 61528. Up to 5771 conditions per place. [2023-08-26 18:13:00,216 INFO L140 encePairwiseOnDemand]: 277/284 looper letters, 169 selfloop transitions, 23 changer transitions 40/260 dead transitions. [2023-08-26 18:13:00,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 260 transitions, 3925 flow [2023-08-26 18:13:00,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:13:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:13:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1046 transitions. [2023-08-26 18:13:00,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.460387323943662 [2023-08-26 18:13:00,220 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1046 transitions. [2023-08-26 18:13:00,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1046 transitions. [2023-08-26 18:13:00,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:00,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1046 transitions. [2023-08-26 18:13:00,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.75) internal successors, (1046), 8 states have internal predecessors, (1046), 0 states have call successors, (0), 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:13:00,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 284.0) internal successors, (2556), 9 states have internal predecessors, (2556), 0 states have call successors, (0), 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:13:00,226 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 284.0) internal successors, (2556), 9 states have internal predecessors, (2556), 0 states have call successors, (0), 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:13:00,226 INFO L175 Difference]: Start difference. First operand has 86 places, 95 transitions, 1433 flow. Second operand 8 states and 1046 transitions. [2023-08-26 18:13:00,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 260 transitions, 3925 flow [2023-08-26 18:13:01,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 260 transitions, 3879 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-26 18:13:01,484 INFO L231 Difference]: Finished difference. Result has 94 places, 98 transitions, 1446 flow [2023-08-26 18:13:01,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1446, PETRI_PLACES=94, PETRI_TRANSITIONS=98} [2023-08-26 18:13:01,485 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 43 predicate places. [2023-08-26 18:13:01,485 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 98 transitions, 1446 flow [2023-08-26 18:13:01,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 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:13:01,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:01,486 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, 1, 1, 1] [2023-08-26 18:13:01,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:13:01,486 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:01,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:01,486 INFO L85 PathProgramCache]: Analyzing trace with hash 158734737, now seen corresponding path program 1 times [2023-08-26 18:13:01,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:01,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135690662] [2023-08-26 18:13:01,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:01,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:01,729 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:13:01,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:01,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135690662] [2023-08-26 18:13:01,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135690662] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:01,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:01,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:13:01,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819102579] [2023-08-26 18:13:01,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:01,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:13:01,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:01,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:13:01,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:13:01,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 284 [2023-08-26 18:13:01,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 98 transitions, 1446 flow. Second operand has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 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:13:01,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:01,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 284 [2023-08-26 18:13:01,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:03,182 INFO L124 PetriNetUnfolderBase]: 7669/12172 cut-off events. [2023-08-26 18:13:03,182 INFO L125 PetriNetUnfolderBase]: For 67997/68496 co-relation queries the response was YES. [2023-08-26 18:13:03,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56314 conditions, 12172 events. 7669/12172 cut-off events. For 67997/68496 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 84727 event pairs, 775 based on Foata normal form. 291/12291 useless extension candidates. Maximal degree in co-relation 56282. Up to 3302 conditions per place. [2023-08-26 18:13:03,226 INFO L140 encePairwiseOnDemand]: 277/284 looper letters, 90 selfloop transitions, 26 changer transitions 123/251 dead transitions. [2023-08-26 18:13:03,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 251 transitions, 3816 flow [2023-08-26 18:13:03,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 18:13:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 18:13:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1279 transitions. [2023-08-26 18:13:03,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45035211267605635 [2023-08-26 18:13:03,230 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1279 transitions. [2023-08-26 18:13:03,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1279 transitions. [2023-08-26 18:13:03,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:03,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1279 transitions. [2023-08-26 18:13:03,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 127.9) internal successors, (1279), 10 states have internal predecessors, (1279), 0 states have call successors, (0), 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:13:03,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 284.0) internal successors, (3124), 11 states have internal predecessors, (3124), 0 states have call successors, (0), 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:13:03,236 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 284.0) internal successors, (3124), 11 states have internal predecessors, (3124), 0 states have call successors, (0), 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:13:03,237 INFO L175 Difference]: Start difference. First operand has 94 places, 98 transitions, 1446 flow. Second operand 10 states and 1279 transitions. [2023-08-26 18:13:03,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 251 transitions, 3816 flow [2023-08-26 18:13:04,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 251 transitions, 3449 flow, removed 46 selfloop flow, removed 9 redundant places. [2023-08-26 18:13:04,659 INFO L231 Difference]: Finished difference. Result has 97 places, 65 transitions, 677 flow [2023-08-26 18:13:04,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=677, PETRI_PLACES=97, PETRI_TRANSITIONS=65} [2023-08-26 18:13:04,660 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 46 predicate places. [2023-08-26 18:13:04,660 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 65 transitions, 677 flow [2023-08-26 18:13:04,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 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:13:04,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:04,661 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:04,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:13:04,661 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:04,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:04,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1498493282, now seen corresponding path program 1 times [2023-08-26 18:13:04,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:04,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110314050] [2023-08-26 18:13:04,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:05,632 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:13:05,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:05,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110314050] [2023-08-26 18:13:05,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110314050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:05,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:05,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:13:05,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228633012] [2023-08-26 18:13:05,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:05,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:13:05,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:05,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:13:05,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:13:05,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 284 [2023-08-26 18:13:05,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 65 transitions, 677 flow. Second operand has 8 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 0 states have call successors, (0), 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:13:05,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:05,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 284 [2023-08-26 18:13:05,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:06,338 INFO L124 PetriNetUnfolderBase]: 2890/4601 cut-off events. [2023-08-26 18:13:06,338 INFO L125 PetriNetUnfolderBase]: For 23956/23956 co-relation queries the response was YES. [2023-08-26 18:13:06,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20967 conditions, 4601 events. 2890/4601 cut-off events. For 23956/23956 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 25710 event pairs, 369 based on Foata normal form. 1/4602 useless extension candidates. Maximal degree in co-relation 20935. Up to 2116 conditions per place. [2023-08-26 18:13:06,362 INFO L140 encePairwiseOnDemand]: 272/284 looper letters, 64 selfloop transitions, 19 changer transitions 146/229 dead transitions. [2023-08-26 18:13:06,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 229 transitions, 2561 flow [2023-08-26 18:13:06,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:13:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:13:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1052 transitions. [2023-08-26 18:13:06,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41158059467918623 [2023-08-26 18:13:06,365 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1052 transitions. [2023-08-26 18:13:06,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1052 transitions. [2023-08-26 18:13:06,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:06,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1052 transitions. [2023-08-26 18:13:06,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.88888888888889) internal successors, (1052), 9 states have internal predecessors, (1052), 0 states have call successors, (0), 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:13:06,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 284.0) internal successors, (2840), 10 states have internal predecessors, (2840), 0 states have call successors, (0), 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:13:06,371 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 284.0) internal successors, (2840), 10 states have internal predecessors, (2840), 0 states have call successors, (0), 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:13:06,371 INFO L175 Difference]: Start difference. First operand has 97 places, 65 transitions, 677 flow. Second operand 9 states and 1052 transitions. [2023-08-26 18:13:06,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 229 transitions, 2561 flow [2023-08-26 18:13:06,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 229 transitions, 2014 flow, removed 85 selfloop flow, removed 21 redundant places. [2023-08-26 18:13:06,451 INFO L231 Difference]: Finished difference. Result has 87 places, 58 transitions, 502 flow [2023-08-26 18:13:06,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=502, PETRI_PLACES=87, PETRI_TRANSITIONS=58} [2023-08-26 18:13:06,452 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2023-08-26 18:13:06,452 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 58 transitions, 502 flow [2023-08-26 18:13:06,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 0 states have call successors, (0), 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:13:06,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:06,452 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:06,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:13:06,453 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:06,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:06,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1020049946, now seen corresponding path program 2 times [2023-08-26 18:13:06,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:06,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472644728] [2023-08-26 18:13:06,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:06,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:06,646 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:13:06,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:06,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472644728] [2023-08-26 18:13:06,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472644728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:06,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:06,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:13:06,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947303795] [2023-08-26 18:13:06,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:06,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:13:06,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:06,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:13:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:13:06,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 284 [2023-08-26 18:13:06,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 58 transitions, 502 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 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:13:06,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:06,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 284 [2023-08-26 18:13:06,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:06,924 INFO L124 PetriNetUnfolderBase]: 1111/1791 cut-off events. [2023-08-26 18:13:06,924 INFO L125 PetriNetUnfolderBase]: For 4113/4113 co-relation queries the response was YES. [2023-08-26 18:13:06,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6527 conditions, 1791 events. 1111/1791 cut-off events. For 4113/4113 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8146 event pairs, 204 based on Foata normal form. 1/1792 useless extension candidates. Maximal degree in co-relation 6502. Up to 688 conditions per place. [2023-08-26 18:13:06,930 INFO L140 encePairwiseOnDemand]: 275/284 looper letters, 47 selfloop transitions, 5 changer transitions 55/107 dead transitions. [2023-08-26 18:13:06,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 107 transitions, 969 flow [2023-08-26 18:13:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:13:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:13:06,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 741 transitions. [2023-08-26 18:13:06,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43485915492957744 [2023-08-26 18:13:06,932 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 741 transitions. [2023-08-26 18:13:06,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 741 transitions. [2023-08-26 18:13:06,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:06,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 741 transitions. [2023-08-26 18:13:06,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 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:13:06,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 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:13:06,936 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 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:13:06,936 INFO L175 Difference]: Start difference. First operand has 87 places, 58 transitions, 502 flow. Second operand 6 states and 741 transitions. [2023-08-26 18:13:06,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 107 transitions, 969 flow [2023-08-26 18:13:06,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 107 transitions, 935 flow, removed 13 selfloop flow, removed 8 redundant places. [2023-08-26 18:13:06,954 INFO L231 Difference]: Finished difference. Result has 78 places, 40 transitions, 245 flow [2023-08-26 18:13:06,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=78, PETRI_TRANSITIONS=40} [2023-08-26 18:13:06,955 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2023-08-26 18:13:06,955 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 40 transitions, 245 flow [2023-08-26 18:13:06,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 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:13:06,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:06,955 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:06,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:13:06,955 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:13:06,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:06,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1883625542, now seen corresponding path program 3 times [2023-08-26 18:13:06,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:06,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023790855] [2023-08-26 18:13:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:06,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:13:07,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:13:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:13:07,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:13:07,105 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:13:07,106 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 18:13:07,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 18:13:07,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 18:13:07,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 18:13:07,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 18:13:07,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 18:13:07,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 18:13:07,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 18:13:07,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 18:13:07,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 18:13:07,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 18:13:07,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 18:13:07,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 18:13:07,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 18:13:07,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 18:13:07,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:13:07,111 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:07,115 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:13:07,115 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:13:07,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:13:07 BasicIcfg [2023-08-26 18:13:07,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:13:07,208 INFO L158 Benchmark]: Toolchain (without parser) took 38436.73ms. Allocated memory was 383.8MB in the beginning and 7.4GB in the end (delta: 7.1GB). Free memory was 358.9MB in the beginning and 6.3GB in the end (delta: -5.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-26 18:13:07,208 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 383.8MB. Free memory is still 361.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:13:07,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.27ms. Allocated memory is still 383.8MB. Free memory was 358.9MB in the beginning and 334.7MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:13:07,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.48ms. Allocated memory is still 383.8MB. Free memory was 334.7MB in the beginning and 332.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:13:07,209 INFO L158 Benchmark]: Boogie Preprocessor took 40.31ms. Allocated memory is still 383.8MB. Free memory was 332.2MB in the beginning and 330.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:13:07,209 INFO L158 Benchmark]: RCFGBuilder took 644.22ms. Allocated memory is still 383.8MB. Free memory was 330.1MB in the beginning and 337.7MB in the end (delta: -7.6MB). Peak memory consumption was 27.1MB. Max. memory is 16.0GB. [2023-08-26 18:13:07,209 INFO L158 Benchmark]: TraceAbstraction took 37162.74ms. Allocated memory was 383.8MB in the beginning and 7.4GB in the end (delta: 7.1GB). Free memory was 337.7MB in the beginning and 6.3GB in the end (delta: -5.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-26 18:13:07,210 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 383.8MB. Free memory is still 361.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 527.27ms. Allocated memory is still 383.8MB. Free memory was 358.9MB in the beginning and 334.7MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.48ms. Allocated memory is still 383.8MB. Free memory was 334.7MB in the beginning and 332.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.31ms. Allocated memory is still 383.8MB. Free memory was 332.2MB in the beginning and 330.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 644.22ms. Allocated memory is still 383.8MB. Free memory was 330.1MB in the beginning and 337.7MB in the end (delta: -7.6MB). Peak memory consumption was 27.1MB. Max. memory is 16.0GB. * TraceAbstraction took 37162.74ms. Allocated memory was 383.8MB in the beginning and 7.4GB in the end (delta: 7.1GB). Free memory was 337.7MB in the beginning and 6.3GB in the end (delta: -5.9GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 148 PlacesBefore, 51 PlacesAfterwards, 138 TransitionsBefore, 39 TransitionsAfterwards, 3584 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 19 ConcurrentYvCompositions, 2 ChoiceCompositions, 142 TotalNumberOfCompositions, 11299 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5215, independent: 4958, independent conditional: 0, independent unconditional: 4958, dependent: 257, dependent conditional: 0, dependent unconditional: 257, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2107, independent: 2054, independent conditional: 0, independent unconditional: 2054, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5215, independent: 2904, independent conditional: 0, independent unconditional: 2904, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 2107, unknown conditional: 0, unknown unconditional: 2107] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 184, Positive conditional cache size: 0, Positive unconditional cache size: 184, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t553; [L865] FCALL, FORK 0 pthread_create(&t553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t553, ((void *)0), P0, ((void *)0))=-4, t553={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t554; [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t554, ((void *)0), P1, ((void *)0))=-3, t553={5:0}, t554={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] 0 pthread_t t555; [L869] FCALL, FORK 0 pthread_create(&t555, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t555, ((void *)0), P2, ((void *)0))=-2, t553={5:0}, t554={6:0}, t555={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L870] 0 pthread_t t556; [L871] FCALL, FORK 0 pthread_create(&t556, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t556, ((void *)0), P3, ((void *)0))=-1, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L800] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L820] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix021_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds 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: 867]: 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: 865]: 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: 871]: 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: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 178 locations, 15 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: 37.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 28.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 657 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 657 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1547 IncrementalHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 59 mSDtfsCounter, 1547 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1446occurred in iteration=12, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 1512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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:13:07,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...