/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:17:58,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:17:58,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:17:58,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:17:58,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:17:58,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:17:58,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:17:58,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:17:58,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:17:58,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:17:58,626 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:17:58,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:17:58,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:17:58,627 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:17:58,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:17:58,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:17:58,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:17:58,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:17:58,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:17:58,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:17:58,629 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:17:58,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:17:58,629 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:17:58,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:17:58,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:17:58,630 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:17:58,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:17:58,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:17:58,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:17:58,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:17:58,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:17:58,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:17:58,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:17:58,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:17:58,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:17:58,633 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:17:58,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:17:58,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:17:58,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:17:58,978 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:17:58,978 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:17:58,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2023-08-26 18:18:00,274 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:18:00,508 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:18:00,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_pso.opt_rmo.opt_tso.opt.i [2023-08-26 18:18:00,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a157a80/cfbdec9a825a49d49736aa0f39212bd5/FLAG5ff115cca [2023-08-26 18:18:00,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3a157a80/cfbdec9a825a49d49736aa0f39212bd5 [2023-08-26 18:18:00,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:18:00,549 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:18:00,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:18:00,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:18:00,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:18:00,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:18:00" (1/1) ... [2023-08-26 18:18:00,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd88c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:00, skipping insertion in model container [2023-08-26 18:18:00,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:18:00" (1/1) ... [2023-08-26 18:18:00,613 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:18:00,958 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:18:00,971 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:18:01,001 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:18:01,002 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:18:01,036 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:18:01,076 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:18:01,077 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:18:01,083 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:18:01,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:01 WrapperNode [2023-08-26 18:18:01,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:18:01,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:18:01,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:18:01,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:18:01,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:01" (1/1) ... [2023-08-26 18:18:01,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:01" (1/1) ... [2023-08-26 18:18:01,156 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-08-26 18:18:01,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:18:01,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:18:01,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:18:01,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:18:01,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:01" (1/1) ... [2023-08-26 18:18:01,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:01" (1/1) ... [2023-08-26 18:18:01,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:01" (1/1) ... [2023-08-26 18:18:01,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:01" (1/1) ... [2023-08-26 18:18:01,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:01" (1/1) ... [2023-08-26 18:18:01,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:01" (1/1) ... [2023-08-26 18:18:01,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:01" (1/1) ... [2023-08-26 18:18:01,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:01" (1/1) ... [2023-08-26 18:18:01,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:18:01,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:18:01,185 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:18:01,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:18:01,186 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:01" (1/1) ... [2023-08-26 18:18:01,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:18:01,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:18:01,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 18:18:01,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 18:18:01,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:18:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:18:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:18:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:18:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:18:01,276 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:18:01,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:18:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:18:01,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:18:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:18:01,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:18:01,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:18:01,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:18:01,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:18:01,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:18:01,281 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:18:01,439 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:18:01,440 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:18:01,681 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:18:01,844 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:18:01,845 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:18:01,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:18:01 BoogieIcfgContainer [2023-08-26 18:18:01,847 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:18:01,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:18:01,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:18:01,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:18:01,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:18:00" (1/3) ... [2023-08-26 18:18:01,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520592bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:18:01, skipping insertion in model container [2023-08-26 18:18:01,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:18:01" (2/3) ... [2023-08-26 18:18:01,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520592bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:18:01, skipping insertion in model container [2023-08-26 18:18:01,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:18:01" (3/3) ... [2023-08-26 18:18:01,855 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt_rmo.opt_tso.opt.i [2023-08-26 18:18:01,870 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:18:01,870 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 18:18:01,871 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:18:01,936 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:18:01,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 116 transitions, 247 flow [2023-08-26 18:18:02,046 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-26 18:18:02,047 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:02,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-26 18:18:02,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 116 transitions, 247 flow [2023-08-26 18:18:02,056 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 113 transitions, 235 flow [2023-08-26 18:18:02,060 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:18:02,076 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-26 18:18:02,079 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 113 transitions, 235 flow [2023-08-26 18:18:02,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 113 transitions, 235 flow [2023-08-26 18:18:02,112 INFO L124 PetriNetUnfolderBase]: 3/113 cut-off events. [2023-08-26 18:18:02,112 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:02,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-26 18:18:02,115 INFO L119 LiptonReduction]: Number of co-enabled transitions 1908 [2023-08-26 18:18:05,903 INFO L134 LiptonReduction]: Checked pairs total: 4819 [2023-08-26 18:18:05,903 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-26 18:18:05,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:18:05,920 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;@7bdec1ec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:18:05,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 18:18:05,922 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:18:05,922 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 18:18:05,922 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:05,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:05,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:18:05,923 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:18:05,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:05,927 INFO L85 PathProgramCache]: Analyzing trace with hash 511, now seen corresponding path program 1 times [2023-08-26 18:18:05,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:05,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132027899] [2023-08-26 18:18:05,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:05,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:18:06,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:06,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132027899] [2023-08-26 18:18:06,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132027899] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:06,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:06,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:18:06,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109118368] [2023-08-26 18:18:06,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:06,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:18:06,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:06,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:18:06,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:18:06,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 232 [2023-08-26 18:18:06,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:06,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:06,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 232 [2023-08-26 18:18:06,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:06,369 INFO L124 PetriNetUnfolderBase]: 910/1374 cut-off events. [2023-08-26 18:18:06,370 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 18:18:06,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 1374 events. 910/1374 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6226 event pairs, 910 based on Foata normal form. 60/1205 useless extension candidates. Maximal degree in co-relation 2761. Up to 1362 conditions per place. [2023-08-26 18:18:06,385 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 21 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-26 18:18:06,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 97 flow [2023-08-26 18:18:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:18:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:18:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 236 transitions. [2023-08-26 18:18:06,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5086206896551724 [2023-08-26 18:18:06,400 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 236 transitions. [2023-08-26 18:18:06,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 236 transitions. [2023-08-26 18:18:06,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:06,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 236 transitions. [2023-08-26 18:18:06,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 118.0) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:06,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:06,410 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:06,411 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 2 states and 236 transitions. [2023-08-26 18:18:06,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 97 flow [2023-08-26 18:18:06,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:18:06,415 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-08-26 18:18:06,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-26 18:18:06,420 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-08-26 18:18:06,420 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-08-26 18:18:06,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:06,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:06,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:06,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:18:06,422 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:18:06,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:06,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1398974941, now seen corresponding path program 1 times [2023-08-26 18:18:06,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:06,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736856739] [2023-08-26 18:18:06,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:06,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:18:06,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:06,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736856739] [2023-08-26 18:18:06,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736856739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:06,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:06,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:18:06,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179759401] [2023-08-26 18:18:06,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:06,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:18:06,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:06,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:18:06,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:18:06,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-08-26 18:18:06,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:06,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:06,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-08-26 18:18:06,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:06,939 INFO L124 PetriNetUnfolderBase]: 719/1171 cut-off events. [2023-08-26 18:18:06,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:18:06,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2292 conditions, 1171 events. 719/1171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5718 event pairs, 146 based on Foata normal form. 0/1074 useless extension candidates. Maximal degree in co-relation 2289. Up to 826 conditions per place. [2023-08-26 18:18:06,946 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 25 selfloop transitions, 2 changer transitions 4/33 dead transitions. [2023-08-26 18:18:06,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 134 flow [2023-08-26 18:18:06,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:18:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:18:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-08-26 18:18:06,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4899425287356322 [2023-08-26 18:18:06,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-08-26 18:18:06,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-08-26 18:18:06,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:06,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-08-26 18:18:06,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:06,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:06,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:06,956 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 341 transitions. [2023-08-26 18:18:06,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 134 flow [2023-08-26 18:18:06,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:18:06,958 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 50 flow [2023-08-26 18:18:06,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2023-08-26 18:18:06,959 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-26 18:18:06,959 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 50 flow [2023-08-26 18:18:06,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:06,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:06,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:06,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:18:06,960 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:18:06,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:06,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1498660978, now seen corresponding path program 1 times [2023-08-26 18:18:06,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:06,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885276676] [2023-08-26 18:18:06,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:06,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:18:07,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:07,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885276676] [2023-08-26 18:18:07,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885276676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:07,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:07,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:18:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551128060] [2023-08-26 18:18:07,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:07,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:18:07,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:07,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:18:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:18:07,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 18:18:07,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:07,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:07,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 18:18:07,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:07,546 INFO L124 PetriNetUnfolderBase]: 1337/2070 cut-off events. [2023-08-26 18:18:07,547 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2023-08-26 18:18:07,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4323 conditions, 2070 events. 1337/2070 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9926 event pairs, 413 based on Foata normal form. 116/2186 useless extension candidates. Maximal degree in co-relation 4319. Up to 1219 conditions per place. [2023-08-26 18:18:07,558 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 30 selfloop transitions, 5 changer transitions 21/56 dead transitions. [2023-08-26 18:18:07,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 56 transitions, 242 flow [2023-08-26 18:18:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:18:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:18:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 523 transitions. [2023-08-26 18:18:07,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4508620689655172 [2023-08-26 18:18:07,560 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 523 transitions. [2023-08-26 18:18:07,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 523 transitions. [2023-08-26 18:18:07,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:07,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 523 transitions. [2023-08-26 18:18:07,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:07,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:07,567 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:07,567 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 50 flow. Second operand 5 states and 523 transitions. [2023-08-26 18:18:07,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 56 transitions, 242 flow [2023-08-26 18:18:07,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:18:07,570 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 96 flow [2023-08-26 18:18:07,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-08-26 18:18:07,572 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2023-08-26 18:18:07,572 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 96 flow [2023-08-26 18:18:07,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:07,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:07,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:07,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:18:07,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:18:07,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:07,578 INFO L85 PathProgramCache]: Analyzing trace with hash 786129590, now seen corresponding path program 1 times [2023-08-26 18:18:07,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:07,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413739131] [2023-08-26 18:18:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:07,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:18:07,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:07,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413739131] [2023-08-26 18:18:07,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413739131] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:07,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:07,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:18:07,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816078868] [2023-08-26 18:18:07,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:07,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:18:07,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:07,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:18:07,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:18:07,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 232 [2023-08-26 18:18:07,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:07,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:07,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 232 [2023-08-26 18:18:07,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:07,976 INFO L124 PetriNetUnfolderBase]: 661/1122 cut-off events. [2023-08-26 18:18:07,976 INFO L125 PetriNetUnfolderBase]: For 693/707 co-relation queries the response was YES. [2023-08-26 18:18:07,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 1122 events. 661/1122 cut-off events. For 693/707 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5627 event pairs, 135 based on Foata normal form. 100/1199 useless extension candidates. Maximal degree in co-relation 2933. Up to 741 conditions per place. [2023-08-26 18:18:07,984 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 38 selfloop transitions, 7 changer transitions 10/59 dead transitions. [2023-08-26 18:18:07,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 328 flow [2023-08-26 18:18:07,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:18:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:18:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-08-26 18:18:07,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603448275862069 [2023-08-26 18:18:07,986 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-08-26 18:18:07,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-08-26 18:18:07,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:07,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-08-26 18:18:07,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:07,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:07,991 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:07,991 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 96 flow. Second operand 5 states and 534 transitions. [2023-08-26 18:18:07,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 328 flow [2023-08-26 18:18:07,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 18:18:07,995 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 138 flow [2023-08-26 18:18:07,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-08-26 18:18:07,996 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2023-08-26 18:18:07,996 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 138 flow [2023-08-26 18:18:07,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:07,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:07,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:07,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:18:07,997 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:18:07,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:07,997 INFO L85 PathProgramCache]: Analyzing trace with hash -431935376, now seen corresponding path program 1 times [2023-08-26 18:18:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091357022] [2023-08-26 18:18:07,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:07,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:18:08,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:08,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091357022] [2023-08-26 18:18:08,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091357022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:08,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:08,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:08,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413132213] [2023-08-26 18:18:08,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:08,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:08,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:08,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:08,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:08,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 232 [2023-08-26 18:18:08,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:08,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:08,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 232 [2023-08-26 18:18:08,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:08,412 INFO L124 PetriNetUnfolderBase]: 424/772 cut-off events. [2023-08-26 18:18:08,412 INFO L125 PetriNetUnfolderBase]: For 692/712 co-relation queries the response was YES. [2023-08-26 18:18:08,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2498 conditions, 772 events. 424/772 cut-off events. For 692/712 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3852 event pairs, 49 based on Foata normal form. 72/827 useless extension candidates. Maximal degree in co-relation 2488. Up to 277 conditions per place. [2023-08-26 18:18:08,417 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 46 selfloop transitions, 13 changer transitions 18/81 dead transitions. [2023-08-26 18:18:08,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 81 transitions, 498 flow [2023-08-26 18:18:08,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:18:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:18:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 746 transitions. [2023-08-26 18:18:08,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45935960591133007 [2023-08-26 18:18:08,420 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 746 transitions. [2023-08-26 18:18:08,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 746 transitions. [2023-08-26 18:18:08,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:08,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 746 transitions. [2023-08-26 18:18:08,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:08,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:08,426 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:08,426 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 138 flow. Second operand 7 states and 746 transitions. [2023-08-26 18:18:08,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 81 transitions, 498 flow [2023-08-26 18:18:08,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 81 transitions, 492 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 18:18:08,433 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 220 flow [2023-08-26 18:18:08,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-26 18:18:08,435 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 7 predicate places. [2023-08-26 18:18:08,435 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 220 flow [2023-08-26 18:18:08,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:08,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:08,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:08,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:18:08,436 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:18:08,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash -792839335, now seen corresponding path program 1 times [2023-08-26 18:18:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:08,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138994352] [2023-08-26 18:18:08,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:08,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:18:08,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:08,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138994352] [2023-08-26 18:18:08,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138994352] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:08,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:08,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:18:08,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648684768] [2023-08-26 18:18:08,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:08,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:18:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:08,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:18:08,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:18:08,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 232 [2023-08-26 18:18:08,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:08,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:08,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 232 [2023-08-26 18:18:08,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:08,865 INFO L124 PetriNetUnfolderBase]: 364/665 cut-off events. [2023-08-26 18:18:08,865 INFO L125 PetriNetUnfolderBase]: For 1237/1252 co-relation queries the response was YES. [2023-08-26 18:18:08,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2477 conditions, 665 events. 364/665 cut-off events. For 1237/1252 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3288 event pairs, 40 based on Foata normal form. 29/678 useless extension candidates. Maximal degree in co-relation 2465. Up to 237 conditions per place. [2023-08-26 18:18:08,869 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 42 selfloop transitions, 17 changer transitions 18/81 dead transitions. [2023-08-26 18:18:08,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 554 flow [2023-08-26 18:18:08,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:18:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:18:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 940 transitions. [2023-08-26 18:18:08,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4501915708812261 [2023-08-26 18:18:08,873 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 940 transitions. [2023-08-26 18:18:08,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 940 transitions. [2023-08-26 18:18:08,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:08,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 940 transitions. [2023-08-26 18:18:08,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.44444444444444) internal successors, (940), 9 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:08,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:08,879 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 232.0) internal successors, (2320), 10 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:08,879 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 220 flow. Second operand 9 states and 940 transitions. [2023-08-26 18:18:08,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 554 flow [2023-08-26 18:18:08,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 510 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-26 18:18:08,892 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 242 flow [2023-08-26 18:18:08,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=242, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2023-08-26 18:18:08,895 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-08-26 18:18:08,895 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 242 flow [2023-08-26 18:18:08,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:08,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:08,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:08,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:18:08,896 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:18:08,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:08,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1508849720, now seen corresponding path program 1 times [2023-08-26 18:18:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:08,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769136238] [2023-08-26 18:18:08,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:08,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:18:09,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:09,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769136238] [2023-08-26 18:18:09,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769136238] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:09,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:09,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:09,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932110360] [2023-08-26 18:18:09,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:09,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:09,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:09,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:09,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:09,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-08-26 18:18:09,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:09,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:09,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-08-26 18:18:09,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:09,372 INFO L124 PetriNetUnfolderBase]: 502/970 cut-off events. [2023-08-26 18:18:09,373 INFO L125 PetriNetUnfolderBase]: For 2460/2460 co-relation queries the response was YES. [2023-08-26 18:18:09,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3720 conditions, 970 events. 502/970 cut-off events. For 2460/2460 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5438 event pairs, 85 based on Foata normal form. 1/971 useless extension candidates. Maximal degree in co-relation 3704. Up to 510 conditions per place. [2023-08-26 18:18:09,378 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 31 selfloop transitions, 1 changer transitions 48/81 dead transitions. [2023-08-26 18:18:09,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 710 flow [2023-08-26 18:18:09,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:18:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:18:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2023-08-26 18:18:09,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44482758620689655 [2023-08-26 18:18:09,380 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2023-08-26 18:18:09,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2023-08-26 18:18:09,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:09,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2023-08-26 18:18:09,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:09,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:09,384 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:09,384 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 242 flow. Second operand 5 states and 516 transitions. [2023-08-26 18:18:09,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 710 flow [2023-08-26 18:18:09,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 81 transitions, 567 flow, removed 35 selfloop flow, removed 9 redundant places. [2023-08-26 18:18:09,398 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 139 flow [2023-08-26 18:18:09,398 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=52, PETRI_TRANSITIONS=29} [2023-08-26 18:18:09,398 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2023-08-26 18:18:09,399 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 139 flow [2023-08-26 18:18:09,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:09,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:09,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:09,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:18:09,399 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:18:09,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1457485572, now seen corresponding path program 2 times [2023-08-26 18:18:09,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:09,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218660622] [2023-08-26 18:18:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:09,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:18:09,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 18:18:09,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:18:09,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218660622] [2023-08-26 18:18:09,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218660622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:18:09,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:18:09,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:18:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552135356] [2023-08-26 18:18:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:18:09,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:18:09,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:18:09,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:18:09,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:18:09,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 232 [2023-08-26 18:18:09,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 29 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:09,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:18:09,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 232 [2023-08-26 18:18:09,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:18:09,658 INFO L124 PetriNetUnfolderBase]: 164/328 cut-off events. [2023-08-26 18:18:09,658 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2023-08-26 18:18:09,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 328 events. 164/328 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1259 event pairs, 39 based on Foata normal form. 1/329 useless extension candidates. Maximal degree in co-relation 1075. Up to 162 conditions per place. [2023-08-26 18:18:09,660 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 27 selfloop transitions, 4 changer transitions 19/50 dead transitions. [2023-08-26 18:18:09,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 338 flow [2023-08-26 18:18:09,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:18:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:18:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2023-08-26 18:18:09,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43448275862068964 [2023-08-26 18:18:09,662 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 504 transitions. [2023-08-26 18:18:09,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 504 transitions. [2023-08-26 18:18:09,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:18:09,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 504 transitions. [2023-08-26 18:18:09,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:09,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:09,666 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:09,666 INFO L175 Difference]: Start difference. First operand has 52 places, 29 transitions, 139 flow. Second operand 5 states and 504 transitions. [2023-08-26 18:18:09,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 338 flow [2023-08-26 18:18:09,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 314 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-08-26 18:18:09,668 INFO L231 Difference]: Finished difference. Result has 44 places, 26 transitions, 126 flow [2023-08-26 18:18:09,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=44, PETRI_TRANSITIONS=26} [2023-08-26 18:18:09,669 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2023-08-26 18:18:09,669 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 26 transitions, 126 flow [2023-08-26 18:18:09,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:18:09,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:18:09,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:09,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:18:09,670 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:18:09,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:18:09,670 INFO L85 PathProgramCache]: Analyzing trace with hash 290802356, now seen corresponding path program 3 times [2023-08-26 18:18:09,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:18:09,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772328038] [2023-08-26 18:18:09,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:18:09,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:18:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:18:09,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:18:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:18:09,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:18:09,755 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:18:09,756 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 18:18:09,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 18:18:09,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 18:18:09,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 18:18:09,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 18:18:09,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 18:18:09,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 18:18:09,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 18:18:09,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 18:18:09,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 18:18:09,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 18:18:09,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 18:18:09,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:18:09,759 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-26 18:18:09,764 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:18:09,764 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:18:09,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:18:09 BasicIcfg [2023-08-26 18:18:09,808 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:18:09,808 INFO L158 Benchmark]: Toolchain (without parser) took 9259.33ms. Allocated memory was 352.3MB in the beginning and 494.9MB in the end (delta: 142.6MB). Free memory was 309.4MB in the beginning and 271.1MB in the end (delta: 38.3MB). Peak memory consumption was 180.9MB. Max. memory is 16.0GB. [2023-08-26 18:18:09,809 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 352.3MB. Free memory was 329.7MB in the beginning and 329.6MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:18:09,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.28ms. Allocated memory is still 352.3MB. Free memory was 309.4MB in the beginning and 286.3MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-26 18:18:09,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.56ms. Allocated memory is still 352.3MB. Free memory was 286.3MB in the beginning and 284.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:18:09,810 INFO L158 Benchmark]: Boogie Preprocessor took 26.63ms. Allocated memory is still 352.3MB. Free memory was 284.2MB in the beginning and 282.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:18:09,810 INFO L158 Benchmark]: RCFGBuilder took 662.20ms. Allocated memory is still 352.3MB. Free memory was 282.1MB in the beginning and 248.6MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-26 18:18:09,810 INFO L158 Benchmark]: TraceAbstraction took 7957.45ms. Allocated memory was 352.3MB in the beginning and 494.9MB in the end (delta: 142.6MB). Free memory was 247.5MB in the beginning and 271.1MB in the end (delta: -23.6MB). Peak memory consumption was 120.1MB. Max. memory is 16.0GB. [2023-08-26 18:18:09,811 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 352.3MB. Free memory was 329.7MB in the beginning and 329.6MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 533.28ms. Allocated memory is still 352.3MB. Free memory was 309.4MB in the beginning and 286.3MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 72.56ms. Allocated memory is still 352.3MB. Free memory was 286.3MB in the beginning and 284.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.63ms. Allocated memory is still 352.3MB. Free memory was 284.2MB in the beginning and 282.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 662.20ms. Allocated memory is still 352.3MB. Free memory was 282.1MB in the beginning and 248.6MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 7957.45ms. Allocated memory was 352.3MB in the beginning and 494.9MB in the end (delta: 142.6MB). Free memory was 247.5MB in the beginning and 271.1MB in the end (delta: -23.6MB). Peak memory consumption was 120.1MB. 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: 3.8s, 120 PlacesBefore, 39 PlacesAfterwards, 113 TransitionsBefore, 30 TransitionsAfterwards, 1908 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 116 TotalNumberOfCompositions, 4819 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2307, independent: 2151, independent conditional: 0, independent unconditional: 2151, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1061, independent: 1031, independent conditional: 0, independent unconditional: 1031, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2307, independent: 1120, independent conditional: 0, independent unconditional: 1120, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 1061, unknown conditional: 0, unknown unconditional: 1061] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1394; [L824] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1394, ((void *)0), P0, ((void *)0))=-3, t1394={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t1395; [L826] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1395, ((void *)0), P1, ((void *)0))=-2, t1394={5:0}, t1395={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t1396; [L828] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1396, ((void *)0), P2, ((void *)0))=-1, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 y$w_buff1 = y$w_buff0 [L787] 3 y$w_buff0 = 1 [L788] 3 y$w_buff1_used = y$w_buff0_used [L789] 3 y$w_buff0_used = (_Bool)1 [L790] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L790] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L758] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1394={5:0}, t1395={6:0}, t1396={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L841] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L843] 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", "mix052_pso.opt_rmo.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: -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: 826]: 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: 824]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 583 IncrementalHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 7 mSDtfsCounter, 583 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=6, 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, 1.4s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 18:18:09,832 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...