/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:05:45,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:05:45,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:05:45,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:05:45,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:05:45,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:05:45,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:05:45,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:05:45,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:05:45,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:05:45,626 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:05:45,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:05:45,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:05:45,627 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:05:45,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:05:45,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:05:45,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:05:45,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:05:45,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:05:45,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:05:45,629 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:05:45,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:05:45,633 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:05:45,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:05:45,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:05:45,634 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:05:45,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:05:45,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:05:45,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:05:45,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:05:45,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:05:45,636 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:05:45,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:05:45,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:05:45,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:05:45,637 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:05:45,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:05:45,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:05:45,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:05:45,937 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:05:45,939 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:05:45,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 12:05:47,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:05:47,342 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:05:47,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 12:05:47,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b6b60a1b/3ac928949a994c57b40655420306a3c2/FLAG6d92941e5 [2023-08-26 12:05:47,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b6b60a1b/3ac928949a994c57b40655420306a3c2 [2023-08-26 12:05:47,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:05:47,392 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:05:47,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:05:47,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:05:47,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:05:47,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:05:47" (1/1) ... [2023-08-26 12:05:47,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@147d57de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47, skipping insertion in model container [2023-08-26 12:05:47,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:05:47" (1/1) ... [2023-08-26 12:05:47,460 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:05:47,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:05:47,853 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:05:47,881 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:05:47,883 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:05:47,920 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:05:47,957 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:05:47,958 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:05:47,964 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:05:47,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47 WrapperNode [2023-08-26 12:05:47,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:05:47,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:05:47,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:05:47,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:05:47,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47" (1/1) ... [2023-08-26 12:05:48,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47" (1/1) ... [2023-08-26 12:05:48,038 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143 [2023-08-26 12:05:48,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:05:48,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:05:48,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:05:48,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:05:48,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47" (1/1) ... [2023-08-26 12:05:48,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47" (1/1) ... [2023-08-26 12:05:48,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47" (1/1) ... [2023-08-26 12:05:48,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47" (1/1) ... [2023-08-26 12:05:48,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47" (1/1) ... [2023-08-26 12:05:48,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47" (1/1) ... [2023-08-26 12:05:48,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47" (1/1) ... [2023-08-26 12:05:48,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47" (1/1) ... [2023-08-26 12:05:48,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:05:48,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:05:48,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:05:48,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:05:48,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47" (1/1) ... [2023-08-26 12:05:48,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:05:48,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:05:48,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:05:48,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:05:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:05:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:05:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:05:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:05:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:05:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:05:48,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:05:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:05:48,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:05:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:05:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:05:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:05:48,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:05:48,157 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:05:48,280 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:05:48,282 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:05:48,536 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:05:48,696 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:05:48,696 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:05:48,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:05:48 BoogieIcfgContainer [2023-08-26 12:05:48,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:05:48,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:05:48,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:05:48,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:05:48,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:05:47" (1/3) ... [2023-08-26 12:05:48,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a777dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:05:48, skipping insertion in model container [2023-08-26 12:05:48,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:47" (2/3) ... [2023-08-26 12:05:48,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a777dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:05:48, skipping insertion in model container [2023-08-26 12:05:48,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:05:48" (3/3) ... [2023-08-26 12:05:48,706 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 12:05:48,721 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:05:48,721 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 12:05:48,721 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:05:48,768 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:05:48,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 99 transitions, 208 flow [2023-08-26 12:05:48,856 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-26 12:05:48,856 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:05:48,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-26 12:05:48,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 99 transitions, 208 flow [2023-08-26 12:05:48,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 97 transitions, 200 flow [2023-08-26 12:05:48,869 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:05:48,881 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-26 12:05:48,885 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-26 12:05:48,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 97 transitions, 200 flow [2023-08-26 12:05:48,917 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-26 12:05:48,918 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:05:48,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-08-26 12:05:48,920 INFO L119 LiptonReduction]: Number of co-enabled transitions 1320 [2023-08-26 12:05:53,274 INFO L134 LiptonReduction]: Checked pairs total: 3491 [2023-08-26 12:05:53,274 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-08-26 12:05:53,285 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:05:53,290 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;@3023d5cb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:05:53,290 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-26 12:05:53,291 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:05:53,292 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:05:53,292 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:05:53,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:53,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:05:53,292 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:05:53,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:53,296 INFO L85 PathProgramCache]: Analyzing trace with hash 475, now seen corresponding path program 1 times [2023-08-26 12:05:53,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:53,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137730458] [2023-08-26 12:05:53,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:53,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:05:53,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:53,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137730458] [2023-08-26 12:05:53,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137730458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:53,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:53,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:05:53,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811567464] [2023-08-26 12:05:53,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:53,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:05:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:53,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:05:53,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:05:53,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 207 [2023-08-26 12:05:53,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:53,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:53,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 207 [2023-08-26 12:05:53,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:53,600 INFO L124 PetriNetUnfolderBase]: 142/265 cut-off events. [2023-08-26 12:05:53,600 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 12:05:53,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 265 events. 142/265 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1035 event pairs, 142 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 520. Up to 252 conditions per place. [2023-08-26 12:05:53,605 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 15 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-08-26 12:05:53,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 72 flow [2023-08-26 12:05:53,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:05:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:05:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 193 transitions. [2023-08-26 12:05:53,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46618357487922707 [2023-08-26 12:05:53,620 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 193 transitions. [2023-08-26 12:05:53,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 193 transitions. [2023-08-26 12:05:53,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:53,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 193 transitions. [2023-08-26 12:05:53,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:53,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:53,635 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:53,637 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 2 states and 193 transitions. [2023-08-26 12:05:53,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 72 flow [2023-08-26 12:05:53,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:05:53,640 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2023-08-26 12:05:53,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-08-26 12:05:53,645 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -5 predicate places. [2023-08-26 12:05:53,645 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2023-08-26 12:05:53,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:53,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:53,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:05:53,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:05:53,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:05:53,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:53,654 INFO L85 PathProgramCache]: Analyzing trace with hash 448225997, now seen corresponding path program 1 times [2023-08-26 12:05:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:53,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459757817] [2023-08-26 12:05:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:53,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:05:53,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:53,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459757817] [2023-08-26 12:05:53,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459757817] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:53,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:53,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:05:53,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178018577] [2023-08-26 12:05:53,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:53,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:05:53,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:53,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:05:53,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:05:53,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 207 [2023-08-26 12:05:53,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:53,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:53,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 207 [2023-08-26 12:05:53,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:54,029 INFO L124 PetriNetUnfolderBase]: 111/242 cut-off events. [2023-08-26 12:05:54,030 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:05:54,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 242 events. 111/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1019 event pairs, 18 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 452. Up to 154 conditions per place. [2023-08-26 12:05:54,032 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 17 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2023-08-26 12:05:54,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 94 flow [2023-08-26 12:05:54,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:05:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:05:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-26 12:05:54,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45088566827697263 [2023-08-26 12:05:54,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-26 12:05:54,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-26 12:05:54,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:54,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-26 12:05:54,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:54,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:54,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:54,038 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 280 transitions. [2023-08-26 12:05:54,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 94 flow [2023-08-26 12:05:54,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 94 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:05:54,039 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-08-26 12:05:54,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-26 12:05:54,040 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-08-26 12:05:54,041 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-08-26 12:05:54,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:54,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:54,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:54,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:05:54,042 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:05:54,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1248475673, now seen corresponding path program 1 times [2023-08-26 12:05:54,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:54,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756117956] [2023-08-26 12:05:54,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:05:54,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:54,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756117956] [2023-08-26 12:05:54,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756117956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:54,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:54,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:05:54,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248701538] [2023-08-26 12:05:54,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:54,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:05:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:54,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:05:54,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:05:54,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 207 [2023-08-26 12:05:54,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:54,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:54,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 207 [2023-08-26 12:05:54,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:54,369 INFO L124 PetriNetUnfolderBase]: 97/192 cut-off events. [2023-08-26 12:05:54,369 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 12:05:54,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 192 events. 97/192 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 685 event pairs, 37 based on Foata normal form. 8/199 useless extension candidates. Maximal degree in co-relation 393. Up to 117 conditions per place. [2023-08-26 12:05:54,371 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 17 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-26 12:05:54,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 88 flow [2023-08-26 12:05:54,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:05:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:05:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-08-26 12:05:54,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4428341384863124 [2023-08-26 12:05:54,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-08-26 12:05:54,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-08-26 12:05:54,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:54,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-08-26 12:05:54,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:54,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:54,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:54,378 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 3 states and 275 transitions. [2023-08-26 12:05:54,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 88 flow [2023-08-26 12:05:54,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:05:54,379 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 44 flow [2023-08-26 12:05:54,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-26 12:05:54,380 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -4 predicate places. [2023-08-26 12:05:54,380 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 44 flow [2023-08-26 12:05:54,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:54,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:54,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:54,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:05:54,381 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:05:54,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:54,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1493692769, now seen corresponding path program 1 times [2023-08-26 12:05:54,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:54,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705508635] [2023-08-26 12:05:54,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:54,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:05:54,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:54,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705508635] [2023-08-26 12:05:54,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705508635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:54,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:54,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:05:54,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424345197] [2023-08-26 12:05:54,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:54,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:05:54,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:54,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:05:54,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:05:54,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 207 [2023-08-26 12:05:54,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 44 flow. Second operand has 6 states, 6 states have (on average 77.33333333333333) internal successors, (464), 6 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:54,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:54,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 207 [2023-08-26 12:05:54,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:55,086 INFO L124 PetriNetUnfolderBase]: 105/222 cut-off events. [2023-08-26 12:05:55,086 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:05:55,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 222 events. 105/222 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 821 event pairs, 24 based on Foata normal form. 3/225 useless extension candidates. Maximal degree in co-relation 470. Up to 151 conditions per place. [2023-08-26 12:05:55,089 INFO L140 encePairwiseOnDemand]: 201/207 looper letters, 25 selfloop transitions, 8 changer transitions 0/35 dead transitions. [2023-08-26 12:05:55,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 35 transitions, 152 flow [2023-08-26 12:05:55,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:05:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:05:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 415 transitions. [2023-08-26 12:05:55,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40096618357487923 [2023-08-26 12:05:55,091 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 415 transitions. [2023-08-26 12:05:55,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 415 transitions. [2023-08-26 12:05:55,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:55,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 415 transitions. [2023-08-26 12:05:55,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:55,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:55,095 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:55,096 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 44 flow. Second operand 5 states and 415 transitions. [2023-08-26 12:05:55,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 35 transitions, 152 flow [2023-08-26 12:05:55,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:05:55,099 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 90 flow [2023-08-26 12:05:55,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-08-26 12:05:55,100 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-08-26 12:05:55,100 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 90 flow [2023-08-26 12:05:55,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.33333333333333) internal successors, (464), 6 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:55,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:55,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:55,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:05:55,102 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:05:55,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:55,102 INFO L85 PathProgramCache]: Analyzing trace with hash 220141358, now seen corresponding path program 1 times [2023-08-26 12:05:55,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:55,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098950142] [2023-08-26 12:05:55,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:55,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:05:55,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:55,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098950142] [2023-08-26 12:05:55,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098950142] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:55,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:55,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:05:55,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531308194] [2023-08-26 12:05:55,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:55,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:05:55,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:55,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:05:55,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:05:55,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 207 [2023-08-26 12:05:55,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:55,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:55,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 207 [2023-08-26 12:05:55,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:55,546 INFO L124 PetriNetUnfolderBase]: 107/226 cut-off events. [2023-08-26 12:05:55,546 INFO L125 PetriNetUnfolderBase]: For 144/150 co-relation queries the response was YES. [2023-08-26 12:05:55,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 226 events. 107/226 cut-off events. For 144/150 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 857 event pairs, 19 based on Foata normal form. 1/227 useless extension candidates. Maximal degree in co-relation 590. Up to 150 conditions per place. [2023-08-26 12:05:55,548 INFO L140 encePairwiseOnDemand]: 200/207 looper letters, 25 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-08-26 12:05:55,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 207 flow [2023-08-26 12:05:55,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:05:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:05:55,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2023-08-26 12:05:55,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4260869565217391 [2023-08-26 12:05:55,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 441 transitions. [2023-08-26 12:05:55,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 441 transitions. [2023-08-26 12:05:55,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:55,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 441 transitions. [2023-08-26 12:05:55,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:55,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:55,554 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:55,554 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 90 flow. Second operand 5 states and 441 transitions. [2023-08-26 12:05:55,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 207 flow [2023-08-26 12:05:55,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 207 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:05:55,557 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 154 flow [2023-08-26 12:05:55,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2023-08-26 12:05:55,559 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2023-08-26 12:05:55,559 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 154 flow [2023-08-26 12:05:55,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:55,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:55,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:55,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:05:55,560 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:05:55,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:55,561 INFO L85 PathProgramCache]: Analyzing trace with hash 128000678, now seen corresponding path program 2 times [2023-08-26 12:05:55,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:55,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785685652] [2023-08-26 12:05:55,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:55,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:05:56,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:56,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785685652] [2023-08-26 12:05:56,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785685652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:56,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:56,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:05:56,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740465221] [2023-08-26 12:05:56,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:56,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:05:56,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:56,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:05:56,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:05:56,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 207 [2023-08-26 12:05:56,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:56,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 207 [2023-08-26 12:05:56,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:56,193 INFO L124 PetriNetUnfolderBase]: 108/230 cut-off events. [2023-08-26 12:05:56,193 INFO L125 PetriNetUnfolderBase]: For 315/323 co-relation queries the response was YES. [2023-08-26 12:05:56,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 230 events. 108/230 cut-off events. For 315/323 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 880 event pairs, 19 based on Foata normal form. 1/231 useless extension candidates. Maximal degree in co-relation 727. Up to 151 conditions per place. [2023-08-26 12:05:56,195 INFO L140 encePairwiseOnDemand]: 200/207 looper letters, 26 selfloop transitions, 12 changer transitions 0/40 dead transitions. [2023-08-26 12:05:56,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 271 flow [2023-08-26 12:05:56,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:05:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:05:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 436 transitions. [2023-08-26 12:05:56,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421256038647343 [2023-08-26 12:05:56,198 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 436 transitions. [2023-08-26 12:05:56,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 436 transitions. [2023-08-26 12:05:56,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:56,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 436 transitions. [2023-08-26 12:05:56,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,203 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,203 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 154 flow. Second operand 5 states and 436 transitions. [2023-08-26 12:05:56,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 271 flow [2023-08-26 12:05:56,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 260 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 12:05:56,208 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 190 flow [2023-08-26 12:05:56,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-08-26 12:05:56,211 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2023-08-26 12:05:56,213 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 190 flow [2023-08-26 12:05:56,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:56,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:56,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:05:56,214 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:05:56,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:56,215 INFO L85 PathProgramCache]: Analyzing trace with hash 128980898, now seen corresponding path program 3 times [2023-08-26 12:05:56,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:56,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291595538] [2023-08-26 12:05:56,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:56,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:05:56,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:56,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291595538] [2023-08-26 12:05:56,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291595538] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:56,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:56,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:05:56,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711776252] [2023-08-26 12:05:56,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:56,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:05:56,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:56,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:05:56,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:05:56,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 207 [2023-08-26 12:05:56,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:56,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 207 [2023-08-26 12:05:56,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:56,673 INFO L124 PetriNetUnfolderBase]: 106/227 cut-off events. [2023-08-26 12:05:56,673 INFO L125 PetriNetUnfolderBase]: For 460/468 co-relation queries the response was YES. [2023-08-26 12:05:56,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 227 events. 106/227 cut-off events. For 460/468 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 861 event pairs, 19 based on Foata normal form. 3/230 useless extension candidates. Maximal degree in co-relation 761. Up to 148 conditions per place. [2023-08-26 12:05:56,675 INFO L140 encePairwiseOnDemand]: 200/207 looper letters, 27 selfloop transitions, 13 changer transitions 0/42 dead transitions. [2023-08-26 12:05:56,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 315 flow [2023-08-26 12:05:56,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:05:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:05:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 435 transitions. [2023-08-26 12:05:56,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42028985507246375 [2023-08-26 12:05:56,677 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 435 transitions. [2023-08-26 12:05:56,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 435 transitions. [2023-08-26 12:05:56,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:56,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 435 transitions. [2023-08-26 12:05:56,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,680 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,680 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 190 flow. Second operand 5 states and 435 transitions. [2023-08-26 12:05:56,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 315 flow [2023-08-26 12:05:56,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 292 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 12:05:56,683 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 236 flow [2023-08-26 12:05:56,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-08-26 12:05:56,684 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2023-08-26 12:05:56,684 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 236 flow [2023-08-26 12:05:56,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.66666666666667) internal successors, (496), 6 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:56,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:56,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:05:56,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:05:56,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:56,685 INFO L85 PathProgramCache]: Analyzing trace with hash 920188182, now seen corresponding path program 1 times [2023-08-26 12:05:56,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:56,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485375839] [2023-08-26 12:05:56,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:56,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:05:56,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:56,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485375839] [2023-08-26 12:05:56,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485375839] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:56,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:56,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:05:56,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515204604] [2023-08-26 12:05:56,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:56,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:05:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:56,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:05:56,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:05:56,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 207 [2023-08-26 12:05:56,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:56,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 207 [2023-08-26 12:05:56,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:56,893 INFO L124 PetriNetUnfolderBase]: 57/147 cut-off events. [2023-08-26 12:05:56,893 INFO L125 PetriNetUnfolderBase]: For 379/384 co-relation queries the response was YES. [2023-08-26 12:05:56,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 147 events. 57/147 cut-off events. For 379/384 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 545 event pairs, 18 based on Foata normal form. 24/170 useless extension candidates. Maximal degree in co-relation 513. Up to 55 conditions per place. [2023-08-26 12:05:56,895 INFO L140 encePairwiseOnDemand]: 202/207 looper letters, 32 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2023-08-26 12:05:56,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 316 flow [2023-08-26 12:05:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:05:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:05:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 354 transitions. [2023-08-26 12:05:56,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.427536231884058 [2023-08-26 12:05:56,897 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 354 transitions. [2023-08-26 12:05:56,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 354 transitions. [2023-08-26 12:05:56,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:56,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 354 transitions. [2023-08-26 12:05:56,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,899 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,899 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 236 flow. Second operand 4 states and 354 transitions. [2023-08-26 12:05:56,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 316 flow [2023-08-26 12:05:56,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 249 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-08-26 12:05:56,902 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 153 flow [2023-08-26 12:05:56,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-26 12:05:56,904 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2023-08-26 12:05:56,904 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 153 flow [2023-08-26 12:05:56,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:56,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:56,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:56,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:05:56,905 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:05:56,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:56,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1946593555, now seen corresponding path program 1 times [2023-08-26 12:05:56,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:56,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696794736] [2023-08-26 12:05:56,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:56,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:05:57,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696794736] [2023-08-26 12:05:57,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696794736] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:57,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:57,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:05:57,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346816159] [2023-08-26 12:05:57,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:57,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:05:57,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:57,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:05:57,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:05:57,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 207 [2023-08-26 12:05:57,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:57,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:57,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 207 [2023-08-26 12:05:57,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:57,147 INFO L124 PetriNetUnfolderBase]: 45/123 cut-off events. [2023-08-26 12:05:57,147 INFO L125 PetriNetUnfolderBase]: For 153/156 co-relation queries the response was YES. [2023-08-26 12:05:57,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 123 events. 45/123 cut-off events. For 153/156 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 436 event pairs, 19 based on Foata normal form. 10/132 useless extension candidates. Maximal degree in co-relation 396. Up to 55 conditions per place. [2023-08-26 12:05:57,148 INFO L140 encePairwiseOnDemand]: 202/207 looper letters, 25 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2023-08-26 12:05:57,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 245 flow [2023-08-26 12:05:57,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:05:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:05:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2023-08-26 12:05:57,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41545893719806765 [2023-08-26 12:05:57,150 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 430 transitions. [2023-08-26 12:05:57,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 430 transitions. [2023-08-26 12:05:57,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:57,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 430 transitions. [2023-08-26 12:05:57,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:57,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:57,153 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:57,154 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 153 flow. Second operand 5 states and 430 transitions. [2023-08-26 12:05:57,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 245 flow [2023-08-26 12:05:57,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 232 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 12:05:57,155 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 170 flow [2023-08-26 12:05:57,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-26 12:05:57,156 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2023-08-26 12:05:57,157 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 170 flow [2023-08-26 12:05:57,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:57,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:57,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:57,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:05:57,157 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:05:57,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:57,158 INFO L85 PathProgramCache]: Analyzing trace with hash -310561663, now seen corresponding path program 1 times [2023-08-26 12:05:57,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:57,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022798636] [2023-08-26 12:05:57,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:57,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:05:57,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:57,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022798636] [2023-08-26 12:05:57,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022798636] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:57,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:57,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:05:57,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579774536] [2023-08-26 12:05:57,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:57,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:05:57,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:57,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:05:57,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:05:57,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 207 [2023-08-26 12:05:57,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:57,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:57,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 207 [2023-08-26 12:05:57,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:57,380 INFO L124 PetriNetUnfolderBase]: 76/191 cut-off events. [2023-08-26 12:05:57,380 INFO L125 PetriNetUnfolderBase]: For 395/397 co-relation queries the response was YES. [2023-08-26 12:05:57,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 191 events. 76/191 cut-off events. For 395/397 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 763 event pairs, 9 based on Foata normal form. 3/194 useless extension candidates. Maximal degree in co-relation 685. Up to 94 conditions per place. [2023-08-26 12:05:57,381 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 23 selfloop transitions, 1 changer transitions 25/52 dead transitions. [2023-08-26 12:05:57,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 397 flow [2023-08-26 12:05:57,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:05:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:05:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 360 transitions. [2023-08-26 12:05:57,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2023-08-26 12:05:57,383 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 360 transitions. [2023-08-26 12:05:57,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 360 transitions. [2023-08-26 12:05:57,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:57,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 360 transitions. [2023-08-26 12:05:57,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:57,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:57,386 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:57,386 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 170 flow. Second operand 4 states and 360 transitions. [2023-08-26 12:05:57,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 397 flow [2023-08-26 12:05:57,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 380 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 12:05:57,389 INFO L231 Difference]: Finished difference. Result has 45 places, 24 transitions, 130 flow [2023-08-26 12:05:57,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=45, PETRI_TRANSITIONS=24} [2023-08-26 12:05:57,390 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2023-08-26 12:05:57,390 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 24 transitions, 130 flow [2023-08-26 12:05:57,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:57,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:57,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:57,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:05:57,392 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:05:57,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1927381965, now seen corresponding path program 2 times [2023-08-26 12:05:57,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:57,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808894467] [2023-08-26 12:05:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:57,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:05:57,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:05:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:05:57,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:05:57,468 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:05:57,469 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (8 of 9 remaining) [2023-08-26 12:05:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (7 of 9 remaining) [2023-08-26 12:05:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-26 12:05:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-26 12:05:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-08-26 12:05:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-08-26 12:05:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-26 12:05:57,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-08-26 12:05:57,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 9 remaining) [2023-08-26 12:05:57,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:05:57,472 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:57,477 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:05:57,477 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:05:57,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:05:57 BasicIcfg [2023-08-26 12:05:57,514 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:05:57,515 INFO L158 Benchmark]: Toolchain (without parser) took 10123.20ms. Allocated memory was 362.8MB in the beginning and 478.2MB in the end (delta: 115.3MB). Free memory was 337.5MB in the beginning and 305.0MB in the end (delta: 32.6MB). Peak memory consumption was 148.7MB. Max. memory is 16.0GB. [2023-08-26 12:05:57,515 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 362.8MB. Free memory was 339.1MB in the beginning and 339.0MB in the end (delta: 146.2kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:05:57,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.40ms. Allocated memory is still 362.8MB. Free memory was 337.5MB in the beginning and 314.8MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:05:57,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.67ms. Allocated memory is still 362.8MB. Free memory was 314.8MB in the beginning and 312.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:05:57,516 INFO L158 Benchmark]: Boogie Preprocessor took 42.97ms. Allocated memory is still 362.8MB. Free memory was 312.1MB in the beginning and 310.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:05:57,516 INFO L158 Benchmark]: RCFGBuilder took 611.02ms. Allocated memory is still 362.8MB. Free memory was 310.3MB in the beginning and 335.4MB in the end (delta: -25.1MB). Peak memory consumption was 37.5MB. Max. memory is 16.0GB. [2023-08-26 12:05:57,516 INFO L158 Benchmark]: TraceAbstraction took 8814.50ms. Allocated memory was 362.8MB in the beginning and 478.2MB in the end (delta: 115.3MB). Free memory was 335.4MB in the beginning and 305.0MB in the end (delta: 30.4MB). Peak memory consumption was 144.7MB. Max. memory is 16.0GB. [2023-08-26 12:05:57,518 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.13ms. Allocated memory is still 362.8MB. Free memory was 339.1MB in the beginning and 339.0MB in the end (delta: 146.2kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 570.40ms. Allocated memory is still 362.8MB. Free memory was 337.5MB in the beginning and 314.8MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 72.67ms. Allocated memory is still 362.8MB. Free memory was 314.8MB in the beginning and 312.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.97ms. Allocated memory is still 362.8MB. Free memory was 312.1MB in the beginning and 310.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 611.02ms. Allocated memory is still 362.8MB. Free memory was 310.3MB in the beginning and 335.4MB in the end (delta: -25.1MB). Peak memory consumption was 37.5MB. Max. memory is 16.0GB. * TraceAbstraction took 8814.50ms. Allocated memory was 362.8MB in the beginning and 478.2MB in the end (delta: 115.3MB). Free memory was 335.4MB in the beginning and 305.0MB in the end (delta: 30.4MB). Peak memory consumption was 144.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 101 PlacesBefore, 29 PlacesAfterwards, 97 TransitionsBefore, 22 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 6 FixpointIterations, 46 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 108 TotalNumberOfCompositions, 3491 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1496, independent: 1360, independent conditional: 0, independent unconditional: 1360, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 790, independent: 754, independent conditional: 0, independent unconditional: 754, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1496, independent: 606, independent conditional: 0, independent unconditional: 606, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 790, unknown conditional: 0, unknown unconditional: 790] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091, ((void *)0), P0, ((void *)0))=-1, t1091={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1092, ((void *)0), P1, ((void *)0))=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L833] 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", "mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={54:53}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, 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: 805]: 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: 803]: 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 5 procedures, 118 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 477 IncrementalHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 5 mSDtfsCounter, 477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=7, InterpolantAutomatonStates: 41, 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.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 12:05:57,538 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...