/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:16:54,361 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:16:54,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:16:54,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:16:54,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:16:54,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:16:54,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:16:54,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:16:54,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:16:54,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:16:54,489 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:16:54,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:16:54,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:16:54,490 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:16:54,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:16:54,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:16:54,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:16:54,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:16:54,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:16:54,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:16:54,492 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:16:54,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:16:54,492 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:16:54,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:16:54,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:16:54,493 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:16:54,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:16:54,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:16:54,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:16:54,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:16:54,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:16:54,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:16:54,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:16:54,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:16:54,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:16:54,496 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:16:54,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:16:54,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:16:54,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:16:54,845 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:16:54,845 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:16:54,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 12:16:56,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:16:56,365 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:16:56,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 12:16:56,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d892c34a6/7a6bbbe4a7104f8a96cb75a4778b748d/FLAG90ac4dd5a [2023-08-26 12:16:56,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d892c34a6/7a6bbbe4a7104f8a96cb75a4778b748d [2023-08-26 12:16:56,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:16:56,394 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:16:56,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:16:56,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:16:56,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:16:56,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:16:56" (1/1) ... [2023-08-26 12:16:56,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce9813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56, skipping insertion in model container [2023-08-26 12:16:56,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:16:56" (1/1) ... [2023-08-26 12:16:56,433 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:16:56,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:16:56,800 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:16:56,828 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:16:56,830 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:16:56,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:16:56,916 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:16:56,916 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:16:56,922 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:16:56,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56 WrapperNode [2023-08-26 12:16:56,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:16:56,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:16:56,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:16:56,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:16:56,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56" (1/1) ... [2023-08-26 12:16:56,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56" (1/1) ... [2023-08-26 12:16:56,994 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2023-08-26 12:16:56,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:16:56,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:16:56,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:16:56,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:16:57,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56" (1/1) ... [2023-08-26 12:16:57,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56" (1/1) ... [2023-08-26 12:16:57,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56" (1/1) ... [2023-08-26 12:16:57,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56" (1/1) ... [2023-08-26 12:16:57,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56" (1/1) ... [2023-08-26 12:16:57,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56" (1/1) ... [2023-08-26 12:16:57,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56" (1/1) ... [2023-08-26 12:16:57,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56" (1/1) ... [2023-08-26 12:16:57,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:16:57,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:16:57,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:16:57,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:16:57,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56" (1/1) ... [2023-08-26 12:16:57,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:16:57,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:16:57,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:16:57,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:16:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:16:57,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:16:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:16:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:16:57,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:16:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:16:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:16:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:16:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:16:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:16:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:16:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:16:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:16:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:16:57,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:16:57,119 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:16:57,259 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:16:57,260 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:16:57,604 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:16:57,735 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:16:57,736 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:16:57,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:16:57 BoogieIcfgContainer [2023-08-26 12:16:57,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:16:57,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:16:57,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:16:57,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:16:57,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:16:56" (1/3) ... [2023-08-26 12:16:57,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d7dd40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:16:57, skipping insertion in model container [2023-08-26 12:16:57,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:16:56" (2/3) ... [2023-08-26 12:16:57,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d7dd40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:16:57, skipping insertion in model container [2023-08-26 12:16:57,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:16:57" (3/3) ... [2023-08-26 12:16:57,745 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 12:16:57,766 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:16:57,766 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 12:16:57,766 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:16:57,813 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:16:57,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 251 flow [2023-08-26 12:16:57,884 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-08-26 12:16:57,884 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:16:57,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-26 12:16:57,890 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 118 transitions, 251 flow [2023-08-26 12:16:57,893 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 115 transitions, 239 flow [2023-08-26 12:16:57,896 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:16:57,904 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 115 transitions, 239 flow [2023-08-26 12:16:57,906 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 115 transitions, 239 flow [2023-08-26 12:16:57,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 115 transitions, 239 flow [2023-08-26 12:16:57,928 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-08-26 12:16:57,928 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:16:57,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-26 12:16:57,931 INFO L119 LiptonReduction]: Number of co-enabled transitions 2038 [2023-08-26 12:17:01,630 INFO L134 LiptonReduction]: Checked pairs total: 5089 [2023-08-26 12:17:01,630 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-26 12:17:01,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:17:01,647 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;@308d546f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:17:01,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 12:17:01,648 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:17:01,648 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:17:01,648 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:17:01,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:01,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:17:01,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:17:01,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:01,653 INFO L85 PathProgramCache]: Analyzing trace with hash 535, now seen corresponding path program 1 times [2023-08-26 12:17:01,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:01,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690874175] [2023-08-26 12:17:01,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:01,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:17:01,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:01,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690874175] [2023-08-26 12:17:01,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690874175] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:01,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:01,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:17:01,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650381263] [2023-08-26 12:17:01,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:01,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:17:01,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:17:01,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:17:01,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-08-26 12:17:01,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:01,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:01,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-08-26 12:17:01,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:02,017 INFO L124 PetriNetUnfolderBase]: 909/1380 cut-off events. [2023-08-26 12:17:02,017 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 12:17:02,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 1380 events. 909/1380 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6094 event pairs, 909 based on Foata normal form. 0/1191 useless extension candidates. Maximal degree in co-relation 2782. Up to 1359 conditions per place. [2023-08-26 12:17:02,049 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 20 selfloop transitions, 0 changer transitions 0/22 dead transitions. [2023-08-26 12:17:02,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 22 transitions, 93 flow [2023-08-26 12:17:02,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:17:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:17:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 237 transitions. [2023-08-26 12:17:02,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.491701244813278 [2023-08-26 12:17:02,061 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 237 transitions. [2023-08-26 12:17:02,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 237 transitions. [2023-08-26 12:17:02,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:02,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 237 transitions. [2023-08-26 12:17:02,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 118.5) internal successors, (237), 2 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:02,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:02,072 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:02,073 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 2 states and 237 transitions. [2023-08-26 12:17:02,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 22 transitions, 93 flow [2023-08-26 12:17:02,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 22 transitions, 90 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:17:02,077 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 50 flow [2023-08-26 12:17:02,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-26 12:17:02,082 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -8 predicate places. [2023-08-26 12:17:02,082 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 50 flow [2023-08-26 12:17:02,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:02,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:02,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:17:02,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:17:02,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:17:02,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:02,084 INFO L85 PathProgramCache]: Analyzing trace with hash 504921706, now seen corresponding path program 1 times [2023-08-26 12:17:02,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:02,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239394378] [2023-08-26 12:17:02,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:02,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:17:02,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:02,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239394378] [2023-08-26 12:17:02,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239394378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:02,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:02,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:17:02,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146310307] [2023-08-26 12:17:02,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:02,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:17:02,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:17:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:17:02,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 241 [2023-08-26 12:17:02,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:02,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:02,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 241 [2023-08-26 12:17:02,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:02,564 INFO L124 PetriNetUnfolderBase]: 711/1124 cut-off events. [2023-08-26 12:17:02,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:17:02,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2241 conditions, 1124 events. 711/1124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4960 event pairs, 197 based on Foata normal form. 0/1056 useless extension candidates. Maximal degree in co-relation 2238. Up to 859 conditions per place. [2023-08-26 12:17:02,570 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 27 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-08-26 12:17:02,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 136 flow [2023-08-26 12:17:02,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:17:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:17:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-08-26 12:17:02,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47579529737206083 [2023-08-26 12:17:02,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-08-26 12:17:02,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-08-26 12:17:02,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:02,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-08-26 12:17:02,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:02,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:02,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:02,578 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 50 flow. Second operand 3 states and 344 transitions. [2023-08-26 12:17:02,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 136 flow [2023-08-26 12:17:02,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:17:02,580 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 50 flow [2023-08-26 12:17:02,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-08-26 12:17:02,581 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -7 predicate places. [2023-08-26 12:17:02,581 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 50 flow [2023-08-26 12:17:02,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:02,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:02,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:02,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:17:02,582 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:17:02,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:02,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1254743060, now seen corresponding path program 1 times [2023-08-26 12:17:02,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:02,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176038685] [2023-08-26 12:17:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:17:02,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:02,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176038685] [2023-08-26 12:17:02,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176038685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:02,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:02,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:17:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426119743] [2023-08-26 12:17:02,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:02,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:17:02,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:02,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:17:02,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:17:02,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 241 [2023-08-26 12:17:02,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:02,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:02,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 241 [2023-08-26 12:17:02,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:03,003 INFO L124 PetriNetUnfolderBase]: 527/859 cut-off events. [2023-08-26 12:17:03,003 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2023-08-26 12:17:03,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 859 events. 527/859 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3771 event pairs, 143 based on Foata normal form. 16/871 useless extension candidates. Maximal degree in co-relation 1778. Up to 609 conditions per place. [2023-08-26 12:17:03,009 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 24 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-08-26 12:17:03,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 120 flow [2023-08-26 12:17:03,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:17:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:17:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-26 12:17:03,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4605809128630705 [2023-08-26 12:17:03,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-26 12:17:03,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-26 12:17:03,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:03,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-26 12:17:03,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,016 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,016 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 50 flow. Second operand 3 states and 333 transitions. [2023-08-26 12:17:03,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 120 flow [2023-08-26 12:17:03,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:17:03,018 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 54 flow [2023-08-26 12:17:03,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-08-26 12:17:03,020 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -7 predicate places. [2023-08-26 12:17:03,020 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 54 flow [2023-08-26 12:17:03,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:03,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:03,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:17:03,024 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:17:03,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:03,024 INFO L85 PathProgramCache]: Analyzing trace with hash 242327665, now seen corresponding path program 1 times [2023-08-26 12:17:03,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:03,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180010424] [2023-08-26 12:17:03,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:03,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:03,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:17:03,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:03,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180010424] [2023-08-26 12:17:03,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180010424] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:03,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:03,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:17:03,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707977044] [2023-08-26 12:17:03,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:03,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:17:03,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:03,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:17:03,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:17:03,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 241 [2023-08-26 12:17:03,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:03,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 241 [2023-08-26 12:17:03,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:03,435 INFO L124 PetriNetUnfolderBase]: 805/1290 cut-off events. [2023-08-26 12:17:03,435 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2023-08-26 12:17:03,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2740 conditions, 1290 events. 805/1290 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5961 event pairs, 211 based on Foata normal form. 60/1342 useless extension candidates. Maximal degree in co-relation 2735. Up to 486 conditions per place. [2023-08-26 12:17:03,441 INFO L140 encePairwiseOnDemand]: 237/241 looper letters, 30 selfloop transitions, 3 changer transitions 5/39 dead transitions. [2023-08-26 12:17:03,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 173 flow [2023-08-26 12:17:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:17:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:17:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-08-26 12:17:03,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45643153526970953 [2023-08-26 12:17:03,443 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-08-26 12:17:03,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-08-26 12:17:03,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:03,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-08-26 12:17:03,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,448 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,448 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 54 flow. Second operand 4 states and 440 transitions. [2023-08-26 12:17:03,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 173 flow [2023-08-26 12:17:03,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:17:03,450 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 64 flow [2023-08-26 12:17:03,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2023-08-26 12:17:03,451 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2023-08-26 12:17:03,452 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 64 flow [2023-08-26 12:17:03,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:03,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:03,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:17:03,453 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:17:03,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1789974011, now seen corresponding path program 1 times [2023-08-26 12:17:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:03,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674482229] [2023-08-26 12:17:03,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:03,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:17:03,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:03,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674482229] [2023-08-26 12:17:03,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674482229] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:03,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:03,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:17:03,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911606580] [2023-08-26 12:17:03,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:03,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:17:03,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:03,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:17:03,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:17:03,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 241 [2023-08-26 12:17:03,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:03,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 241 [2023-08-26 12:17:03,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:03,783 INFO L124 PetriNetUnfolderBase]: 335/575 cut-off events. [2023-08-26 12:17:03,783 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-08-26 12:17:03,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 575 events. 335/575 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2370 event pairs, 77 based on Foata normal form. 52/623 useless extension candidates. Maximal degree in co-relation 1370. Up to 343 conditions per place. [2023-08-26 12:17:03,787 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 27 selfloop transitions, 4 changer transitions 19/52 dead transitions. [2023-08-26 12:17:03,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 52 transitions, 244 flow [2023-08-26 12:17:03,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:17:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:17:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-08-26 12:17:03,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44149377593360994 [2023-08-26 12:17:03,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-08-26 12:17:03,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-08-26 12:17:03,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:03,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-08-26 12:17:03,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,794 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,794 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 64 flow. Second operand 5 states and 532 transitions. [2023-08-26 12:17:03,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 52 transitions, 244 flow [2023-08-26 12:17:03,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 226 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 12:17:03,797 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 88 flow [2023-08-26 12:17:03,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2023-08-26 12:17:03,799 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2023-08-26 12:17:03,799 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 88 flow [2023-08-26 12:17:03,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:03,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:03,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:03,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:17:03,800 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:17:03,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:03,801 INFO L85 PathProgramCache]: Analyzing trace with hash 883165367, now seen corresponding path program 1 times [2023-08-26 12:17:03,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:03,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724028683] [2023-08-26 12:17:03,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:03,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:17:03,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:03,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724028683] [2023-08-26 12:17:03,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724028683] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:03,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:03,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:17:03,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702311880] [2023-08-26 12:17:03,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:03,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:17:03,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:04,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:17:04,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:17:04,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 241 [2023-08-26 12:17:04,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:04,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 241 [2023-08-26 12:17:04,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:04,151 INFO L124 PetriNetUnfolderBase]: 179/338 cut-off events. [2023-08-26 12:17:04,151 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-08-26 12:17:04,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 338 events. 179/338 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1248 event pairs, 49 based on Foata normal form. 31/365 useless extension candidates. Maximal degree in co-relation 964. Up to 119 conditions per place. [2023-08-26 12:17:04,153 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 34 selfloop transitions, 7 changer transitions 18/61 dead transitions. [2023-08-26 12:17:04,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 61 transitions, 334 flow [2023-08-26 12:17:04,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:17:04,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:17:04,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 637 transitions. [2023-08-26 12:17:04,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4405255878284924 [2023-08-26 12:17:04,156 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 637 transitions. [2023-08-26 12:17:04,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 637 transitions. [2023-08-26 12:17:04,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:04,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 637 transitions. [2023-08-26 12:17:04,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,162 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,162 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 88 flow. Second operand 6 states and 637 transitions. [2023-08-26 12:17:04,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 61 transitions, 334 flow [2023-08-26 12:17:04,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 61 transitions, 328 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 12:17:04,167 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 138 flow [2023-08-26 12:17:04,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-26 12:17:04,169 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2023-08-26 12:17:04,169 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 138 flow [2023-08-26 12:17:04,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:04,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:04,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:17:04,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:17:04,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:04,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1185378553, now seen corresponding path program 1 times [2023-08-26 12:17:04,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:04,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586376692] [2023-08-26 12:17:04,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:17:04,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:04,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586376692] [2023-08-26 12:17:04,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586376692] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:04,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:04,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:17:04,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982995498] [2023-08-26 12:17:04,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:04,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:17:04,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:04,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:17:04,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:17:04,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 241 [2023-08-26 12:17:04,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:04,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 241 [2023-08-26 12:17:04,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:04,582 INFO L124 PetriNetUnfolderBase]: 121/235 cut-off events. [2023-08-26 12:17:04,582 INFO L125 PetriNetUnfolderBase]: For 247/247 co-relation queries the response was YES. [2023-08-26 12:17:04,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 235 events. 121/235 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 777 event pairs, 46 based on Foata normal form. 9/240 useless extension candidates. Maximal degree in co-relation 719. Up to 92 conditions per place. [2023-08-26 12:17:04,584 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 31 selfloop transitions, 10 changer transitions 9/52 dead transitions. [2023-08-26 12:17:04,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 330 flow [2023-08-26 12:17:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:17:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:17:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 724 transitions. [2023-08-26 12:17:04,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42916419679905154 [2023-08-26 12:17:04,587 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 724 transitions. [2023-08-26 12:17:04,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 724 transitions. [2023-08-26 12:17:04,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:04,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 724 transitions. [2023-08-26 12:17:04,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,594 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,594 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 138 flow. Second operand 7 states and 724 transitions. [2023-08-26 12:17:04,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 330 flow [2023-08-26 12:17:04,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 287 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-08-26 12:17:04,599 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 136 flow [2023-08-26 12:17:04,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-08-26 12:17:04,600 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2023-08-26 12:17:04,601 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 136 flow [2023-08-26 12:17:04,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:04,602 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] [2023-08-26 12:17:04,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:17:04,602 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:17:04,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash 240470357, now seen corresponding path program 1 times [2023-08-26 12:17:04,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:04,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965536416] [2023-08-26 12:17:04,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:17:04,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:04,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965536416] [2023-08-26 12:17:04,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965536416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:04,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:04,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:17:04,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609717554] [2023-08-26 12:17:04,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:04,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:17:04,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:04,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:17:04,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:17:04,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 241 [2023-08-26 12:17:04,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:04,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 241 [2023-08-26 12:17:04,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:04,940 INFO L124 PetriNetUnfolderBase]: 158/296 cut-off events. [2023-08-26 12:17:04,941 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2023-08-26 12:17:04,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 296 events. 158/296 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1105 event pairs, 9 based on Foata normal form. 1/296 useless extension candidates. Maximal degree in co-relation 905. Up to 165 conditions per place. [2023-08-26 12:17:04,942 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 41 selfloop transitions, 7 changer transitions 13/62 dead transitions. [2023-08-26 12:17:04,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 440 flow [2023-08-26 12:17:04,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:17:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:17:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2023-08-26 12:17:04,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44232365145228214 [2023-08-26 12:17:04,945 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 533 transitions. [2023-08-26 12:17:04,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 533 transitions. [2023-08-26 12:17:04,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:04,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 533 transitions. [2023-08-26 12:17:04,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,949 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,949 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 136 flow. Second operand 5 states and 533 transitions. [2023-08-26 12:17:04,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 440 flow [2023-08-26 12:17:04,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 62 transitions, 358 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-26 12:17:04,952 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 135 flow [2023-08-26 12:17:04,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-26 12:17:04,954 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2023-08-26 12:17:04,954 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 135 flow [2023-08-26 12:17:04,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:04,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:04,954 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] [2023-08-26 12:17:04,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:17:04,955 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:17:04,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:04,955 INFO L85 PathProgramCache]: Analyzing trace with hash 25981227, now seen corresponding path program 2 times [2023-08-26 12:17:04,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:04,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517375537] [2023-08-26 12:17:04,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:04,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:17:05,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:05,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517375537] [2023-08-26 12:17:05,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517375537] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:05,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:05,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:17:05,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634014606] [2023-08-26 12:17:05,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:05,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:17:05,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:17:05,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:17:05,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 241 [2023-08-26 12:17:05,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 135 flow. Second operand has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:05,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:05,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 241 [2023-08-26 12:17:05,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:05,610 INFO L124 PetriNetUnfolderBase]: 167/336 cut-off events. [2023-08-26 12:17:05,610 INFO L125 PetriNetUnfolderBase]: For 342/342 co-relation queries the response was YES. [2023-08-26 12:17:05,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 336 events. 167/336 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1261 event pairs, 14 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 1059. Up to 147 conditions per place. [2023-08-26 12:17:05,612 INFO L140 encePairwiseOnDemand]: 232/241 looper letters, 33 selfloop transitions, 12 changer transitions 43/89 dead transitions. [2023-08-26 12:17:05,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 89 transitions, 546 flow [2023-08-26 12:17:05,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 12:17:05,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 12:17:05,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1284 transitions. [2023-08-26 12:17:05,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4098308330673476 [2023-08-26 12:17:05,617 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1284 transitions. [2023-08-26 12:17:05,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1284 transitions. [2023-08-26 12:17:05,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:05,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1284 transitions. [2023-08-26 12:17:05,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.76923076923077) internal successors, (1284), 13 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:05,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 241.0) internal successors, (3374), 14 states have internal predecessors, (3374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:05,627 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 241.0) internal successors, (3374), 14 states have internal predecessors, (3374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:05,627 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 135 flow. Second operand 13 states and 1284 transitions. [2023-08-26 12:17:05,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 89 transitions, 546 flow [2023-08-26 12:17:05,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 546 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:17:05,631 INFO L231 Difference]: Finished difference. Result has 57 places, 35 transitions, 183 flow [2023-08-26 12:17:05,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=183, PETRI_PLACES=57, PETRI_TRANSITIONS=35} [2023-08-26 12:17:05,632 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2023-08-26 12:17:05,632 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 35 transitions, 183 flow [2023-08-26 12:17:05,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:05,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:05,634 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] [2023-08-26 12:17:05,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:17:05,634 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:17:05,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1259969265, now seen corresponding path program 3 times [2023-08-26 12:17:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:05,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564646734] [2023-08-26 12:17:05,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:05,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:17:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:17:06,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:17:06,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564646734] [2023-08-26 12:17:06,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564646734] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:17:06,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:17:06,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:17:06,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956922607] [2023-08-26 12:17:06,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:17:06,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:17:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:17:06,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:17:06,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:17:06,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 241 [2023-08-26 12:17:06,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 35 transitions, 183 flow. Second operand has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:06,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:17:06,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 241 [2023-08-26 12:17:06,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:17:06,428 INFO L124 PetriNetUnfolderBase]: 74/180 cut-off events. [2023-08-26 12:17:06,428 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2023-08-26 12:17:06,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 180 events. 74/180 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 611 event pairs, 15 based on Foata normal form. 1/181 useless extension candidates. Maximal degree in co-relation 687. Up to 69 conditions per place. [2023-08-26 12:17:06,429 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 40 selfloop transitions, 6 changer transitions 20/68 dead transitions. [2023-08-26 12:17:06,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 488 flow [2023-08-26 12:17:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:17:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:17:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2023-08-26 12:17:06,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4280774550484094 [2023-08-26 12:17:06,432 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 619 transitions. [2023-08-26 12:17:06,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 619 transitions. [2023-08-26 12:17:06,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:17:06,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 619 transitions. [2023-08-26 12:17:06,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:06,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:06,437 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:06,437 INFO L175 Difference]: Start difference. First operand has 57 places, 35 transitions, 183 flow. Second operand 6 states and 619 transitions. [2023-08-26 12:17:06,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 488 flow [2023-08-26 12:17:06,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 457 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-08-26 12:17:06,440 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 180 flow [2023-08-26 12:17:06,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2023-08-26 12:17:06,441 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2023-08-26 12:17:06,441 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 180 flow [2023-08-26 12:17:06,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.57142857142857) internal successors, (690), 7 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:17:06,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:17:06,441 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] [2023-08-26 12:17:06,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:17:06,442 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 12:17:06,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:17:06,442 INFO L85 PathProgramCache]: Analyzing trace with hash 93311631, now seen corresponding path program 4 times [2023-08-26 12:17:06,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:17:06,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008674681] [2023-08-26 12:17:06,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:17:06,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:17:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:17:06,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:17:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:17:06,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:17:06,565 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:17:06,565 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 12:17:06,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 12:17:06,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 12:17:06,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 12:17:06,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 12:17:06,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 12:17:06,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 12:17:06,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 12:17:06,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 12:17:06,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 12:17:06,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 12:17:06,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 12:17:06,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:17:06,568 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:17:06,573 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:17:06,574 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:17:06,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:17:06 BasicIcfg [2023-08-26 12:17:06,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:17:06,649 INFO L158 Benchmark]: Toolchain (without parser) took 10255.19ms. Allocated memory was 337.6MB in the beginning and 562.0MB in the end (delta: 224.4MB). Free memory was 312.7MB in the beginning and 249.3MB in the end (delta: 63.4MB). Peak memory consumption was 289.4MB. Max. memory is 16.0GB. [2023-08-26 12:17:06,649 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 337.6MB. Free memory is still 313.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:17:06,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.19ms. Allocated memory is still 337.6MB. Free memory was 312.2MB in the beginning and 289.7MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:17:06,649 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.61ms. Allocated memory is still 337.6MB. Free memory was 289.7MB in the beginning and 287.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:17:06,650 INFO L158 Benchmark]: Boogie Preprocessor took 54.09ms. Allocated memory is still 337.6MB. Free memory was 287.1MB in the beginning and 285.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:17:06,650 INFO L158 Benchmark]: RCFGBuilder took 687.88ms. Allocated memory is still 337.6MB. Free memory was 285.0MB in the beginning and 301.8MB in the end (delta: -16.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 12:17:06,650 INFO L158 Benchmark]: TraceAbstraction took 8908.96ms. Allocated memory was 337.6MB in the beginning and 562.0MB in the end (delta: 224.4MB). Free memory was 300.8MB in the beginning and 249.3MB in the end (delta: 51.5MB). Peak memory consumption was 276.8MB. Max. memory is 16.0GB. [2023-08-26 12:17:06,651 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 337.6MB. Free memory is still 313.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 528.19ms. Allocated memory is still 337.6MB. Free memory was 312.2MB in the beginning and 289.7MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.61ms. Allocated memory is still 337.6MB. Free memory was 289.7MB in the beginning and 287.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.09ms. Allocated memory is still 337.6MB. Free memory was 287.1MB in the beginning and 285.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 687.88ms. Allocated memory is still 337.6MB. Free memory was 285.0MB in the beginning and 301.8MB in the end (delta: -16.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 8908.96ms. Allocated memory was 337.6MB in the beginning and 562.0MB in the end (delta: 224.4MB). Free memory was 300.8MB in the beginning and 249.3MB in the end (delta: 51.5MB). Peak memory consumption was 276.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 122 PlacesBefore, 38 PlacesAfterwards, 115 TransitionsBefore, 29 TransitionsAfterwards, 2038 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 123 TotalNumberOfCompositions, 5089 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2768, independent: 2618, independent conditional: 0, independent unconditional: 2618, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1167, independent: 1129, independent conditional: 0, independent unconditional: 1129, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2768, independent: 1489, independent conditional: 0, independent unconditional: 1489, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 1167, unknown conditional: 0, unknown unconditional: 1167] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2345; [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2345, ((void *)0), P0, ((void *)0))=7, t2345={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2346; [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2346, ((void *)0), P1, ((void *)0))=8, t2345={5:0}, t2346={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L837] 0 pthread_t t2347; [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2347, ((void *)0), P2, ((void *)0))=9, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={66:67}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: 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: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 143 locations, 12 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: 8.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 708 IncrementalHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 3 mSDtfsCounter, 708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=9, InterpolantAutomatonStates: 54, 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.3s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 12:17:06,690 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...