/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:15:20,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:15:20,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:15:20,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:15:20,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:15:20,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:15:20,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:15:20,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:15:20,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:15:20,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:15:20,273 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:15:20,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:15:20,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:15:20,274 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:15:20,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:15:20,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:15:20,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:15:20,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:15:20,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:15:20,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:15:20,276 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:15:20,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:15:20,277 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:15:20,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:15:20,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:15:20,278 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:15:20,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:15:20,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:15:20,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:15:20,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:15:20,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:15:20,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:15:20,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:15:20,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:15:20,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:15:20,281 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:15:20,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:15:20,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:15:20,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:15:20,647 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:15:20,648 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:15:20,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-26 18:15:21,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:15:22,195 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:15:22,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt_tso.opt.i [2023-08-26 18:15:22,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82794e16b/080529049512449a8d63714a0defe70c/FLAGfeb7210c9 [2023-08-26 18:15:22,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82794e16b/080529049512449a8d63714a0defe70c [2023-08-26 18:15:22,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:15:22,223 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:15:22,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:15:22,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:15:22,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:15:22,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:15:22" (1/1) ... [2023-08-26 18:15:22,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad4ce9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22, skipping insertion in model container [2023-08-26 18:15:22,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:15:22" (1/1) ... [2023-08-26 18:15:22,290 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:15:22,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:15:22,670 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:15:22,700 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:15:22,702 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:15:22,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:15:22,776 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:15:22,777 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:15:22,783 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:15:22,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22 WrapperNode [2023-08-26 18:15:22,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:15:22,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:15:22,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:15:22,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:15:22,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22" (1/1) ... [2023-08-26 18:15:22,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22" (1/1) ... [2023-08-26 18:15:22,857 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 159 [2023-08-26 18:15:22,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:15:22,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:15:22,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:15:22,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:15:22,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22" (1/1) ... [2023-08-26 18:15:22,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22" (1/1) ... [2023-08-26 18:15:22,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22" (1/1) ... [2023-08-26 18:15:22,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22" (1/1) ... [2023-08-26 18:15:22,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22" (1/1) ... [2023-08-26 18:15:22,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22" (1/1) ... [2023-08-26 18:15:22,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22" (1/1) ... [2023-08-26 18:15:22,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22" (1/1) ... [2023-08-26 18:15:22,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:15:22,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:15:22,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:15:22,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:15:22,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22" (1/1) ... [2023-08-26 18:15:22,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:15:22,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:15:22,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 18:15:22,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 18:15:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:15:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:15:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:15:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:15:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:15:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:15:22,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:15:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:15:22,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:15:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:15:22,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:15:22,966 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:15:22,967 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:15:22,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:15:22,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:15:22,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:15:22,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:15:22,968 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:15:23,111 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:15:23,112 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:15:23,357 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:15:23,469 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:15:23,470 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:15:23,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:15:23 BoogieIcfgContainer [2023-08-26 18:15:23,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:15:23,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:15:23,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:15:23,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:15:23,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:15:22" (1/3) ... [2023-08-26 18:15:23,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d7f21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:15:23, skipping insertion in model container [2023-08-26 18:15:23,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:15:22" (2/3) ... [2023-08-26 18:15:23,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d7f21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:15:23, skipping insertion in model container [2023-08-26 18:15:23,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:15:23" (3/3) ... [2023-08-26 18:15:23,479 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt_tso.opt.i [2023-08-26 18:15:23,494 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:15:23,495 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 18:15:23,495 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:15:23,559 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:15:23,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 306 flow [2023-08-26 18:15:23,653 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-26 18:15:23,653 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:15:23,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 18:15:23,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 143 transitions, 306 flow [2023-08-26 18:15:23,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 139 transitions, 290 flow [2023-08-26 18:15:23,667 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:15:23,679 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-26 18:15:23,683 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-26 18:15:23,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 139 transitions, 290 flow [2023-08-26 18:15:23,737 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-26 18:15:23,737 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:15:23,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 18:15:23,746 INFO L119 LiptonReduction]: Number of co-enabled transitions 3184 [2023-08-26 18:15:28,405 INFO L134 LiptonReduction]: Checked pairs total: 8152 [2023-08-26 18:15:28,405 INFO L136 LiptonReduction]: Total number of compositions: 147 [2023-08-26 18:15:28,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:15:28,432 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;@1979103d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:15:28,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 18:15:28,434 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:15:28,434 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:15:28,434 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:15:28,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:28,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:15:28,435 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:28,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:28,439 INFO L85 PathProgramCache]: Analyzing trace with hash 609, now seen corresponding path program 1 times [2023-08-26 18:15:28,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:28,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268247346] [2023-08-26 18:15:28,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:28,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:28,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:28,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268247346] [2023-08-26 18:15:28,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268247346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:28,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:28,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:15:28,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319605575] [2023-08-26 18:15:28,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:28,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:15:28,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:28,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:15:28,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:15:28,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2023-08-26 18:15:28,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:28,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:28,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2023-08-26 18:15:28,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:29,038 INFO L124 PetriNetUnfolderBase]: 2594/3652 cut-off events. [2023-08-26 18:15:29,039 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-08-26 18:15:29,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7347 conditions, 3652 events. 2594/3652 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 17841 event pairs, 2594 based on Foata normal form. 0/3216 useless extension candidates. Maximal degree in co-relation 7335. Up to 3592 conditions per place. [2023-08-26 18:15:29,065 INFO L140 encePairwiseOnDemand]: 281/290 looper letters, 23 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-26 18:15:29,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 27 transitions, 112 flow [2023-08-26 18:15:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:15:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:15:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2023-08-26 18:15:29,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2023-08-26 18:15:29,077 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 292 transitions. [2023-08-26 18:15:29,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 292 transitions. [2023-08-26 18:15:29,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:29,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 292 transitions. [2023-08-26 18:15:29,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,087 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,089 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 2 states and 292 transitions. [2023-08-26 18:15:29,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 27 transitions, 112 flow [2023-08-26 18:15:29,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:15:29,093 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 62 flow [2023-08-26 18:15:29,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-26 18:15:29,097 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -11 predicate places. [2023-08-26 18:15:29,098 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 62 flow [2023-08-26 18:15:29,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:29,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:29,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:15:29,099 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:29,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1359860682, now seen corresponding path program 1 times [2023-08-26 18:15:29,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:29,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692218740] [2023-08-26 18:15:29,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:29,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:29,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692218740] [2023-08-26 18:15:29,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692218740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:29,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:29,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:15:29,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815267287] [2023-08-26 18:15:29,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:29,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:15:29,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:29,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:15:29,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:15:29,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 290 [2023-08-26 18:15:29,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:29,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 290 [2023-08-26 18:15:29,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:29,814 INFO L124 PetriNetUnfolderBase]: 2075/3259 cut-off events. [2023-08-26 18:15:29,814 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:15:29,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6252 conditions, 3259 events. 2075/3259 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 18406 event pairs, 518 based on Foata normal form. 0/3111 useless extension candidates. Maximal degree in co-relation 6249. Up to 2098 conditions per place. [2023-08-26 18:15:29,834 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 29 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-26 18:15:29,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 148 flow [2023-08-26 18:15:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:15:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:15:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-26 18:15:29,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4839080459770115 [2023-08-26 18:15:29,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-26 18:15:29,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-26 18:15:29,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:29,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-26 18:15:29,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,848 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 62 flow. Second operand 3 states and 421 transitions. [2023-08-26 18:15:29,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 148 flow [2023-08-26 18:15:29,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:15:29,852 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 62 flow [2023-08-26 18:15:29,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2023-08-26 18:15:29,853 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -10 predicate places. [2023-08-26 18:15:29,854 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 62 flow [2023-08-26 18:15:29,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:29,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:29,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:29,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:15:29,858 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:29,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:29,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1155996599, now seen corresponding path program 1 times [2023-08-26 18:15:29,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:29,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618352620] [2023-08-26 18:15:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:30,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:30,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618352620] [2023-08-26 18:15:30,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618352620] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:30,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:30,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:15:30,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763370169] [2023-08-26 18:15:30,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:30,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:15:30,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:30,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:15:30,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:15:30,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 290 [2023-08-26 18:15:30,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:30,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:30,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 290 [2023-08-26 18:15:30,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:30,700 INFO L124 PetriNetUnfolderBase]: 4631/6320 cut-off events. [2023-08-26 18:15:30,700 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-08-26 18:15:30,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13063 conditions, 6320 events. 4631/6320 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 27145 event pairs, 1783 based on Foata normal form. 16/6336 useless extension candidates. Maximal degree in co-relation 13059. Up to 6129 conditions per place. [2023-08-26 18:15:30,735 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 36 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2023-08-26 18:15:30,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 184 flow [2023-08-26 18:15:30,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:15:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:15:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-08-26 18:15:30,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46206896551724136 [2023-08-26 18:15:30,737 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-08-26 18:15:30,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-08-26 18:15:30,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:30,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-08-26 18:15:30,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:30,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:30,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:30,741 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 62 flow. Second operand 3 states and 402 transitions. [2023-08-26 18:15:30,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 184 flow [2023-08-26 18:15:30,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:15:30,743 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 91 flow [2023-08-26 18:15:30,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-26 18:15:30,744 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -10 predicate places. [2023-08-26 18:15:30,744 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 91 flow [2023-08-26 18:15:30,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:30,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:30,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:30,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:15:30,745 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:30,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:30,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1279102893, now seen corresponding path program 1 times [2023-08-26 18:15:30,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:30,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515936118] [2023-08-26 18:15:30,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:30,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:30,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:30,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515936118] [2023-08-26 18:15:30,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515936118] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:30,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:30,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:15:30,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492214145] [2023-08-26 18:15:30,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:30,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:15:30,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:30,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:15:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:15:30,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 290 [2023-08-26 18:15:30,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 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 18:15:30,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:30,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 290 [2023-08-26 18:15:30,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:31,370 INFO L124 PetriNetUnfolderBase]: 4279/5856 cut-off events. [2023-08-26 18:15:31,370 INFO L125 PetriNetUnfolderBase]: For 1134/1134 co-relation queries the response was YES. [2023-08-26 18:15:31,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13636 conditions, 5856 events. 4279/5856 cut-off events. For 1134/1134 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 24396 event pairs, 1331 based on Foata normal form. 112/5968 useless extension candidates. Maximal degree in co-relation 13631. Up to 4033 conditions per place. [2023-08-26 18:15:31,407 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2023-08-26 18:15:31,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 199 flow [2023-08-26 18:15:31,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:15:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:15:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-08-26 18:15:31,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45632183908045976 [2023-08-26 18:15:31,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-08-26 18:15:31,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-08-26 18:15:31,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:31,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-08-26 18:15:31,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:31,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:31,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:31,412 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 91 flow. Second operand 3 states and 397 transitions. [2023-08-26 18:15:31,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 199 flow [2023-08-26 18:15:31,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:15:31,414 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 97 flow [2023-08-26 18:15:31,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-26 18:15:31,415 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2023-08-26 18:15:31,415 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 97 flow [2023-08-26 18:15:31,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 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 18:15:31,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:31,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:31,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:15:31,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:31,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:31,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1459317632, now seen corresponding path program 1 times [2023-08-26 18:15:31,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:31,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332795542] [2023-08-26 18:15:31,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:31,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:31,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:31,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332795542] [2023-08-26 18:15:31,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332795542] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:31,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:31,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:15:31,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004468063] [2023-08-26 18:15:31,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:31,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:15:31,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:31,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:15:31,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:15:31,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 290 [2023-08-26 18:15:31,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:31,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:31,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 290 [2023-08-26 18:15:31,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:31,952 INFO L124 PetriNetUnfolderBase]: 2323/3513 cut-off events. [2023-08-26 18:15:31,952 INFO L125 PetriNetUnfolderBase]: For 531/560 co-relation queries the response was YES. [2023-08-26 18:15:31,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7815 conditions, 3513 events. 2323/3513 cut-off events. For 531/560 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 18644 event pairs, 478 based on Foata normal form. 260/3634 useless extension candidates. Maximal degree in co-relation 7809. Up to 2353 conditions per place. [2023-08-26 18:15:31,972 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 50 selfloop transitions, 10 changer transitions 0/67 dead transitions. [2023-08-26 18:15:31,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 67 transitions, 307 flow [2023-08-26 18:15:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:15:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:15:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-26 18:15:31,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45517241379310347 [2023-08-26 18:15:31,975 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-26 18:15:31,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-26 18:15:31,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:31,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-26 18:15:31,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:31,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:31,980 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:31,980 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 97 flow. Second operand 5 states and 660 transitions. [2023-08-26 18:15:31,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 67 transitions, 307 flow [2023-08-26 18:15:31,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 67 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:15:31,982 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 166 flow [2023-08-26 18:15:31,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-08-26 18:15:31,983 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2023-08-26 18:15:31,983 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 166 flow [2023-08-26 18:15:31,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:31,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:31,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:31,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:15:31,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:31,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:31,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1937603093, now seen corresponding path program 1 times [2023-08-26 18:15:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:31,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400762673] [2023-08-26 18:15:31,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:31,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:32,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:32,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400762673] [2023-08-26 18:15:32,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400762673] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:32,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:32,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:15:32,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290372226] [2023-08-26 18:15:32,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:32,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:15:32,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:32,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:15:32,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:15:32,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 290 [2023-08-26 18:15:32,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:32,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:32,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 290 [2023-08-26 18:15:32,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:32,556 INFO L124 PetriNetUnfolderBase]: 1849/2926 cut-off events. [2023-08-26 18:15:32,556 INFO L125 PetriNetUnfolderBase]: For 1703/1792 co-relation queries the response was YES. [2023-08-26 18:15:32,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8826 conditions, 2926 events. 1849/2926 cut-off events. For 1703/1792 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 15954 event pairs, 207 based on Foata normal form. 218/3037 useless extension candidates. Maximal degree in co-relation 8817. Up to 1112 conditions per place. [2023-08-26 18:15:32,578 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 66 selfloop transitions, 19 changer transitions 0/92 dead transitions. [2023-08-26 18:15:32,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 92 transitions, 516 flow [2023-08-26 18:15:32,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:15:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:15:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 925 transitions. [2023-08-26 18:15:32,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45566502463054187 [2023-08-26 18:15:32,582 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 925 transitions. [2023-08-26 18:15:32,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 925 transitions. [2023-08-26 18:15:32,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:32,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 925 transitions. [2023-08-26 18:15:32,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:32,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:32,589 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:32,589 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 166 flow. Second operand 7 states and 925 transitions. [2023-08-26 18:15:32,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 92 transitions, 516 flow [2023-08-26 18:15:32,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 92 transitions, 511 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:15:32,602 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 295 flow [2023-08-26 18:15:32,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=295, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2023-08-26 18:15:32,605 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2023-08-26 18:15:32,607 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 295 flow [2023-08-26 18:15:32,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:32,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:32,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:32,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:15:32,608 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:32,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:32,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1878536435, now seen corresponding path program 1 times [2023-08-26 18:15:32,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:32,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396356011] [2023-08-26 18:15:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:32,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:32,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:32,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396356011] [2023-08-26 18:15:32,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396356011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:32,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:32,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:15:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387642433] [2023-08-26 18:15:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:32,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:15:32,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:32,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:15:32,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:15:32,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 290 [2023-08-26 18:15:32,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:32,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:32,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 290 [2023-08-26 18:15:32,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:33,314 INFO L124 PetriNetUnfolderBase]: 1648/2633 cut-off events. [2023-08-26 18:15:33,314 INFO L125 PetriNetUnfolderBase]: For 3883/4051 co-relation queries the response was YES. [2023-08-26 18:15:33,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9631 conditions, 2633 events. 1648/2633 cut-off events. For 3883/4051 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 14433 event pairs, 158 based on Foata normal form. 147/2681 useless extension candidates. Maximal degree in co-relation 9619. Up to 1041 conditions per place. [2023-08-26 18:15:33,330 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 72 selfloop transitions, 28 changer transitions 8/115 dead transitions. [2023-08-26 18:15:33,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 115 transitions, 775 flow [2023-08-26 18:15:33,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:15:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:15:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1188 transitions. [2023-08-26 18:15:33,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45517241379310347 [2023-08-26 18:15:33,334 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1188 transitions. [2023-08-26 18:15:33,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1188 transitions. [2023-08-26 18:15:33,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:33,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1188 transitions. [2023-08-26 18:15:33,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 132.0) internal successors, (1188), 9 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 290.0) internal successors, (2900), 10 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,342 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 290.0) internal successors, (2900), 10 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,342 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 295 flow. Second operand 9 states and 1188 transitions. [2023-08-26 18:15:33,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 115 transitions, 775 flow [2023-08-26 18:15:33,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 115 transitions, 725 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-26 18:15:33,428 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 423 flow [2023-08-26 18:15:33,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=423, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2023-08-26 18:15:33,428 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2023-08-26 18:15:33,429 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 423 flow [2023-08-26 18:15:33,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:33,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:33,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:15:33,429 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:33,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:33,430 INFO L85 PathProgramCache]: Analyzing trace with hash -304558846, now seen corresponding path program 1 times [2023-08-26 18:15:33,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:33,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562834475] [2023-08-26 18:15:33,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:33,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:33,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:33,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562834475] [2023-08-26 18:15:33,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562834475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:33,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:33,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:15:33,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106046965] [2023-08-26 18:15:33,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:33,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:15:33,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:33,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:15:33,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:15:33,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 290 [2023-08-26 18:15:33,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 423 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:33,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:33,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 290 [2023-08-26 18:15:33,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:34,182 INFO L124 PetriNetUnfolderBase]: 3751/5590 cut-off events. [2023-08-26 18:15:34,182 INFO L125 PetriNetUnfolderBase]: For 14280/14280 co-relation queries the response was YES. [2023-08-26 18:15:34,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20755 conditions, 5590 events. 3751/5590 cut-off events. For 14280/14280 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 29395 event pairs, 177 based on Foata normal form. 10/5600 useless extension candidates. Maximal degree in co-relation 20740. Up to 3432 conditions per place. [2023-08-26 18:15:34,210 INFO L140 encePairwiseOnDemand]: 282/290 looper letters, 87 selfloop transitions, 14 changer transitions 46/147 dead transitions. [2023-08-26 18:15:34,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 147 transitions, 1399 flow [2023-08-26 18:15:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:15:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:15:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2023-08-26 18:15:34,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4572413793103448 [2023-08-26 18:15:34,212 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2023-08-26 18:15:34,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2023-08-26 18:15:34,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:34,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2023-08-26 18:15:34,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:34,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:34,216 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:34,216 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 423 flow. Second operand 5 states and 663 transitions. [2023-08-26 18:15:34,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 147 transitions, 1399 flow [2023-08-26 18:15:34,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 147 transitions, 1130 flow, removed 94 selfloop flow, removed 4 redundant places. [2023-08-26 18:15:34,406 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 319 flow [2023-08-26 18:15:34,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2023-08-26 18:15:34,407 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2023-08-26 18:15:34,407 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 319 flow [2023-08-26 18:15:34,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:34,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:34,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:34,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:15:34,408 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:34,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1325544868, now seen corresponding path program 2 times [2023-08-26 18:15:34,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:34,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244844312] [2023-08-26 18:15:34,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:34,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:34,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:34,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244844312] [2023-08-26 18:15:34,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244844312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:34,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:34,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:15:34,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018873294] [2023-08-26 18:15:34,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:34,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:15:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:34,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:15:34,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:15:34,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 290 [2023-08-26 18:15:34,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:34,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:34,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 290 [2023-08-26 18:15:34,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:34,973 INFO L124 PetriNetUnfolderBase]: 2093/3253 cut-off events. [2023-08-26 18:15:34,973 INFO L125 PetriNetUnfolderBase]: For 5904/5904 co-relation queries the response was YES. [2023-08-26 18:15:34,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12225 conditions, 3253 events. 2093/3253 cut-off events. For 5904/5904 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16046 event pairs, 317 based on Foata normal form. 10/3263 useless extension candidates. Maximal degree in co-relation 12206. Up to 1816 conditions per place. [2023-08-26 18:15:34,989 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 79 selfloop transitions, 14 changer transitions 35/128 dead transitions. [2023-08-26 18:15:34,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 128 transitions, 1001 flow [2023-08-26 18:15:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:15:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:15:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 793 transitions. [2023-08-26 18:15:34,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4557471264367816 [2023-08-26 18:15:34,992 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 793 transitions. [2023-08-26 18:15:34,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 793 transitions. [2023-08-26 18:15:34,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:34,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 793 transitions. [2023-08-26 18:15:34,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:34,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:34,997 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:34,997 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 319 flow. Second operand 6 states and 793 transitions. [2023-08-26 18:15:34,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 128 transitions, 1001 flow [2023-08-26 18:15:35,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 128 transitions, 955 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-08-26 18:15:35,031 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 366 flow [2023-08-26 18:15:35,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2023-08-26 18:15:35,031 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 12 predicate places. [2023-08-26 18:15:35,031 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 366 flow [2023-08-26 18:15:35,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:35,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:35,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:35,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:15:35,032 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:35,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:35,033 INFO L85 PathProgramCache]: Analyzing trace with hash 774993224, now seen corresponding path program 3 times [2023-08-26 18:15:35,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:35,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320390231] [2023-08-26 18:15:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:35,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:35,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:35,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320390231] [2023-08-26 18:15:35,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320390231] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:35,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:35,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:15:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156526799] [2023-08-26 18:15:35,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:35,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:15:35,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:35,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:15:35,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:15:35,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 290 [2023-08-26 18:15:35,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:35,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:35,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 290 [2023-08-26 18:15:35,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:35,538 INFO L124 PetriNetUnfolderBase]: 1272/2122 cut-off events. [2023-08-26 18:15:35,538 INFO L125 PetriNetUnfolderBase]: For 3354/3568 co-relation queries the response was YES. [2023-08-26 18:15:35,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7548 conditions, 2122 events. 1272/2122 cut-off events. For 3354/3568 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11789 event pairs, 183 based on Foata normal form. 140/2191 useless extension candidates. Maximal degree in co-relation 7531. Up to 710 conditions per place. [2023-08-26 18:15:35,576 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 51 selfloop transitions, 18 changer transitions 19/99 dead transitions. [2023-08-26 18:15:35,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 99 transitions, 736 flow [2023-08-26 18:15:35,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 18:15:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 18:15:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1036 transitions. [2023-08-26 18:15:35,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44655172413793104 [2023-08-26 18:15:35,580 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1036 transitions. [2023-08-26 18:15:35,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1036 transitions. [2023-08-26 18:15:35,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:35,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1036 transitions. [2023-08-26 18:15:35,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.5) internal successors, (1036), 8 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:35,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:35,589 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:35,589 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 366 flow. Second operand 8 states and 1036 transitions. [2023-08-26 18:15:35,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 99 transitions, 736 flow [2023-08-26 18:15:35,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 99 transitions, 698 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-26 18:15:35,617 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 336 flow [2023-08-26 18:15:35,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=336, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2023-08-26 18:15:35,618 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2023-08-26 18:15:35,618 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 336 flow [2023-08-26 18:15:35,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:35,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:35,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:35,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:15:35,619 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:35,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:35,620 INFO L85 PathProgramCache]: Analyzing trace with hash -687566206, now seen corresponding path program 1 times [2023-08-26 18:15:35,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:35,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534429717] [2023-08-26 18:15:35,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:35,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:35,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:35,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534429717] [2023-08-26 18:15:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534429717] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:35,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:35,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:15:35,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796363469] [2023-08-26 18:15:35,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:35,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:15:35,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:35,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:15:35,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:15:35,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 290 [2023-08-26 18:15:35,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:35,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:35,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 290 [2023-08-26 18:15:35,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:36,072 INFO L124 PetriNetUnfolderBase]: 1150/1972 cut-off events. [2023-08-26 18:15:36,072 INFO L125 PetriNetUnfolderBase]: For 5072/5147 co-relation queries the response was YES. [2023-08-26 18:15:36,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7821 conditions, 1972 events. 1150/1972 cut-off events. For 5072/5147 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10744 event pairs, 191 based on Foata normal form. 3/1929 useless extension candidates. Maximal degree in co-relation 7801. Up to 1063 conditions per place. [2023-08-26 18:15:36,080 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 38 selfloop transitions, 1 changer transitions 54/98 dead transitions. [2023-08-26 18:15:36,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 98 transitions, 865 flow [2023-08-26 18:15:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:15:36,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:15:36,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-26 18:15:36,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732758620689655 [2023-08-26 18:15:36,083 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-26 18:15:36,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-26 18:15:36,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:36,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-26 18:15:36,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:36,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:36,087 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:36,087 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 336 flow. Second operand 4 states and 549 transitions. [2023-08-26 18:15:36,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 98 transitions, 865 flow [2023-08-26 18:15:36,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 707 flow, removed 38 selfloop flow, removed 9 redundant places. [2023-08-26 18:15:36,110 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 221 flow [2023-08-26 18:15:36,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2023-08-26 18:15:36,111 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2023-08-26 18:15:36,111 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 221 flow [2023-08-26 18:15:36,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:36,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:36,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:36,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:15:36,113 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:36,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:36,114 INFO L85 PathProgramCache]: Analyzing trace with hash 99998896, now seen corresponding path program 2 times [2023-08-26 18:15:36,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:36,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088401379] [2023-08-26 18:15:36,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:36,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:36,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088401379] [2023-08-26 18:15:36,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088401379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:36,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:36,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:15:36,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841349285] [2023-08-26 18:15:36,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:36,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:15:36,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:36,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:15:36,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:15:36,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 290 [2023-08-26 18:15:36,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:36,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:36,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 290 [2023-08-26 18:15:36,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:36,411 INFO L124 PetriNetUnfolderBase]: 579/1009 cut-off events. [2023-08-26 18:15:36,412 INFO L125 PetriNetUnfolderBase]: For 1956/1961 co-relation queries the response was YES. [2023-08-26 18:15:36,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3656 conditions, 1009 events. 579/1009 cut-off events. For 1956/1961 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5044 event pairs, 97 based on Foata normal form. 2/987 useless extension candidates. Maximal degree in co-relation 3639. Up to 477 conditions per place. [2023-08-26 18:15:36,416 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 43 selfloop transitions, 1 changer transitions 29/76 dead transitions. [2023-08-26 18:15:36,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 548 flow [2023-08-26 18:15:36,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:15:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:15:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2023-08-26 18:15:36,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672413793103448 [2023-08-26 18:15:36,418 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2023-08-26 18:15:36,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2023-08-26 18:15:36,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:36,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2023-08-26 18:15:36,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:36,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:36,421 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:36,421 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 221 flow. Second operand 4 states and 542 transitions. [2023-08-26 18:15:36,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 548 flow [2023-08-26 18:15:36,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 536 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-26 18:15:36,433 INFO L231 Difference]: Finished difference. Result has 59 places, 37 transitions, 188 flow [2023-08-26 18:15:36,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=59, PETRI_TRANSITIONS=37} [2023-08-26 18:15:36,435 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2023-08-26 18:15:36,435 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 37 transitions, 188 flow [2023-08-26 18:15:36,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:36,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:36,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:36,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:15:36,436 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:36,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:36,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1016291700, now seen corresponding path program 3 times [2023-08-26 18:15:36,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:36,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230313343] [2023-08-26 18:15:36,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:36,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:15:36,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:15:36,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:15:36,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230313343] [2023-08-26 18:15:36,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230313343] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:15:36,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:15:36,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:15:36,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407672816] [2023-08-26 18:15:36,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:15:36,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:15:36,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:15:36,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:15:36,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:15:36,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 290 [2023-08-26 18:15:36,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 37 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:36,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:15:36,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 290 [2023-08-26 18:15:36,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:15:37,116 INFO L124 PetriNetUnfolderBase]: 391/698 cut-off events. [2023-08-26 18:15:37,116 INFO L125 PetriNetUnfolderBase]: For 1376/1384 co-relation queries the response was YES. [2023-08-26 18:15:37,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 698 events. 391/698 cut-off events. For 1376/1384 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3334 event pairs, 57 based on Foata normal form. 1/656 useless extension candidates. Maximal degree in co-relation 2487. Up to 276 conditions per place. [2023-08-26 18:15:37,119 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 34 selfloop transitions, 3 changer transitions 37/78 dead transitions. [2023-08-26 18:15:37,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 560 flow [2023-08-26 18:15:37,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:15:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:15:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 911 transitions. [2023-08-26 18:15:37,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4487684729064039 [2023-08-26 18:15:37,123 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 911 transitions. [2023-08-26 18:15:37,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 911 transitions. [2023-08-26 18:15:37,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:15:37,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 911 transitions. [2023-08-26 18:15:37,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.14285714285714) internal successors, (911), 7 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:37,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:37,129 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:37,129 INFO L175 Difference]: Start difference. First operand has 59 places, 37 transitions, 188 flow. Second operand 7 states and 911 transitions. [2023-08-26 18:15:37,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 560 flow [2023-08-26 18:15:37,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 552 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 18:15:37,136 INFO L231 Difference]: Finished difference. Result has 63 places, 37 transitions, 195 flow [2023-08-26 18:15:37,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=195, PETRI_PLACES=63, PETRI_TRANSITIONS=37} [2023-08-26 18:15:37,137 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2023-08-26 18:15:37,137 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 37 transitions, 195 flow [2023-08-26 18:15:37,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:15:37,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:15:37,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:37,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:15:37,138 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 18:15:37,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:15:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash -2109720674, now seen corresponding path program 4 times [2023-08-26 18:15:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:15:37,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799967526] [2023-08-26 18:15:37,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:15:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:15:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:15:37,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:15:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:15:37,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:15:37,273 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:15:37,273 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 18:15:37,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 18:15:37,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 18:15:37,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 18:15:37,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 18:15:37,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 18:15:37,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 18:15:37,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 18:15:37,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 18:15:37,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 18:15:37,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 18:15:37,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 18:15:37,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 18:15:37,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 18:15:37,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 18:15:37,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:15:37,277 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:15:37,284 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:15:37,284 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:15:37,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:15:37 BasicIcfg [2023-08-26 18:15:37,354 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:15:37,355 INFO L158 Benchmark]: Toolchain (without parser) took 15131.67ms. Allocated memory was 371.2MB in the beginning and 880.8MB in the end (delta: 509.6MB). Free memory was 345.3MB in the beginning and 682.7MB in the end (delta: -337.4MB). Peak memory consumption was 173.2MB. Max. memory is 16.0GB. [2023-08-26 18:15:37,355 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 371.2MB. Free memory was 347.8MB in the beginning and 347.8MB in the end (delta: 24.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:15:37,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.63ms. Allocated memory is still 371.2MB. Free memory was 345.3MB in the beginning and 322.5MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:15:37,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.61ms. Allocated memory is still 371.2MB. Free memory was 322.5MB in the beginning and 319.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:15:37,355 INFO L158 Benchmark]: Boogie Preprocessor took 29.39ms. Allocated memory is still 371.2MB. Free memory was 319.5MB in the beginning and 317.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:15:37,356 INFO L158 Benchmark]: RCFGBuilder took 583.62ms. Allocated memory is still 371.2MB. Free memory was 317.4MB in the beginning and 281.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-08-26 18:15:37,356 INFO L158 Benchmark]: TraceAbstraction took 13880.29ms. Allocated memory was 371.2MB in the beginning and 880.8MB in the end (delta: 509.6MB). Free memory was 280.5MB in the beginning and 682.7MB in the end (delta: -402.2MB). Peak memory consumption was 108.2MB. Max. memory is 16.0GB. [2023-08-26 18:15:37,357 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.14ms. Allocated memory is still 371.2MB. Free memory was 347.8MB in the beginning and 347.8MB in the end (delta: 24.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 559.63ms. Allocated memory is still 371.2MB. Free memory was 345.3MB in the beginning and 322.5MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 73.61ms. Allocated memory is still 371.2MB. Free memory was 322.5MB in the beginning and 319.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.39ms. Allocated memory is still 371.2MB. Free memory was 319.5MB in the beginning and 317.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 583.62ms. Allocated memory is still 371.2MB. Free memory was 317.4MB in the beginning and 281.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 13880.29ms. Allocated memory was 371.2MB in the beginning and 880.8MB in the end (delta: 509.6MB). Free memory was 280.5MB in the beginning and 682.7MB in the end (delta: -402.2MB). Peak memory consumption was 108.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 149 PlacesBefore, 48 PlacesAfterwards, 139 TransitionsBefore, 36 TransitionsAfterwards, 3184 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 147 TotalNumberOfCompositions, 8152 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3854, independent: 3646, independent conditional: 0, independent unconditional: 3646, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1856, independent: 1807, independent conditional: 0, independent unconditional: 1807, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3854, independent: 1839, independent conditional: 0, independent unconditional: 1839, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 1856, unknown conditional: 0, unknown unconditional: 1856] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 137, Positive conditional cache size: 0, Positive unconditional cache size: 137, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t949; [L859] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t949, ((void *)0), P0, ((void *)0))=-1, t949={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t950; [L861] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t950, ((void *)0), P1, ((void *)0))=0, t949={5:0}, t950={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t951; [L863] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t951, ((void *)0), P2, ((void *)0))=1, t949={5:0}, t950={6:0}, t951={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 0 pthread_t t952; [L865] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t952, ((void *)0), P3, ((void *)0))=2, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L818] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L818] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L786] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EAX = z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t949={5:0}, t950={6:0}, t951={7:0}, t952={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix036_pso.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1143 IncrementalHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 26 mSDtfsCounter, 1143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=423occurred in iteration=7, InterpolantAutomatonStates: 66, 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, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 18:15:37,375 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...